Apollo: Adaptive Polar Lattice-Based Local Obstacle Avoidance and Motion Planning for Automated Vehicles

The motion planning module is the core module of the automated vehicle software system, which plays a key role in connecting its preceding element, i.e., the sensing module, and its following element, i.e., the control module. The design of an adaptive polar lattice-based local obstacle avoidance (APOLLO) algorithm proposed in this paper takes full account of the characteristics of the vehicle's sensing and control systems. The core of our approach mainly consists of three phases, i.e., the adaptive polar lattice-based local search space design, the collision-free path generation and the path smoothing. By adjusting a few parameters, the algorithm can be adapted to different driving environments and different kinds of vehicle chassis. Simulations show that the proposed method owns strong environmental adaptability and low computation complexity.

Simulation-Based Testing of Subsystems for Autonomous Vehicles at the Example of an Active Suspension Control System

Automated driving functions are expected to increase both the safety and ride comfort of future vehicles. Ensuring their functional safety and optimizing their performance requires thorough testing. Costs and duration of tests can be reduced if more tests can be performed numerically in a feasible simulation framework. This simulation setup must include all subsystems of the autonomous vehicle, which significantly interact with the system under test. In this paper, a modular model chain is presented, which is developed for testing systems with an impact on vehicle motion. It includes trajectory planning, motion control, and a model of the vehicle dynamics in a closed loop. Each subsystem can easily be exchanged to adapt the model chain with respect to the simulation objectives. As a use case, the testing of an active suspension control system is discussed. It is designed directly for use in autonomous cars and uses inputs from the vehicle motion planning subsystem for planning the suspension actuator motion. Using the presented closed-loop model chain, the effect of different actuator control strategies on ride comfort is compared, such as curve tilting. Furthermore, the impact of the active suspension system on lateral vehicle motion is shown.

Online on-Road Motion Planning Based on Hybrid Potential Field Model for Car-Like Robot

The application of Middle-sized Car-like Robots (MCRs) in indoor and outdoor road scenarios is becoming broader and broader. To achieve the goal of stable and efficient movement of the MCRs on the road, a motion planning algorithm based on the Hybrid Potential Field Model (HPFM) is proposed in this paper. Firstly, the artificial potential field model improved with the eye model is used to generate a safe and smooth initial path that meets the road constraints. Then, the path constraints such as curvatures and obstacle avoidance are converted into an unconstrained weighted objective function. The efficient least-squares & quasi-Newton fusion algorithm is used to optimize the initial path to obtain a smooth path curve suitable for the MCR. Finally, the speed constraints are converted into a weighted objective function based on the path curve to get the best speed profile. Numerical simulation and practical prototype experiments are carried out on different road scenes to verify the performance of the proposed algorithm. The results show that re-planned trajectories can satisfy the path constraints and speed constraints. The real-time re-planning period is 184 ms, which demonstrates the proposed approach’s effectiveness and feasibility.

A Motion Planning Method for Automated Vehicles in Dynamic Traffic Scenarios

We propose a motion planning method for automated vehicles (AVs) to complete driving tasks in dynamic traffic scenes. The proposed method aims to generate motion trajectories for an AV after obtaining the surrounding dynamic information and making a preliminary driving decision. The method generates a reference line by interpolating the original waypoints and generates optional trajectories with costs in a prediction interval containing three dimensions (lateral distance, time, and velocity) in the Frenet frame, and filters the optimal trajectory by a series of threshold checks. When calculating the feasibility of optional trajectories, the cost of all optional trajectories after removing obstacle interference shows obvious axisymmetric regularity concerning the reference line. Based on this regularity, we apply the constrained Simulated Annealing Algorithm (SAA) to improve the process of searching for the optimal trajectories. Experiments in three different simulated driving scenarios (speed maintaining, lane changing, and car following) show that the proposed method can efficiently generate safe and comfortable motion trajectories for AVs in dynamic environments. Compared with the method of traversing sampling points in discrete space, the improved motion planning method saves 70.23% of the computation time, and overcomes the limitation of the spatial sampling interval.

Optimal Trajectory Generation for Intelligent Vehicles in Complex Traffic Based on Iteration Convex Optimization

