Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Lydia E. Kavraki,P. Svestka,Jean-Claude Latombe,Mark H. Overmars +3 more
- Vol. 12, Iss: 4, pp 566-580
Reads0
Chats0
TLDR
Experimental results show that path planning can be done in a fraction of a second on a contemporary workstation (/spl ap/150 MIPS), after learning for relatively short periods of time (a few dozen seconds).Abstract:
A new motion planning method for robots in static workspaces is presented. This method proceeds in two phases: a learning phase and a query phase. In the learning phase, a probabilistic roadmap is constructed and stored as a graph whose nodes correspond to collision-free configurations and whose edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two nodes. The method is general and easy to implement. It can be applied to virtually any type of holonomic robot. It requires selecting certain parameters (e.g., the duration of the learning phase) whose values depend on the scene, that is the robot and its workspace. But these values turn out to be relatively easy to choose, Increased efficiency can also be achieved by tailoring some components of the method (e.g., the local planner) to the considered robots. In this paper the method is applied to planar articulated robots with many degrees of freedom. Experimental results show that path planning can be done in a fraction of a second on a contemporary workstation (/spl ap/150 MIPS), after learning for relatively short periods of time (a few dozen seconds).read more
Citations
More filters
Posted Content
A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors
TL;DR: In this article, the authors define and investigate the Lazy Shortest Path class of algorithms, which is differentiated by the choice of an edge selector function, and propose various novel selectors inspired by sampling and statistical mechanics, and find that these selectors outperform existing algorithms on a set of example problems.
Navigation among movable obstacles
James J. Kuffner,Mike Stilman +1 more
TL;DR: This thesis devise a state space decomposition strategy that reasons about free space connectivity to select objects and identify helpful displacements, and presents controls for balance and manipulation that allow the robot to move objects with previously unknown dynamics.
Journal ArticleDOI
Semi-lazy probabilistic roadmap: a parameter-tuned, resilient and robust path planning method for manipulator robots
TL;DR: A new variation of sampling-based methods called semi-lazy probabilistic roadmap (SLPRM) for motion planning of industrial manipulators, which benefits from the advantages of the basic probabilism roadmap (PRM), and lazy-PRM (L PRM) methods.
Proceedings ArticleDOI
Optimal Control with Weighted Average Costs and Temporal Logic Specifications
TL;DR: Dynamic programming algorithms are used to construct an optimal trajectory for the system that minimizes the cost function while satisfying a temporal logic specification, and minimize a weighted average cost function.
Proceedings ArticleDOI
Comparison of A and RRT-Connect Motion Planning Techniques for Self-Reconfiguration Planning
TL;DR: The results show that RRT-connect is significantly faster than A* for difficult self-reconfiguration problems and it is possible to optimize the paths from R RT-connect by a simple and efficient method such that the difference is negligible.
References
More filters
Book
Robot Motion Planning
TL;DR: This chapter discusses the configuration space of a Rigid Object, the challenges of dealing with uncertainty, and potential field methods for solving these problems.
Journal ArticleDOI
An algorithm for planning collision-free paths among polyhedral obstacles
TL;DR: A collision avoidance algorithm for planning a safe path for a polyhedral object moving among known polyhedral objects that transforms the obstacles so that they represent the locus of forbidden positions for an arbitrary reference point on the moving object.
Journal ArticleDOI
Spatial Planning: A Configuration Space Approach
TL;DR: In this article, the authors propose an approach based on characterizing the position and orientation of an object as a single point in a configuration space, in which each coordinate represents a degree of freedom in the position or orientation of the object.
Journal ArticleDOI
Exact robot navigation using artificial potential functions
Elon Rimon,Daniel E. Koditschek +1 more
TL;DR: A methodology for exact robot motion planning and control that unifies the purely kinematic path planning problem with the lower level feedback controller design is presented.
Book
Spatial planning: a configuration space approach
TL;DR: Algorithms for computing constraints on the position of an object due to the presence of ther objects, which arises in applications that require choosing how to arrange or how to move objects without collisions are presented.