Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems
نویسندگان
چکیده
منابع مشابه
Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems
We present a new and complete multi-level approach for solving path planning problems for nonholonomic robots. At the rst level a path is found that disrespects (some of) the nonholonomic constraints. At each next level a new path is generated, by transformation of the path generated at the previous level. The transformation is such that more nonholonomic constraints are respected than at the p...
متن کاملEfficient Path Planning for Nonholonomic Mobile Robots
This work addresses path planning for nonholonomic robots moving in two-dimensional space. The problem consists in computing a sequence of line segments that leads from the current configuration of the robot to a target location, while avoiding a given set of obstacles. We describe a planning algorithm that has the advantage of being very efficient, requiring less of one millisecond of CPU time...
متن کاملPSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety
In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...
متن کاملNonholonomic Path Planning Using Harmonic Functions
A method is presented for planning obstacle-avoiding paths for a system which exhibits nonholonomic constraints. The method is based on the use of harmonic functions. Linear constraints on the velocity of a nonholonomic system can be directly expressed as Neumann boundary conditions for a harmonic function. Such boundary conditions are easily represented in a resistive network. The resulting po...
متن کاملNonholonomic motion planning for car-like robots
We consider the robot motion planning problem in the presence of non-integrable kinematic constraints, known as non-holonomic constraints. Car-like non-holonomic mobile robots are used for solving this problem, and several implemented planners are discussed. We claim that the randomized methods are more capable of efficiently solving many challenging, high-dimensional problems. Results with ran...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Robotics Research
سال: 1998
ISSN: 0278-3649,1741-3176
DOI: 10.1177/027836499801700803