This paper proposes a convolution structure for learning SE(3)-equivariant features from 3D point clouds. It can be viewed as an equivariant version of kernel point convolutions (KPConv), a widely used convolution form to process point cloud data. Compared with existing equivariant networks, our design is simple, lightweight, fast, and easy to be integrated with existing task-specific point cloud learning pipelines. We achieve these desirable properties by combining group convolutions and quotient representations. Specifically, we discretize SO(3) to finite groups for their simplicity while using SO(2) as the stabilizer subgroup to form spherical quotient feature fields to save computations. We also propose a permutation layer to recover SO(3) features from spherical features to preserve the capacity to distinguish rotations. Experiments show that our method achieves comparable or superior performance in various tasks, including object classification, pose estimation, and keypoint-matching, while consuming much less memory and running faster than existing work. The proposed method can foster the development of equivariant models for real-world applications based on point clouds.

We propose a novel approach for monocular 3D object detection by leveraging local perspective effects of each object. While the global perspective effect shown as size and position variations has been exploited for monocular 3D detection extensively, the local perspectives has long been overlooked. We design a local perspective module to regress a newly defined variable named keyedge-ratios as the parameterization of the local shape distortion to account for the local perspective, and derive the object depth and yaw angle from it. Theoretically, this module does not rely on the pixel-wise size or position in the image of the objects, therefore independent of the camera intrinsic parameters. By plugging this module in existing monocular 3D object detection frameworks, we incorporate the local perspective distortion with global perspective effect for monocular 3D reasoning, and we demonstrate the effectiveness and superior performance over strong baseline methods in multiple datasets.

Ride-sharing has important implications for improving the efficiency of mobility-on-demand systems. However, it remains a challenge due to the complex dynamics between vehicles and requests. This paper presents a decentralized ride-sharing algorithm suitable for shared autonomous vehicles (SAVs) deployment. The ride-sharing problem is formulated as a multi-agent reinforcement learning problem. We explore state representation with the request-vehicle graph to encode shareability and potential coordination information. We use a graph attention network to build a hierarchical structure that unifies ride-sharing assignments with rebalancing and handles real-world scenarios where hundreds of user requests can be associated with vehicles. We show results in both generic grid-world and SUMO simulation with real-world data from the Manhattan area. We empirically demonstrate that our proposed approach can achieve similar performance compared with a state-of-the-art centralized optimization method and higher computation efficiency.

Meta Reinforcement Learning (Meta-RL) has seen substantial advancements recently. In particular, off-policy methods were developed to improve the data efficiency of Meta-RL techniques. Probabilistic embeddings for actor-critic$\boldsymbol{RL}$(PEARL) is a leading approach for multi-MDP adaptation problems. A major drawback of many existing Meta-RL methods, including PEARL, is that they do not explicitly consider the safety of the prior policy when it is exposed to a new task for the first time. Safety is essential for many real world applications, including field robots and Autonomous Vehicles (AVs), In this paper, we develop the PEARL PLUS (PEARL+) algorithm, which optimizes the policy for both prior (pre-adaptation) safety and posterior (after-adaptation) performance. Building on top of PEARL, our proposed PEARL+algorithm introduces a prior regularization term in the reward function and a new Q-network for recovering the state-action value under prior context assumptions, to improve the robustness to task distribution shift and safety of the trained network exposed to a new task for the first time. The performance of PEARL+is validated by solving three safety-critical problems related to robots and AVs, including two MuJoCo benchmark problems. From the simulation experiments, we show that safety of the prior policy is significantly improved and more robust to task distribution shift compared to PEARL.

Reinforcement learning (RL) can be used to design smart driving policies in complex situations where traditional methods cannot. However, they are frequently black-box in nature, and the resulting policy may perform poorly, including in scenarios where few training cases are available. In this paper, we propose a method to use RL under two conditions: (i) RL works together with a baseline rule-based driving policy; and (ii) the RL intervenes only when the rule-based method seems to have difficulty handling and when the confidence of the RL policy is high. Our motivation is to use a not-well trained RL policy to reliably improve AV performance. The confidence of the policy is evaluated by Lindeberg-Levy Theorem using the recorded data distribution in the training process. The overall framework is named “confidence-aware reinforcement learning” (CARL). The condition to switch between the RL policy and the baseline policy is analyzed and presented. Driving in a two-lane roundabout scenario is used as the application case study. Simulation results show the proposed method outperforms the pure RL policy and the baseline rule-based policy.

