A locally optimal fast obstacle-avoiding path-planning algorithm
نویسندگان
چکیده
منابع مشابه
Real-Time Obstacle-Avoiding Path Planning for Mobile Robots
In this paper a computationally effective trajectory generation algorithm of mobile robots is proposed. The algorithm plans a reference path based on Voronoi diagram and Bézier curves, that meet obstacle avoidance criteria. Bézier curves defining the path are created such that the circumference convex polygon of their control points miss all obstacles. To give smoothness, they are connected und...
متن کاملObstacle-avoiding Path Planning for High Velocity Wheeled Mobile Robots
This paper presents a new motion planning algorithm for wheeled mobile robots in presence of known static obstacles, especially well-suited for high velocity situations. It takes into account several conditions traditionally attached to smooth path planning, i.e. paths with continuous derivative and upper-bounded curvature. It makes use of a global path planner which exploits polynomial G curve...
متن کاملPath-Planning with Obstacle-Avoiding Minimum Curvature Variation B-splines
We study the general problem of computing an obstacle-avoiding path that, for a prescribed weight, minimizes the weighted sum of a smoothness measure and a safety measure of the path. We consider planar curvaturecontinuous paths, that are functions on an interval of a room axis, for a point-size vehicle amidst obstacles. The obstacles are two disjoint continuous functions on the same interval. ...
متن کاملA path planning strategy for obstacle avoidance
This paper presents an obstacle avoidance module dedicated to non-holonomic wheeled mobile robots. Chained system theory and deformable virtual zone principle are coupled to design an original framework based on path following formalism. The proposed strategy allows to correct the control output provided by a navigation module to preserve the robot security while assuring the navigation task. F...
متن کاملA Pareto Optimal D* Search Algorithm for Multiobjective Path Planning
Path planning is one of the most vital elements of mobile robotics, providing the agent with a collision-free route through the workspace. The global path plan can be calculated with a variety of informed search algorithms, most notably the A* search method, guaranteed to deliver a complete and optimal solution that minimizes the path cost. D* is widely used for its dynamic replanning capabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Modelling
سال: 1987
ISSN: 0270-0255
DOI: 10.1016/0270-0255(87)90074-1