Intelligent vehicles face considerable challenges in the complex traffic environment since they need to deal with various constraints and elements. This dissertation puts forward a novel trajectory planning framework for intelligent vehicles to generate safe and optimal driving trajectories. First, we design a spatiotemporal occupancy framework to deal with all kinds of elements in the complex driving environment based on the Frenét frame. This framework unifies various constraints on the road in the three-dimensional spatiotemporal representation and clearly describes the collision-free configuration space. Then we use the convex approximation method to construct a time-varying convex feasible region based on the above accurate temporal and spatial description. We formulate the trajectory planning problem as a standard quadratic programming formulation with collision-free and dynamics constraints. Finally, we apply the iterative convex optimization algorithm to solve the quadratic programming problem in the time-varying convex feasible region. Moreover, we design several typical experimental scenarios and have verified that the proposed method has good effectiveness and real-time.

An Optimized Trajectory Planner and Motion Controller Framework for Autonomous Driving in Unstructured Environments

This paper proposes an optimized trajectory planner and motion planner framework, which aim to deal with obstacle avoidance along a reference road for autonomous driving in unstructured environments. The trajectory planning problem is decomposed into lateral and longitudinal planning sub-tasks along the reference road. First, a vehicle kinematic model with road coordinates is established to describe the lateral movement of the vehicle. Then, nonlinear optimization based on a vehicle kinematic model in the space domain is employed to smooth the reference road. Second, a multilayered search algorithm is applied in the lateral-space domain to deal with obstacles and find a suitable path boundary. Then, the optimized path planner calculates the optimal path by considering the distance to the reference road and the curvature constraints. Furthermore, the optimized speed planner takes into account the speed boundary in the space domain and the constraints on vehicle acceleration. The optimal speed profile is obtained by using a numerical optimization method. Furthermore, a motion controller based on a kinematic error model is proposed to follow the desired trajectory. Finally, the experimental results show the effectiveness of the proposed trajectory planner and motion controller framework in handling typical scenarios and avoiding obstacles safely and smoothly on the reference road and in unstructured environments.

Merit-Based Motion Planning for Autonomous Vehicles in Urban Scenarios

Safe and adaptable motion planning for autonomous vehicles remains an open problem in urban environments, where the variability of situations and behaviors may become intractable using rule-based approaches. This work proposes a use-case-independent motion planning algorithm that generates a set of possible trajectories and selects the best of them according to a merit function that combines longitudinal comfort, lateral comfort, safety and utility criteria. The system was tested in urban scenarios on simulated and real environments, and the results show that different driving styles can be achieved according to the priorities set in the merit function, always meeting safety and comfort parameters imposed by design.

Human-Machine Cooperative Trajectory Planning for Semi-Autonomous Driving Based on the Understanding of Behavioral Semantics

This paper presents a novel cooperative trajectory planning approach for semi-autonomous driving. The machine interacts with the driver at the decision level and the trajectory generation level. To minimize conflicts between the machine and the human, the trajectory planning problem is decomposed into a high-level behavior decision-making problem and a low-level trajectory planning problem. The approach infers the driver’s behavioral semantics according to the driving context and the driver’s input. The trajectories are generated based on the behavioral semantics and driver’s input. The feasibility of the proposed approach is validated by real vehicle experiments. The results prove that the proposed human–machine cooperative trajectory planning approach can successfully help the driver to avoid collisions while respecting the driver’s behavior.

Modules and Techniques for Motion Planning: An Industrial Perspective

Research on autonomous cars has become one of the main research paths in the automotive industry, with many critical issues that remain to be explored while considering the overall methodology and its practical applicability. In this paper, we present an industrial experience in which we build a complete autonomous driving system, from the sensor units to the car control equipment, and we describe its adoption and testing phase on the field. We report how we organize data fusion and map manipulation to represent the required reality. We focus on the communication and synchronization issues between the data-fusion device and the path-planner, between the CPU and the GPU units, and among different CUDA kernels implementing the core local planner module. In these frameworks, we propose simple representation strategies and approximation techniques which guarantee almost no penalty in terms of accuracy and large savings in terms of memory occupation and memory transfer times. We show how we adopt a recent implementation on parallel many-core devices, such as CUDA-based GPGPU, to reduce the computational burden of rapidly exploring random trees to explore the state space along with a given reference path. We report on our use of the controller and the vehicle simulator. We run experiments on several real scenarios, and we report the paths generated with the different settings, with their relative errors and computation times. We prove that our approach can generate reasonable paths on a multitude of standard maneuvers in real time.