We study the problem of eco-routing for Plug-In Hybrid Electric Vehicles (PHEVs) to minimize the overall energy consumption cost. We propose an algorithm which can simultaneously calculate an energy-optimal route (eco-route) for a PHEV and an optimal power-train control strategy over this route. In order to show the effectiveness of our method in practice, we use a HERE Maps API to apply our algorithms based on traffic data in the city of Boston with more than 110,000 links. Moreover, we validate the performance of our eco-routing algorithm using speed profiles collected from a traffic simulator (SUMO) as input to a high-fidelity energy model to calculate energy consumption costs. Our results show significant energy savings (around 12%) for PHEVs with a near real-time execution time for the algorithm.

Shared Mobility-on-Demand using automated vehicles can reduce energy consumption and cost for future mobility. However, its full potential in energy saving has not been fully explored. An algorithm to minimize fleet fuel consumption while satisfying customers’ travel time constraints is developed in this article. Numerical simulations with realistic travel demand and route choice are performed, showing that if fuel consumption is not considered, the Mobility-on-demand (MOD) service can increase fleet fuel consumption due to increased empty vehicle mileage. With fuel consumption as part of the cost function, we can reduce total fuel consumption by 7% while maintaining a high level of mobility service.

We present Vehicle Energy Dataset (VED), a large-scale dataset of fuel and energy data collected from 383 personal cars in Ann Arbor, Michigan, USA. This open dataset captures GPS trajectories of vehicles along with their time-series data of fuel, energy, speed, and auxiliary power usage. A diverse fleet consisting of 264 gasoline vehicles, 92 HEVs, and 27 PHEV/EVs drove in real-world from Nov, 2017 to Nov, 2018, where the data were collected through onboard OBD-II loggers. Driving scenarios range from highways to traffic-dense downtown area in various driving conditions and seasons. In total, VED accumulates approximately 374,000 miles. We discuss participant privacy protection and develop a method to de-identify personally identifiable information while preserving the quality of the data. We present a number of case studies with the dataset to demonstrate how VED can be utilized for vehicle energy and behavior studies. The case studies investigate the impacts of factors known to affect fuel economy and identify energy-saving opportunities that hybrid-electric vehicles and eco-driving techniques can provide. Potential research opportunities include data-driven vehicle energy consumption modeling, driver behavior modeling, calibration of traffic simulators, optimal route choice modeling, prediction of human driver behaviors, and decision making of self-driving cars. We believe that VED can be an instrumental asset to the development of future automotive technologies. The dataset can be accessed athttps://github.com/gsoh/VED.

A highly automated vehicle (HAV) is a safety-critical system. Therefore, a verification and validation (V&V) process that rigorously evaluates the safety of HAVs is necessary before their release to the market. In this paper, we propose an interaction-aware safety evaluation framework for the HAV and apply it to the roundabout entering scenario. Instead of assuming that the primary other vehicles (POVs) take predetermined maneuvers, we model the POVs as game-theoretic agents. To capture a wide variety of interactions between the POVs and the vehicle under test (VUT), we use level-$k$game theory and social value orientation (SVO) to characterize the interactive behaviors and train a diverse library of POVs using reinforcement learning. The game-theoretic library, together with initial conditions, form a rich testing space for the two-POV roundabout scenario. On the other hand, we propose an adaptive test case generation scheme based on adaptive sampling, stochastic optimization and upper confidence bound (UCB) algorithm to efficiently generate customized challenging cases for the VUT from the testing space. In simulations, the proposed testing space design captured a wide range of interactive patterns at the roundabout scenario. The proposed test case generation scheme was found to cover the failure modes of the VUT more effectively compared to other test case generation approaches.

This article presents a model-based motion planning and control system for autonomous vehicles and its experimental validation. The system consists of four modules: 1) global routing; 2) behavior planner; 3) local trajectory generation; and 4) trajectory tracking. The algorithm and software of each module are detailed, including a behavior planner with unified models to handle typical scenarios in both highway and urban driving, a deterministic sampling algorithm for robust responsive trajectory generation, and a dynamics-and-delay-aware preview algorithm to achieve accurate trajectory tracking. The developed system is implemented and tested at the Mcity test facility with a full-size automated car and a dozen of challenging traffic scenarios.

