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
Proceedings ArticleDOI
Hoplites: A Market-Based Framework for Planned Tight Coordination in Multirobot Teams
TL;DR: This paper has developed a market-based framework, Hoplites, that consists of two novel coordination mechanisms, Passive coordination quickly produces locally-developed solutions while active coordination produces complex team solutions via negotiation between teammates.
Journal ArticleDOI
The Ariadne's clew algorithm
TL;DR: Ariadne's clew algorithm is designed to find paths in high-dimensional continuous spaces and applies to robots with many degrees of freedom in static, as well as dynamic environments -- ones where obstacles may move.
Journal ArticleDOI
Quasi-static manipulation of a Kirchhoff elastic rod based on a geometric analysis of equilibrium configurations
Timothy Bretl,Zoe McCarthy +1 more
TL;DR: It is proved that the set of all local solutions to a geometric optimal control problem, with boundary conditions that vary with the position and orientation of each gripper, is a smooth manifold of finite dimension that can be parameterized by a single chart.
Journal ArticleDOI
Multilevel Path Planning for Nonholonomic Robots Using Semiholonomic Subsystems
TL;DR: This paper applies the multilevel scheme to carlike robots pulling trail ers, that is, tractor-trailer robots, and shows that using the multi-level scheme leads to significantly better performance than direct transformations to feasible paths.
Journal ArticleDOI
Risk-aware Path Planning for Autonomous Underwater Vehicles using Predictive Ocean Models
TL;DR: In this paper, two stochastic planners, a minimum expected risk planner and a risk-aware Markov decision process, were proposed to improve the safety and reliability of AUV operation in coastal regions.
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.