Path Planning of Mobile Robot With Improved Ant Colony Algorithm and MDP to Produce Smooth Trajectory in Grid-Based Environment

This approach has been derived mainly to improve quality and efficiency of global path planning for a mobile robot with unknown static obstacle avoidance features in grid-based environment. The quality of the global path in terms of smoothness, path consistency and safety can affect the autonomous behavior of a robot. In this paper, the efficiency of Ant Colony Optimization (ACO) algorithm has improved with additional assistance of A* Multi-Directional algorithm. In the first part, A* Multi-directional algorithm starts to search in map and stores the best nodes area between start and destination with optimal heuristic value and that area of nodes has been chosen for path search by ACO to avoid blind search at initial iterations. The path obtained in grid-based environment consist of points in Cartesian coordinates connected through line segments with sharp bends. Therefore, Markov Decision Process (MDP) trajectory evaluation model is introduced with a novel reward policy to filter and reduce the sharpness in global path generated in grid environment. With arc-length parameterization, a curvilinear smooth route has been generated among filtered waypoints and produces consistency and smoothness in the global path. To achieve a comfort drive and safety for robot, lateral and longitudinal control has been utilized to form a set of optimal trajectories along the reference route, as well as, minimizing total cost. The total cost includes curvature, lateral and longitudinal coordinates constraints. Additionally, for collision detection, at every step the set of optimal local trajectories have been checked for any unexpected obstacle. The results have been verified through simulations in MATLAB compared with previous global path planning algorithms to differentiate the efficiency and quality of derived approach in different constraint environments.

A Smart Many-Core Implementation of a Motion Planning Framework along a Reference Path for Autonomous Cars

Research on autonomous cars, early intensified in the 1990s, is becoming one of the main research paths in automotive industry. Recent works use Rapidly-exploring Random Trees to explore the state space along a given reference path, and to compute the minimum time collision-free path in real time. Those methods do not require good approximations of the reference path, they are able to cope with discontinuous routes, they are capable of navigating in realistic traffic scenarios, and they derive their power from an extensive computational effort directed to improve the quality of the trajectory from step to step. In this paper, we focus on re-engineering an existing state-of-the-art sequential algorithm to obtain a CUDA-based GPGPU (General Purpose Graphics Processing Units) implementation. To do that, we show how to partition the original algorithm among several working threads running on the GPU, how to propagate information among threads, and how to synchronize those threads. We also give detailed evidence on how to organize memory transfers between the CPU and the GPU (and among different CUDA kernels) such that planning times are optimized and the available memory is not exceeded while storing massive amounts of fuse data. To sum up, in our application the GPU is used for all main operations, the entire application is developed in the CUDA language, and specific attention is paid to concurrency, synchronization, and data communication. We run experiments on several real scenarios, comparing the GPU implementation with the CPU one in terms of the quality of the generated paths and in terms of computation (wall-clock) times. The results of our experiments show that embedded GPUs can be used as an enabler for real-time applications of computationally expensive planning approaches.

Robot trajectories comparison: a statistical approach

The task of planning a collision-free trajectory from a start to a goal position is fundamental for an autonomous mobile robot. Although path planning has been extensively investigated since the beginning of robotics, there is no agreement on how to measure the performance of a motion algorithm. This paper presents a new approach to perform robot trajectories comparison that could be applied to any kind of trajectories and in both simulated and real environments. Given an initial set of features, it automatically selects the most significant ones and performs a statistical comparison using them. Additionally, a graphical data visualization named polygraph which helps to better understand the obtained results is provided. The proposed method has been applied, as an example, to compare two different motion planners, FM² and WaveFront, using different environments, robots, and local planners.