This paper proposes a method to extract the position and pose of vehicles in the 3D world from a single traffic camera. Most previous monocular 3D vehicle detection algorithms focused on cameras on vehicles from the perspective of a driver, and assumed known intrinsic and extrinsic calibration. On the contrary, this paper focuses on the same task using uncalibrated monocular traffic cameras. We observe that the homography between the road plane and the image plane is essential to 3D vehicle detection and the data synthesis for this task, and the homography can be estimated without the camera intrinsics and extrinsics. We conduct 3D vehicle detection by estimating the rotated bounding boxes (r-boxes) in the bird’s eye view (BEV) images generated from inverse perspective mapping. We propose a new regression target called tailed r-box and a dual-view network architecture which boosts the detection accuracy on warped BEV images. Experiments show that the proposed method can generalize to new camera and environment setups despite not seeing imaged from them during training.

Lane detection on road segments with complex topologies such as lane merge/split and highway ramps is not yet a solved problem. This paper presents a novel graph-embedded solution. It consists of two key parts, a learning-based low-level lane feature extraction algorithm, and a graph-embedded lane inference algorithm. The former reduces the over-reliance on customized annotated/labeled lane data. We leveraged several open-source semantic segmentation datasets (e.g., Cityscape, Vistas, and Apollo) and designed a dedicated network that can be trained across these heterogeneous datasets to extract lane attributes. The latter algorithm constructs a graph to represent the lane geometry and topology. It does not rely on strong geometric assumptions such as lane lines are a set of parallel polynomials. Instead, it constructs a graph based on detected lane nodes. The lane parameters in the world coordinate are inferred by efficient graph-based searching and calculation. The performance of the proposed method is verified on both open source and our own collected data. On-vehicle experiments were also conducted and the comparison with Mobileye EyeQ2 shows favorable results.

Exiting from highways in crowded dynamic traffic is an important path planning task for autonomous vehicles (AVs). This task can be challenging because of the uncertain motion of surrounding vehicles and limited sensing/observing window. Conventional path planning methods usually compute a mandatory lane change (MLC) command, but the lane change behavior (e.g., vehicle speed and gap acceptance) should also adapt to traffic conditions and the urgency for exiting. In this paper, we propose a reinforcement learning-enhanced highway-exit planner. The learning-based strategy learns from past failures and adjusts the vehicle motion when the AV fails to exit. The reinforcement learning is based on the Monte Carlo tree search (MCTS) approach. The proposed learning-enhanced highway-exit planner is tested 6000 times in stochastic simulations. The results indicate that the proposed planner achieves a higher probability of successful highway exiting than a benchmark MLC planner.

Delay and lag deteriorate path tracking accuracy and system stability. If not properly compensated, they can cause instability or limit the driving speed of autonomous vehicles. This paper presents a preview steering control design considering both communication delay and steering lag to achieve accurate, smooth, and computationally efficient path tracking for highly automated vehicles. Two strategies are adopted for the delay: forward state predictor and delay augmentation. The steering lag is approximated by a first-order lag system. The path tracking problem with delay and lag is solved by the preview control theory. The resulted controller is in an analytical form and is computationally efficient for online implementation. We also analyze the system stability and closed-loop responses in both the time and frequency domain. The control is implemented on an automated vehicle platform and tested inside Mcity and on open roads. Experimental results showed lower tracking errors and significantly improved stability margin compared to the controls ignoring delay and lag.

This paper reports a new continuous 3D loss function for learning depth from monocular images. The dense depth prediction from a monocular image is supervised using sparse LIDAR points, which enables us to leverage available open source datasets with camera-LIDAR sensor suites during training. Currently, accurate and affordable range sensor is not readily available. Stereo cameras and LIDARs measure depth either inaccurately or sparsely/costly. In contrast to the current point-to-point loss evaluation approach, the proposed 3D loss treats point clouds as continuous objects; therefore, it compensates for the lack of dense ground truth depth due to LIDAR's sparsity measurements. We applied the proposed loss in three state-of-the-art monocular depth prediction approaches DORN, BTS, and Monodepth2. Experimental evaluation shows that the proposed loss improves the depth prediction accuracy and produces point-clouds with more consistent 3D geometric structures compared with all tested baselines, implying the benefit of the proposed loss on general depth prediction networks. A video demo of this work is available at https://youtu.be/5HL8BjSAY4Y.

