65 research outputs found
Learning from Experience for Rapid Generation of Local Car Maneuvers
Being able to rapidly respond to the changing scenes and traffic situations
by generating feasible local paths is of pivotal importance for car autonomy.
We propose to train a deep neural network (DNN) to plan feasible and
nearly-optimal paths for kinematically constrained vehicles in small constant
time. Our DNN model is trained using a novel weakly supervised approach and a
gradient-based policy search. On real and simulated scenes and a large set of
local planning problems, we demonstrate that our approach outperforms the
existing planners with respect to the number of successfully completed tasks.
While the path generation time is about 40 ms, the generated paths are smooth
and comparable to those obtained from conventional path planners
Real-time motion planning methods for autonomous on-road driving: state-of-the-art and future research directions
Currently autonomous or self-driving vehicles are at the heart of academia and industry research because of its multi-faceted advantages that includes improved safety, reduced congestion, lower emissions and greater mobility. Software is the key driving factor underpinning autonomy within which planning algorithms that are responsible for mission-critical decision making hold a significant position. While transporting passengers or goods from a given origin to a given destination, motion planning methods incorporate searching for a path to follow, avoiding obstacles and generating the best trajectory that ensures safety, comfort and efficiency. A range of different planning approaches have been proposed in the literature. The purpose of this paper is to review existing approaches and then compare and contrast different methods employed for the motion planning of autonomous on-road driving that consists of (1) finding a path, (2) searching for the safest manoeuvre and (3) determining the most feasible trajectory. Methods developed by researchers in each of these three levels exhibit varying levels of complexity and performance accuracy. This paper presents a critical evaluation of each of these methods, in terms of their advantages/disadvantages, inherent limitations, feasibility, optimality, handling of obstacles and testing operational environments. Based on a critical review of existing methods, research challenges to address current limitations are identified and future research directions are suggested so as to enhance the performance of planning algorithms at all three levels. Some promising areas of future focus have been identified as the use of vehicular communications (V2V and V2I) and the incorporation of transport engineering aspects in order to improve the look-ahead horizon of current sensing technologies that are essential for planning with the aim of reducing the total cost of driverless vehicles. This critical review on planning techniques presented in this paper, along with the associated discussions on their constraints and limitations, seek to assist researchers in accelerating development in the emerging field of autonomous vehicle research
Real-time motion planning methods for autonomous on-road driving: State-of-the-art and future research directions
Open access articleCurrently autonomous or self-driving vehicles are at the heart of academia and industry
research because of its multi-faceted advantages that includes improved safety, reduced congestion,lower emissions and greater mobility. Software is the key driving factor underpinning autonomy within which planning algorithms that are responsible for mission-critical decision making hold a significant position. While transporting passengers or goods from a given origin to a given destination, motion planning methods incorporate searching for a path to follow, avoiding obstacles and generating the best trajectory that ensures safety, comfort and efficiency. A range of different planning approaches have been proposed in the literature.
The purpose of this paper is to review existing approaches and then compare and contrast different methods employed for the motion planning of autonomous on-road driving that consists of (1) finding a path, (2) searching for the safest manoeuvre and (3) determining the most feasible trajectory. Methods developed by researchers in each of these three levels exhibit varying levels of complexity and performance accuracy. This paper presents a critical evaluation of each of these methods, in terms of their advantages/disadvantages, inherent limitations, feasibility, optimality, handling of obstacles and testing operational environments. Based on a critical review of existing methods, research challenges to address current limitations are identified and future research directions are suggested so as to enhance the performance of planning algorithms at all three levels. Some promising areas of future focus have been identified as the use of vehicular communications (V2V and V2I) and the incorporation of transport engineering aspects in order to improve the look-ahead horizon of current sensing
technologies that are essential for planning with the aim of reducing the total cost of
driverless vehicles. This critical review on planning techniques presented in this paper, along with the associated discussions on their constraints and limitations, seek to assist researchers in accelerating development in the emerging field of autonomous vehicle research
Multi-layer approach to motion planning in obstacle rich environment
A widespread use of robotic technology in civilian and military applications has
generated a need for advanced motion planning algorithms that are real-time implementable.
These algorithms are required to navigate autonomous vehicles through
obstacle-rich environments. This research has led to the development of the multilayer
trajectory generation approach. It is built on the principle of separation of
concerns, which partitions a given problem into multiple independent layers, and addresses
complexity that is inherent at each level. We partition the motion planning
algorithm into a roadmap layer and an optimal control layer. At the roadmap layer,
elements of computational geometry are used to process the obstacle rich environment
and generate feasible sets. These are used by the optimal control layer to generate
trajectories while satisfying dynamics of the vehicle. The roadmap layer ignores the
dynamics of the system, and the optimal control layer ignores the complexity of the
environment, thus achieving a separation of concern. This decomposition enables
computationally tractable methods to be developed for addressing motion planning
in complex environments. The approach is applied in known and unknown environments.
The methodology developed in this thesis has been successfully applied to a 6
DOF planar robotic testbed. Simulation results suggest that the planner can generate
trajectories that navigate through obstacles while satisfying dynamical constraints
Kinodynamic motion planning for quadrotor-like aerial robots
Motion planning is the field of computer science that aims at developing algorithmic techniques allowing the automatic computation of trajecto- ries for a mechanical system. The nature of such a system vary according to the fields of application. In computer animation it could be a humanoid avatar. In molecular biology it could be a protein. The field of application of this work being aerial robotics, the system is here a four-rotor UAV (Unmanned Aerial Vehicle) called quadrotor. The motion planning problem consists in computing a series of motions that brings the system from a given initial configuration to a desired final configuration without generating collisions with its environment, most of the time known in advance. Usual methods explore the system’s configuration space regardless of its dynamics. By construction the thrust force that allows a quadrotor to fly is tangential to its attitude which implies that not every motion can be performed. Furthermore, the magnitude of this thrust force and hence the linear acceleration of the center of mass are limited by the physical capabilities of the robot. For all these reasons, not only position and orientation must be planned, higher derivatives must be planned also if the motion is to be executed. When this is the case we talk of kinodynamic motion planning. A distinction is made between the local planner and the global planner. The former is in charge of producing a valid trajectory between two states of the system without necessarily taking collisions into account. The later is the overall algorithmic process that is in charge of solving the motion planning problem by exploring the state space of the system. It relies on multiple calls to the local planner. We present a local planner that interpolates two states consisting of an arbitrary number of degrees of freedom (dof) and their first and second derivatives. Given a set of bounds on the dof derivatives up to the fourth order (snap), it quickly produces a near-optimal minimum time trajectory that respects those bounds. In most of modern global motion planning algorithms, the exploration is guided by a distance function (or metric). The best choice is the cost-to-go, i.e. the cost associated to the local method. In the context of kinodynamic motion planning, it is the duration of the minimal-time trajectory. The problem in this case is that computing the cost-to-go is as hard (and thus as costly) as computing the optimal trajectory itself. We present a metric that is a good approximation of the cost-to-go but which computation is far less time consuming. The dominant paradigm nowadays is sampling-based motion planning. This class of algorithms relies on random sampling of the state space in order to quickly explore it. A common strategy is uniform sampling. It however appears that, in our context, it is a rather poor choice. Indeed, a great majority of uniformly sampled states cannot be interpolated. We present an incremental sampling strategy that significantly decreases the probability of this happening
- …