A Two-Stage Real-Time Path Planning: Application to the Overtaking Manuever

This paper proposes a two-stage local path planning approach to deal with all kinds of scenarios (i.e. intersections, turns, roundabouts). The first stage carries out an off-line optimization, considering vehicle kinematics and road constraints. The second stage includes all dynamic obstacles in the scene, generating a continuous path in real-time. Human-like driving style is provided by evaluating the sharpness of the road bends and the available space among them, optimizing the drivable area. The proposed approach is validated on overtaking scenarios where real-time path planning generation plays a key role. Simulation and real results on an experimental automated platform provide encouraging results, generating real-time collision-free paths while maintaining the defined smoothness criteria.INRIA and VEDECOM Institutes under the Ph.D. Grant; 10.13039/501100011688-Electronic Components and Systems for European Leadership (ECSEL) Project AutoDriv

Smooth path planning with Pythagorean-hodoghraph spline curves geometric design and motion control

This thesis addresses two significative problems regarding autonomous systems, namely path and trajectory planning. Path planning deals with finding a suitable path from a start to a goal position by exploiting a given representation of the environment. Trajectory planning schemes govern the motion along the path by generating appropriate reference (path) points. We propose a two-step approach for the construction of planar smooth collision-free navigation paths. Obstacle avoidance techniques that rely on classical data structures are initially considered for the identification of piecewise linear paths that do not intersect with the obstacles of a given scenario. In the second step of the scheme we rely on spline interpolation algorithms with tension parameters to provide a smooth planar control strategy. In particular, we consider Pythagorean\u2013hodograph (PH) curves, since they provide an exact computation of fundamental geometric quantities. The vertices of the previously produced piecewise linear paths are interpolated by using a G1 or G2 interpolation scheme with tension based on PH splines. In both cases, a strategy based on the asymptotic analysis of the interpolation scheme is developed in order to get an automatic selection of the tension parameters. To completely describe the motion along the path we present a configurable trajectory planning strategy for the offline definition of time-dependent C2 piece-wise quintic feedrates. When PH spline curves are considered, the corresponding accurate and efficient CNC interpolator algorithms can be exploited

Smooth path planning with Pythagorean-hodoghraph spline curves geometric design and motion control

This thesis addresses two significative problems regarding autonomous systems, namely path and trajectory planning. Path planning deals with finding a suitable path from a start to a goal position by exploiting a given representation of the environment. Trajectory planning schemes govern the motion along the path by generating appropriate reference (path) points. We propose a two-step approach for the construction of planar smooth collision-free navigation paths. Obstacle avoidance techniques that rely on classical data structures are initially considered for the identification of piecewise linear paths that do not intersect with the obstacles of a given scenario. In the second step of the scheme we rely on spline interpolation algorithms with tension parameters to provide a smooth planar control strategy. In particular, we consider Pythagorean–hodograph (PH) curves, since they provide an exact computation of fundamental geometric quantities. The vertices of the previously produced piecewise linear paths are interpolated by using a G1 or G2 interpolation scheme with tension based on PH splines. In both cases, a strategy based on the asymptotic analysis of the interpolation scheme is developed in order to get an automatic selection of the tension parameters. To completely describe the motion along the path we present a configurable trajectory planning strategy for the offline definition of time-dependent C2 piece-wise quintic feedrates. When PH spline curves are considered, the corresponding accurate and efficient CNC interpolator algorithms can be exploited

Dynamic Lane-Changing Trajectory Planning for Autonomous Vehicles Based on Discrete Global Trajectory

Automatic lane-changing is a complex and critical task for autonomous vehicle control. Existing researches on autonomous vehicle technology mainly focus on avoiding obstacles; however, few studies have accounted for dynamic lane changing based on some certain assumptions, such as the lane-changing speed is constant or the terminal state is known in advance. In this study, a typical lane-changing scenario is developed with the consideration of preceding and lagging vehicles on the road. Based on the local trajectory generated by the global positioning system, a path planning model and a speed planning model are respectively established through the cubic polynomial interpolation. To guarantee the driving safety, passenger comfort and vehicle efficiency, a comprehensive trajectory optimization function is proposed according to the path planning model and speed planning model. In addition, a dynamic decoupling model is established to solve the problems of real-time application to provide viable solutions. The simulations and real vehicle validations are conducted, and the results highlight that the proposed method can generate a satisfactory lane-changing trajectory for automatic lane-changing actions

Path Planning For Persistent Surveillance Applications Using Fixed-Wing Unmanned Aerial Vehicles

