496 research outputs found
Application of Sampling-Based Motion Planning Algorithms in Autonomous Vehicle Navigation
With the development of the autonomous driving technology, the autonomous vehicle has become one of the key issues for supporting our daily life and economical activities. One of the challenging research areas in autonomous vehicle is the development of an intelligent motion planner, which is able to guide the vehicle in dynamic changing environments. In this chapter, a novel sampling-based navigation architecture is introduced, which employs the optimal properties of RRT* planner and the low running time property of low-dispersion sampling-based algorithms. Furthermore, a novel segmentation method is proposed, which divides the sampling domain into valid and tabu segments. The resulted navigation architecture is able to guide the autonomous vehicle in complex situations such as takeover or crowded environments. The performance of the proposed method is tested through simulation in different scenarios and also by comparing the performances of RRT and RRT* algorithms. The proposed method provides near-optimal solutions with smaller trees and in lower running time
Minimum-time trajectory generation for quadrotors in constrained environments
In this paper, we present a novel strategy to compute minimum-time
trajectories for quadrotors in constrained environments. In particular, we
consider the motion in a given flying region with obstacles and take into
account the physical limitations of the vehicle. Instead of approaching the
optimization problem in its standard time-parameterized formulation, the
proposed strategy is based on an appealing re-formulation. Transverse
coordinates, expressing the distance from a frame path, are used to
parameterise the vehicle position and a spatial parameter is used as
independent variable. This re-formulation allows us to (i) obtain a fixed
horizon problem and (ii) easily formulate (fairly complex) position
constraints. The effectiveness of the proposed strategy is proven by numerical
computations on two different illustrative scenarios. Moreover, the optimal
trajectory generated in the second scenario is experimentally executed with a
real nano-quadrotor in order to show its feasibility.Comment: arXiv admin note: text overlap with arXiv:1702.0427
Path Planning for Mobile Robot Navigation using Voronoi Diagram and Fast Marching
For navigation in complex environments, a robot need s to reach a compromise between the need for having efficient and optimized trajectories and t he need for reacting to unexpected events. This paper presents a new sensor-based Path Planner w hich results in a fast local or global motion planning able to incorporate the new obstacle information. In the first step the safest areas in the environment are extracted by means of a Vorono i Diagram. In the second step the Fast Marching Method is applied to the Voronoi extracted a reas in order to obtain the path. The method combines map-based and sensor-based planning o perations to provide a reliable motion plan, while it operates at the sensor frequency. The m ain characteristics are speed and reliability, since the map dimensions are reduced to an almost uni dimensional map and this map represents the safest areas in the environment for moving the robot. In addition, the Voronoi Diagram can be calculated in open areas, and with all kind of shaped obstacles, which allows to apply the proposed planning method in complex environments wher e other methods of planning based on Voronoi do not work.This work has been supported by the CAM Project S2009/DPI-1559/ROBOCITY2030 I
- …