It is necessary to evaluate the safety of highly automated vehicles (HAVs) rigorously before their deployment on public roads. This paper describes a procedure to conduct behavioral competence tests for HAVs using the unprotected left-turn as the illustrating scenario. We first describe a model-based method for test case generation. Subsequently, we propose two methods for synchronizing the motions of the primary other vehicle (POV) and the vehicle under test (VUT), one using fixed speed profile, the other using model predictive control (MPC). Finally, we implement the POV algorithm for the left-turn scenario on an experimental vehicle, and conduct field tests using both virtual and real VUT in the Mcity test facility.

Autonomous driving (AV) has been intensively researched over the last decade. In this paper, we introduce an open autonomous driving software stack to enable faster design, development, and testing of algorithms on simulated or experimental vehicles, which we hope will become a useful tool for AV researchers.

Connected and automated vehicles (CAVs) show great potential to improve both traffic efficiency and safety by sharing information. This paper addresses the problem of coordinating two strings of vehicles at highway on-ramps efficiently and safely in the longitudinal direction. A rule-based adjusting algorithm is proposed to achieve a near-optimal merging sequence for vehicles coming from the mainline and entering through the ramp. Optimality analysis indicates that the proposed method performs very well compared with the global optimal solutions. Furthermore, to investigate the effectiveness and robustness of the proposed method, simulation-based case studies are carried out under both balanced and unbalanced scenarios. The results are compared with two other control strategies (i.e., rule-based methods and optimization-based methods) in terms of throughput, delay, computational cost, and fuel consumption.

Automated vehicles can change the society by improved safety, mobility, and fuel efficiency. However, due to the higher cost and change in business model, over the coming decades, the highly automated vehicles likely will continue to interact with many human-driven vehicles. In the past, the control/design of the highly automated (robotic) vehicles mainly considers safety and efficiency but failed to address the “driving culture” of surrounding human-driven vehicles. Thus, the robotic vehicles may demonstrate behaviors very different from other vehicles. We study this “driving etiquette” problem in this paper. As the first step, we report the key behavior parameters of human driven vehicles derived from a large naturalistic driving database. The results can be used to guide future algorithm design of highly automated vehicles or to develop realistic human-driven vehicle behavior model in simulations.

This paper presents a preview steering control algorithm and its closed-loop system analysis and experimental validation for accurate, smooth, and computationally inexpensive path tracking of automated vehicles. The path tracking issue is formulated as an optimal control problem with dynamic disturbance, i.e., the future road curvature. A discrete-time preview controller is then designed on the top of a linear augmented error system, in which the disturbances within a finite preview window are augmented as part of the state vector. The obtained optimal steering control law is in an analytic form and consists of two parts: 1) a feedback control responding to tracking errors and 2) a feedforward control dealing with the future road curvatures. The designed control's nature, capacity, computation load, and underlying mechanism are revealed by the analysis of system responses in the time domain and the frequency domain, theoretical steady-state error, and comparison with the model predictive control (MPC). The algorithm was implemented on an automated vehicle platform, a hybrid Lincoln MKZ. The experimental and simulation results are then presented to demonstrate the improved performance in tracking accuracy, steering smoothness, and computational efficiency compared to the MPC and the full-state feedback control.

Deep reinforcement learning (DRL) techniques have been used to solve a discretionary lane change decision-making problem and are showing promising results. However, since the input information for the discretionary lane change problem is continuous and can be in high dimension, it is an open challenge for DRL to optimize the exploration-exploitation trade-off. Conventional model-less exploration methods lack a systematic way to incorporate additional engineering or model-based knowledge of our application into consideration and as a result, the training can be inefficient and may dwell on a policy, e.g. lane change strategy that is impractical. In previous related work, many used the rule-based safety check policy to guide the exploration and collect input information data. However, it is not guaranteed to get the optimal policy and the performance is dependent on the safety check policy selected. In this paper, we developed an explicit statistical aggregated environment model using a conditional variational auto-encoder and a model-based exploration strategy leveraging it. The agent is guided to explore with surprise-based intrinsic reward derived from the environment model. The result is compared with annealing epsilon-greedy exploration and with rule-based safety check exploration. We demonstrate that the performance of the developed model-based exploration method is comparable with the best rule-based safety check exploration and much better than the epsilon-greedy exploration.

