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
Book ChapterDOI
Sampling-Diagram Automata: A Tool for Analyzing Path Quality in Tree Planners
TL;DR: It is proved, for a simple family of obstacle settings, that the popular dual-tree planner Bi-RRT may produce low- quality paths that are arbitrarily worse than optimal with modest but significant probability, and overlook higher-quality paths even when such paths are easy to produce.
Journal ArticleDOI
Manipulating deformable objects by interleaving prediction, planning, and control:
TL;DR: In this article, a framework for deformable object manipulation that interleaves planning and control is presented, enabling complex manipulation tasks without relying on high-fidelity modeling or simulation.
Dissertation
Graph-based path planning for mobile robots
Magnus Egerstedt,David Wooden +1 more
TL;DR: Questions of navigation, planning and control of real-world mobile robotic systems are addressed, and a modification of the canonical two-layer hybrid architecture: deliberative planning on top, with reactive behaviors underneath is modified.
Journal ArticleDOI
Improving the Performance of Sampling-Based Motion Planning With Symmetry-Based Gap Reduction
TL;DR: This method uses system symmetry, e.g., invariance of dynamics with respect to certain state transformations, to achieve efficient gap reduction by evaluating trajectory final state with a constant-time operation, and generating the admissible perturbed trajectories.
Journal ArticleDOI
Navigation and steering for autonomous virtual humans
TL;DR: A review of the large body of contributions in steering and navigation for autonomous agents in dynamic virtual worlds describes the benefits and limitations of different proposed solutions and identifies potential future research directions to meet the needs for the next generation of interactive virtual world applications.
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.