A new model captures car-following and lane-changing behaviors in traffic.
problem Modeling stochastic microscopic traffic behaviors.
method Physics regularized Gaussian process (PRGP) approach.
result The proposed model outperforms previous methods in estimation precision.
Neural networks improve traffic flow predictions by considering lane interactions.
problem Improving traffic flow predictions at the lane level.
method Applying neural attention to deep neural networks for modeling spatiotemporal traffic dynamics.
result Attentional neural network models can use information from nearby lanes to improve predictions.
Deep RL model learns lane following in 1 day.
problem Autonomous driving without explicit rules or supervision.
method Deep reinforcement learning, continuous model-free approach, single monocular input.
result Model learns lane following from random initialization in a few episodes.
The paper uses deep reinforcement learning to control autonomous lane changes safely.
problem Safe and efficient autonomous lane changes in vehicles.
method Deep Q-networks and quadratic approximators for decision-making and control.
result Demonstrated effectiveness in simulations for decision-making and control.
We derive a monotonicity formula and classify finite Morse index solutions (positive or sign-changing, radial or not) to the following triharmonic Lane-Emden equation: \begin{equation}\nonumber (-Δ)^3 u=|u|^{p-1}u \hbox{ in } \mathbb{R}^n, \end{equation} where p is below the Joseph-Lundgren exponent. As a byproduct w…
Machine learning models predict crash rates on narrow lanes.
problem Impact of narrow lanes on arterial road vehicle crashes.
method Applied random forest and least squares boosting machine learning algorithms to crash data.
result Random forest model identified as best for studying narrow lanes' safety impact.
Paper presents a self-supervised method to infer road lane networks.
problem Difficult and costly to create lane maps for autonomous vehicles.
method Self-supervised learning using neural and search-based model.
result Model can generalize to new road layouts, unlike previous approaches.
RL agent learns to smoothly change lanes in a dynamic driving environment.
problem Challenging lane change control with safety and comfort.
method Formulated continuous action for lane change in DDPG algorithm, defined reward function for learning.
result Successfully changed lanes with 100% success rate in diverse driving situations.
TM-CNN predicts lane-level traffic speeds considering volume impact.
problem Aggregated lane-level traffic speed prediction and volume impact.
method Two-stream multi-channel CNN, data conversion, two-stream deep neural network, loss function.
result TM-CNN outperforms existing models in multi-lane traffic speed prediction.
Deep RL agent improves lane changing in unpredictable traffic.
problem Uncertainty in other drivers' behaviors and safety vs agility trade-off.
method Developed a deep reinforcement learning agent in a simulated highway environment.
result Significantly better performance in noisy environments compared to heuristic methods.
A deep reinforcement learning method with rule-based constraints improves safe and efficient lane changes in autonomous driving.
problem Complex and uncertain traffic environment challenges autonomous driving decision-making.
method Deep Q-Network (DQN) combined with rule-based constraints for lane change decision-making.
result The proposed rule-based DQN method outperforms both rule-based and DQN approaches in a real-world simulator.
A learning-based approach optimizes automated lane changes with mixed-integer optimization and machine learning.
problem Traditional motion planning methods are inefficient and lack generalization capability.
method Mixed-Integer Quadratic Problem (MIQP) for optimal trajectories, supervised learning for fast decision-making.
result The proposed model outperforms existing motion planning methods in optimality, efficiency, and generalization.
Paper proposes a statistical approach for predicting lane changes in highway scenarios.
problem Early recognition of lane changes for automated driving.
method Prototype trajectories generated from real data using Agglomerative Hierarchical Clustering. Maneuver prediction via Boosted Decision Trees and mixture model.
result Improved performance for lane change and trajectory prediction compared to a reference approach.
This paper improves anomaly detection in lane rendering images for safer navigation.
problem Anomalies in lane rendering images can mislead drivers, posing safety risks.
method Proposes a four-phase pipeline using Transformer models, self-supervised pre-training, and fine-tuning.
result The pipeline enhances detection accuracy and reduces training time.
This paper compares machine learning methods for recognizing lane change intentions from vehicle trajectories.
problem Accurately detecting and predicting lane change processes in autonomous vehicles.
method Comparison of different machine learning methods on high-dimensional time series data.
result Ensemble methods reduce Type II and Type III classification errors, while LightGBM outperforms XGBoost in training efficiency.
This research predicts vehicle movements by analyzing their intentions relative to road lanes.
problem Accurately forecasting vehicles' future movements for safe autonomous driving.
method LSTM networks with attention mechanisms applied to spatio-temporal graphs of road lanes.
result The model outperforms other state-of-the-art models in several metrics.
Study on radial solutions of Lane-Emden system on Cartan-Hadamard manifolds.
problem Existence and qualitative properties of radial solutions on Cartan-Hadamard manifolds.
method Analytical and asymptotic analysis of radial solutions, focusing on critical and supercritical exponents.
result Existence of one-parameter family of radial solutions for critical or supercritical exponents, with different dimensions of existence regions based on stochastic completeness.
Long-term lane change prediction model predicts maneuvers with 75% accuracy.
problem Predicting long-term lane changes for safer autonomous driving.
method Introduced three models: logistic regression, MLP, and RNN. Used NGSIM dataset with new labeling scheme.
result Developed model predicts 75% of lane changes with an average advanced time of 8.05 seconds.
Study on Lane-Emden equation on curved spaces, revealing new existence and non-existence phenomena.
problem Existence and non-existence of positive solutions for the Lane-Emden equation on Riemannian models.
method Analysis of the subcritical Lane-Emden equation on various Riemannian manifolds with polynomial volume growth.
result Subcritical regime divides into three ranges with distinct existence and non-existence phenomena.
Deep RL for dynamic pricing of express lanes considers multiple origins, destinations, and access locations.
problem Dynamic pricing of express lanes with multiple access points and traveler heterogeneity.
method Formulated as a POMDP, uses policy gradient methods and neural networks to determine stochastic tolls.
result Deep RL outperforms traditional methods in maximizing revenue and minimizing travel time.
We study existence, uniqueness and stability of radial solutions of the Lane-Emden-Fowler equation −Δgu=∣u∣p−1u in a class of Riemannian models (M,g) of dimension n≥3 which includes the classical hyperbolic space Hn as well as manifolds with sectional curvatures unbounded below. Sign properties…
Adaptive framework generates challenging adversarial scenarios for autonomous vehicles.
problem Lack of efficient and adaptable evaluation methods for autonomous vehicles.
method Adaptive evaluation framework using ensemble models and nonparametric Bayesian clustering.
result Adversarial scenarios significantly degrade tested autonomous vehicles' performance.
Proposes a new model for predicting future motion of road actors in autonomous vehicles.
problem Forecasting the long-term future motion of road actors for safe autonomous driving.
method Recurrent graph-based attentional approach with interpretable geometric and social relationships.
result Can produce diverse predictions conditioned on hypothetical or 'what-if' scenarios.
This study identifies RwD crash patterns on rural two-lane highways under different lighting conditions.
problem Insufficient investigation of RwD crashes under varying lighting conditions.
method Data mining using association rules mining (ARM) on crash database.
result Interesting crash patterns and risk factors identified under different lighting conditions.
SECRM-2D improves RL-based autonomous driving with safety guarantees.
problem Safety and efficiency trade-offs in RL-based autonomous driving.
method RL-based controller with safety constraints for efficient and comfortable driving.
result SECRM-2D avoids crashes and improves efficiency and comfort compared to baselines.
The paper shows non-aspherical path components in G2-moduli spaces.
problem Characterizing non-aspherical path components in G2-moduli spaces.
method Using generalised Kummer construction and resolving singularities with Eguchi-Hanson spaces, the authors establish a fibration over each path component with Eilenberg Mac Lane spaces as fibres.
result The comparison map is a fibration over each path component with Eilenberg Mac Lane spaces as fibres, indicating non-trivial families of G2-manifolds.
Let X be a subcomplex of the standard CW-decomposition of the n-dimensional torus. We exhibit an explicit optimal motion planning algorithm for X. This construction is used to calculate the topological complexity of complements of general position arrangements and Eilenberg-Mac Lane spaces associated to right-angled Ar…
Paper discovers manoeuvres from vehicle telematics data.
problem Analyzing driving behaviour from vehicle data.
method Used motif detection in time-series with a modified EMD algorithm.
result Validated motif discovery for complex manoeuvres.
This work trains a model to predict human driving directions from road scenes.
problem Defining implicit rules of human behavior for autonomous vehicles.
method Self-supervised learning of probabilistic network model.
result Model successfully generalizes to new road scenes.
The paper teaches robots to navigate by learning costs from expert demonstrations.
problem Teaching robots to navigate autonomously using only expert observations.
method Developed a map encoder and cost encoder to infer semantic class probabilities and a cost function from expert observations.
result Robots can learn to follow traffic rules in a simulator using only semantic observations.
New method predicts vehicle trajectories using map lane centers.
problem Accurate long-term vehicle trajectory prediction.
method Uses map lane centers to generate goal paths and predict trajectories.
result Model outperforms state-of-the-art approaches for 6-second horizon predictions.
In a remark in his seminal 1987 paper, Jones describes a way to define the Burau matrix of a positive braid using a metaphor of bowling a ball down a bowling alley with braided lanes. We extend this definition to allow multiple bowling balls to be bowled simultaneously. We obtain the Iwahori-Hecke algebra and a cabled …
An almost-direct product of free groups is an iterated semidirect product of finitely generated free groups in which the action of the constituent free groups on the homology of one another is trivial. We determine the structure of the cohomology ring of such a group. This is used to analyze the topological complexity …
Paper tackles AI driving competition challenges with mixed simulation and real-world data.
problem AI algorithms perform poorly in real-world environments compared to simulated ones and vice versa.
method Employed imitation learning on a mixed dataset to train algorithms equally well in all environments.
result Trained algorithms performed well in both simulated and real-world environments.
AI helps Vancouver identify where off-street parking saves time and space.
problem On-street parking inefficiencies and associated costs in Vancouver.
method Developed AI models for on-street and off-street parking, comparing time costs.
result Many areas off-street parking saves time and space, aligning with city goals.
Backdoor attacks on DRL-based traffic controllers cause stop-and-go waves or crashes.
problem Vulnerability of DRL-based traffic controllers to machine learning attacks.
method Developed a trigger design methodology based on traffic physics principles.
result Backdoored models can cause stop-and-go traffic waves or AV crashes when triggered.
This paper surveys DRL for autonomous vehicle motion planning.
problem Designing intelligent motion planning for autonomous vehicles.
method Deep Reinforcement Learning (DRL) for hierarchical motion planning.
result Survey of state-of-the-art DRL solutions for autonomous vehicle motion planning.
Deep RL mimics human driving for collision avoidance in self-driving cars.
problem Developing human-like driving policies for autonomous vehicles in mixed traffic environments.
method Model-free, deep reinforcement learning approach using a combination of rule-based and expert-driven data.
result Demonstrated human-like driving policies through Gaussian process modeling of track position and speed distributions.
Framework tracks vehicles adaptively with occlusion handling.
problem Accurate tracking of moving objects in autonomous driving with occlusions.
method Modified mixture particle filter with learning-based behavioral models.
result Framework tracks all vehicles simultaneously, handles occlusions effectively.
Integrally splits L-spectra of integers into simpler components.
problem Understanding the homotopy type of L-spectra of integers.
method Using Anderson duality and splitting into simpler spectra.
result Splits L-spectra of integers into simpler components.
Abstract sketches historical development of Lie brackets, crossed modules, and Lie-Rinehart algebras.
problem Characterizing and understanding the relationships between Lie brackets, crossed modules, and Lie-Rinehart algebras.
method Historical review and combinatorial group theory considerations.
result The mutual relationship between Lie-Rinehart algebras and Lie brackets, and the historical development of these concepts.
IDAS approach for autonomous vehicles to make decisions under merging scenarios.
problem Decision making for autonomous vehicles in merging scenarios with varying driver cooperativeness.
method IDAS approach using multi-agent reinforcement learning (MARL) with curriculum learning and masking mechanism.
result IDAS approach can handle uncertainties in real-world scenarios and make strategic decisions.
We show that for closed orientable manifolds the k-dimensional stable systole admits a metric-independent volume bound if and only if there are cohomology classes of degree k that generate cohomology in top-degree. Moreover, it turns out that in the nonorientable case such a bound does not exist for stable systoles…
Deep neural network detects driver intentions from video.
problem Detecting driver intentions for safer self-driving.
method Uses deep learning to analyze turn signals and emergency flashers.
result High per-frame accuracy in challenging scenarios.
The notion of highly structured ring spectra of prime characteristic is made precise and is studied via the versal examples S//p for prime numbers p. These can be realized as Thom spectra, and therefore relate to other Thom spectra such as the unoriented bordism spectrum MO. We compute the Hochschild and André-Quillen …
The paper proposes a method to create robust neural networks for automated driving.
problem Creating neural networks that can accurately predict road conditions and distances.
method The method introduces a non-standard loss function with tolerance to account for label variability and allows for deviations from labels.
result The proposed method results in a neural network that can robustly predict road conditions and distances, even with small label variations.
Asymmetry PRISM outperforms CPU and GPU solvers for institutional rebalancing.
problem Institutional rebalancing with deadline constraints
method Asymmetry PRISM
result Asymmetry PRISM-CPU is 4.5x to 24.1x faster than the fastest completed reference row in the same lane.
New algorithms speed up inverse reinforcement learning by solving MDPs once.
problem Slow convergence in Maximum Entropy Inverse Reinforcement Learning.
method Deep Inverse Q-learning with constraints exploiting Q-learning.
result Up to several orders of magnitude speedup compared to existing methods.