A crucial function for automated vehicle technologies is accurate localization. Lane-level accuracy is not readily available from low-cost global navigation satellite system (GNSS) receivers because of factors such as multipath error and atmospheric bias. Approaches such as differential GNSS can improve localization accuracy, but usually require investment in expensive base stations. Connected vehicle technologies provide an alternative approach in improving the localization accuracy. It will be shown in this paper that localization accuracy can be enhanced using crude GNSS measurements from a group of connected vehicles, by matching their locations to a digital map. A Rao-Blackwellized particle filter is used to jointly estimate the common biases of the pseudo-ranges and the vehicle positions. Multipath biases, which introduce receiver-specific (non-common) error, are mitigated by a multi-hypothesis detection-rejection approach. The temporal correlation of the estimations is exploited through the prediction-update process. The proposed approach is compared with existing methods using both simulations and experimental results. It was found that the proposed algorithm can eliminate the common biases and reduce the localization error to below 1 m under open sky conditions.

Testing and evaluation are critical steps in the development of connected and automated vehicle (CAV) technology. One limitation of closed CAV testing facilities is that they merely provide empty roadways, in which testing CAVs can only interact with a limited number of other CAVs and infrastructure. This paper presents an augmented reality environment for CAV testing and evaluation. A real-world testing facility and a simulation platform are combined together. Movements of testing CAVs in the real world are synchronized with simulation and information of background traffic is fed back to testing CAVs. Testing CAVs can interact with virtual background traffic as if in a realistic traffic environment. The proposed system mainly consists of three components: a simulation platform, testing CAVs, and a communication network. Testing scenarios that have safety concerns and/or require interactions with other vehicles can be performed. Two exemplary test scenarios are designed and implemented to demonstrate the capabilities of the system.

This paper presents a preview servo-loop speed control algorithm to achieve smooth, accurate, and computationally inexpensive speed tracking for connected automated vehicles (CAVs). Differing from methods neglecting the future road slope and target speed information, the proposed controller focuses on taking advantages of this accessible future information to achieve better speed tracking performance. It integrates the future slope and target speed into an augmented optimal control problem, by solving which we obtain the optimal control law in an analytical form. The brake/throttle control laws consist of five parts,i.e., three feedback controls of system states and two feedforward items-preview of road slope and preview of target speed. This controller and its degenerate form,i.e., a classic PID, are implemented and applied to our automated vehicle platform, a Hybrid Lincoln MKZ. Experimental results show three major benefits of the proposed control-lower speed tracking errors, more gentle operations, and smoother brake/throttle behaviors.

The safety of automated vehicles (AVs) must be assured before their release and deployment. The current approach to evaluation relies primarily on 1) testing AVs on public roads or 2) track testing with scenarios defined in a test matrix. These two methods have completely opposing drawbacks: the former, while offering realistic scenarios, takes too much time to execute and the latter, though it can be completed in a short amount of time, has no clear correlation to safety benefits in the real world. To avoid the aforementioned problems, we propose accelerated evaluation, focusing on the car-following scenario. The stochastic human-controlled vehicle (HV) motions are modeled based on 1.3 million miles of naturalistic driving data collected by the University of Michigan Safety Pilot Model Deployment Program. The statistics of the HV behaviors are then modified to generate more intense interactions between HVs and AVs to accelerate the evaluation procedure. The importance sampling theory was used to ensure that the safety benefits of AVs are accurately assessed under accelerated tests. Crash, injury and conflict rates for a simulated AV are simulated to demonstrate the proposed approach. Results show that test duration is reduced by a factor of 300 to 100 000 compared with the non-accelerated (naturalistic) evaluation. In other words, the proposed techniques have great potential for accelerating the AV evaluation process.