This thesis addresses coordinated path planning for fixed-wing Unmanned Aerial Vehicles (UAVs) engaged in persistent surveillance missions. While uniquely suited to this mission, fixed wing vehicles have maneuver constraints that can limit their performance in this role. Current technology vehicles are capable of long duration flight with a minimal acoustic footprint while carrying an array of cameras and sensors. Both military tactical and civilian safety applications can benefit from this technology. We make three main contributions: C1 A sequential path planner that generates a C2 flight plan to persistently acquire a covering set of data over a user designated area of interest. The planner features the following innovations: • A path length abstraction that embeds kino-dynamic motion constraints to estimate feasible path length • A Traveling Salesman-type planner to generate a covering set route based on the path length abstraction • A smooth path generator that provides C2 routes that satisfy user specified curvature constraints C2 A set of algorithms to coordinate multiple UAVs, including mission commencement from arbitrary locations to the start of a coordinated mission and de-confliction of paths to avoid collisions with other vehicles and fixed obstacles iv C3 A numerically robust toolbox of spline-based algorithms tailored for vehicle routing validated through flight test experiments on multiple platforms. A variety of tests and platforms are discussed. The algorithms presented are based on a technical approach with approximately equal emphasis on analysis, computation, dynamic simulation, and flight test experimentation. Our planner (C1) directly takes into account vehicle maneuverability and agility constraints that could otherwise render simple solutions infeasible. This is especially important when surveillance objectives elevate the importance of optimized paths. Researchers have devel oped a diverse range of solutions for persistent surveillance applications but few directly address dynamic maneuver constraints. The key feature of C1 is a two stage sequential solution that discretizes the problem so that graph search techniques can be combined with parametric polynomial curve generation. A method to abstract the kino-dynamics of the aerial platforms is then presented so that a graph search solution can be adapted for this application. An A* Traveling Salesman Problem (TSP) algorithm is developed to search the discretized space using the abstract distance metric to acquire more data or avoid obstacles. Results of the graph search are then transcribed into smooth paths based on vehicle maneuver constraints. A complete solution for a single vehicle periodic tour of the area is developed using the results of the graph search algorithm. To execute the mission, we present a simultaneous arrival algorithm (C2) to coordinate execution by multiple vehicles to satisfy data refresh requirements and to ensure there are no collisions at any of the path intersections. We present a toolbox of spline-based algorithms (C3) to streamline the development of C2 continuous paths with numerical stability. These tools are applied to an aerial persistent surveillance application to illustrate their utility. Comparisons with other parametric poly nomial approaches are highlighted to underscore the benefits of the B-spline framework. Performance limits with respect to feasibility constraints are documented

Perception Framework for Activities of Daily Living Manipulation Tasks

There is an increasing concern in tackling the problems faced by the elderly community and physically in-locked people to lead an independent life experience problems with self- care. The need for developing service robots that can help people with mobility impairments is hence very essential. Developing a control framework for shared human-robot autonomy will allow locked-in individuals to perform the Activities of Daily Living (ADL) in a exible way. The relevant ADL scenarios were identi ed as handling objects, self-feeding, and opening doors for indoor nav- igation assistance. Multiple experiments were conducted, which demonstrates that the robot executes these daily living tasks reliably without requiring adjustment to the environment. The indoor manipulation tasks hold the challenge of dealing with a wide range of unknown objects. This thesis presents a framework developed for grasping without requiring a priori knowledge of the objects being manipulated. A successful manipulation task requires the combination of aspects such as envi- ronment modeling, object detection with pose estimation, grasp planning, motion planning followed by an e?cient grasp execution, which is validated by a 6+2 Degree of Freedom robotic manipulator

Automatic Lane-Changing Decision Based on Single-Step Dynamic Game with Incomplete Information and Collision-Free Path Planning

Traffic accidents are often caused by improper lane changes. Although the safety of lane-changing has attracted extensive attention in the vehicle and traffic fields, there are few studies considering the lateral comfort of vehicle users in lane-changing decision-making. Lane-changing decision-making by single-step dynamic game with incomplete information and path planning based on Bézier curve are proposed in this paper to coordinate vehicle lane-changing performance from safety payoff, velocity payoff, and comfort payoff. First, the lane-changing safety distance which is improved by collecting lane-changing data through simulated driving, and lane-changing time obtained by Bézier curve path planning are introduced into the game payoff, so that the selection of the lane-changing start time considers the vehicle safety, power performance and passenger comfort of the lane-changing process. Second, the lane-changing path without collision to the forward vehicle is obtained through the constrained Bézier curve, and the Bézier curve is further constrained to obtain a smoother lane-changing path. The path tracking sliding mode controller of front wheel angle compensation by radical basis function neural network is designed. Finally, the model in the loop simulation and the hardware in the loop experiment are carried out to verify the advantages of the proposed method. The results of three lane-changing conditions designed in the hardware in the loop experiment show that the vehicle safety, power performance, and passenger comfort of the vehicle controlled by the proposed method are better than that of human drivers in discretionary lane change and mandatory lane change scenarios.</jats:p