Evaluation and testing are critical for the development of Automated Vehicles (AVs). Currently, companies test AVs on public roads, which is very time-consuming and inefficient. We proposed the Accelerated Evaluation concept which uses a modified statistics of the surrounding vehicles and the Importance Sampling theory to reduce the evaluation time by several orders of magnitude, while ensuring the final evaluation results are accurate. In this paper, we further extend this idea by using Piecewise Mixture Distribution models instead of Single Distribution models. We demonstrate this idea to evaluate vehicle safety in lane change scenarios. The behavior of the cut-in vehicles was modeled based on more than 400,000 naturalistic driving lane changes collected by the University of Michigan Safety Pilot Model Deployment Program. Simulation results confirm that the accuracy and efficiency of the Piecewise Mixture Distribution method are better than the single distribution.

Interactions between vehicles and pedestrians have always been a major problem in traffic safety. Experienced human drivers are able to analyze the environment and choose driving strategies that will help them avoid crashes. What is not yet clear, however, is how automated vehicles will interact with pedestrians. This paper proposes a new method for evaluating the safety and feasibility of the driving strategy of automated vehicles when encountering unsignalized crossings. MobilEye® sensors installed on buses in Ann Arbor, Michigan, collected data on 2,973 valid crossing events. A stochastic interaction model was then created using a multivariate Gaussian mixture model. This model allowed us to simulate the movements of pedestrians reacting to an oncoming vehicle when approaching unsignalized crossings, and to evaluate the passing strategies of automated vehicles. A simulation was then conducted to demonstrate the evaluation procedure.

Analyzing and reconstructing driving scenarios is crucial for testing and evaluating highly automated vehicles (HAVs). This research analyzed left-turn / straight-driving conflicts at unprotected intersections by extracting actual vehicle motion data from a naturalistic driving database collected by the University of Michigan. Nearly 7,000 left turn across path - opposite direction (LTAP/OD) events involving heavy trucks and light vehicles were extracted and used to build a stochastic model of such LTAP/OD scenario, which is among the top priority light-vehicle pre-crash scenarios identified by National Highway Traffic Safety Administration (NHTSA). Statistical analysis showed that vehicle type is a significant factor, whereas the change of season seems to have limited influence on the statistical nature of the conflict. The results can be used to build testing environments for HAVs to simulate the LTAP/OD crash cases in a stochastic manner.

Dedicated short range communication (DSRC) was designed to provide reliable wireless communication for intelligent transportation system applications. Sharing information among cars and between cars and the infrastructure, pedestrians, or “the cloud” has great potential to improve safety, mobility, and fuel economy. DSRC is being considered by the U.S. Department of Transportation to be required for ground vehicles. In the past, their performance has been assessed thoroughly in the laboratories and limited field testing, but not on a large fleet. In this paper, we present the analysis of DSRC performance using data from the world's largest connected vehicle test program-Safety Pilot Model Deployment lead by the University of Michigan. We first investigate their maximum and effective range, and then study the effect of environmental factors, such as trees/foliage, weather, buildings, vehicle travel direction, and road elevation. The results can be used to guide future DSRC equipment placement and installation, and can be used to develop DSRC communication models for numerical simulations.

Automated vehicles (AVs) must be thoroughly evaluated before their release and deployment. A widely used evaluation approach is the Naturalistic-Field Operational Test (N-FOT), which tests prototype vehicles directly on the public roads. Due to the low exposure to safety-critical scenarios, N-FOTs are time consuming and expensive to conduct. In this paper, we propose an accelerated evaluation approach for AVs. The results can be used to generate motions of the other primary vehicles to accelerate the verification of AVs in simulations and controlled experiments. Frontal collision due to unsafe cut-ins is the target crash type of this paper. Human-controlled vehicles making unsafe lane changes are modeled as the primary disturbance to AVs based on data collected by the University of Michigan Safety Pilot Model Deployment Program. The cut-in scenarios are generated based on skewed statistics of collected human driver behaviors, which generate risky testing scenarios while preserving the statistical information so that the safety benefits of AVs in nonaccelerated cases can be accurately estimated. The cross-entropy method is used to recursively search for the optimal skewing parameters. The frequencies of the occurrences of conflicts, crashes, and injuries are estimated for a modeled AV, and the achieved accelerated rate is around 2000 to 20 000. In other words, in the accelerated simulations, driving for 1000 miles will expose the AV with challenging scenarios that will take about 2 to 20 million miles of real-world driving to encounter. This technique thus has the potential to greatly reduce the development and validation time for AVs.

This paper presents an analysis of rearward gap acceptance characteristics of drivers of large trucks in highway lane change scenarios. The range between the vehicles was inferred from camera images using the estimated lane width obtained from the lane tracking camera as the reference. Six-hundred lane change events were acquired from a large-scale naturalistic driving data set. The kinematic variables from the image-based gap analysis were filtered by the weighted linear least squares in order to extrapolate them at the lane change time. In addition, the time-to-collision and required deceleration were computed, and potential safety threshold values are provided. The resulting range and range rate distributions showed directional discrepancies, i.e., in left lane changes, large trucks are often slower than other vehicles in the target lane, whereas they are usually faster in right lane changes. Video observations have confirmed that major motivations for changing lanes are different depending on the direction of move, i.e., moving to the left (faster) lane occurs due to a slower vehicle ahead or a merging vehicle on the right-hand side, whereas right lane changes are frequently made to return to the original lane after passing.

This paper studies the principles and mechanism of a fuel-optimal strategy in cruising scenarios, i.e., the pulse and glide (PnG) operation, for road vehicles equipped with a step-gear transmission. In the PnG strategy, the control of the engine and the transmission determines the fuel-saving performance, and it is obtained by solving an optimal control problem (OCP). Due to a discrete gear ratio, strong nonlinear engine fuel characteristics, and different dynamics in the pulse/glide mode, the OCP is a switching nonlinear mixed-integer problem. This challenging problem is converted by a knotting technique and the Legendre pseudospectral method to a nonlinear programming problem, which then solves the optimal engine torque and transmission gear position. The optimization results show the significant fuel saving of the PnG operation as compared with the constant-speed cruising strategy. The underlying fuel-saving mechanism of the PnG strategy is explained graphically. For a real-time implementation, a near-optimal practical rule that enables a driver and/or an automatic control system to fast select gear positions and engine torque profile is proposed with only slightly deteriorated fuel saving.

This paper presents a novel method that estimates the vehicle sideslip angle for a wide range of surface frictions and road bank angles by combining measurements of a magnetometer, Global Positioning System (GPS), and inertial measurement unit (IMU). To reject disturbances in the magnetometer, a new stochastic filter is designed and integrated on the Kalman filter framework. The significant latency in a low-cost GPS velocity measurement is addressed by “measurement shifting,” and biases in the IMU measurements are estimated through state augmentation. Dual Kalman filters are employed in the sensor fusing framework. A comprehensive simulation study was conducted to prove the feasibility of the method. Finally, the performance and accuracy are verified through extensive experiments.

Hazardous terrains pose a crucial challenge to the operation of mobile robots, especially for military applications such as surveillance, casualty extraction, etc. To enable their safe and efficient operations, it is necessary to detect the terrain type and to modify operation and control strategies in real-time. Fast wheel-terrain interaction models suitable for real-time applications are thus important. In this paper, closed-form analytical expressions of the integrated stress equations were derived by quadratic approximation of the stresses along the wheel-soil interface. Meanwhile, the bulldozing resistance and the influence of grousers are also modeled for more accurate prediction of the vehicle motion. A non-iterative method was proposed to estimate the wheel-soil contact geometry, i.e., the entry angle, according to the wheel load, by approximating the vertical pressure distribution with a sinusoidal function or linear function depending on the sinkage exponent of the soil. Computation efficiency is improved by avoiding traditional recursive solution of the model under binary search. Online prediction and real-time control could be possible by using the developed closed-from wheel-soil interaction model and the entry angle estimator.

A methodology to design the range policy of adaptive cruise control vehicles and its companion servoloop control algorithm is presented in this paper. A nonlinear range policy for improved traffic flow stability and string stability is proposed and its performance is compared against the constant time headway policy, the range policy employed by human drivers, and the Greenshields policy. The proposed range policy is obtained through an optimization procedure with traffic flow and stability constraints. A complementary controller is then designed based on the sliding mode technique. Microscopic simulation results show that stable traffic flow is achieved by the proposed method up to a significantly higher traffic density.

This paper reports on nonintrusive methods for characterizing the longitudinal performance of vehicles equipped with adaptive cruise control (ACC) systems. It reports the experimental set-up and procedures for measuring ACC system performance, followed by the modeling and simulation of the measured ACC performance. To further assess the interaction of ACC vehicles with human-controlled traffic, microscopic simulation involving both a human-driver model and an ACC model is discussed.