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
Journal ArticleDOI
A data-driven approach to realistic shape morphing
TL;DR: A novel data‐driven approach for shape morphing given a database with various models belonging to the same category, which produces realistic morphing for challenging cases as demonstrated by various examples in the paper.
Journal ArticleDOI
Toward a deeper understanding of motion alternatives via an equivalence relation on local paths
TL;DR: This paper circumvents expensive collision tests on a given path by detecting that the entire geometry of the path has effectively already been tested on a combination of other paths.
Journal ArticleDOI
Feedback-motion-planning with simulation-based LQR-trees
TL;DR: The simulation-based variant of the LQR-tree feedback-motion-planning approach is presented, which generates a control policy that stabilizes a nonlinear dynamic system from a bounded set of initial conditions to a goal and approximates the funnel of a trajectory.
Proceedings ArticleDOI
Reactive sampling-based temporal logic path planning
Cristian-Ioan Vasile,Calin Belta +1 more
TL;DR: A sampling-based motion planning algorithm that combines long-term temporal logic goals with short-term reactive requirements, and consists of an off-line sampling- based algorithm for the construction of a global transition system that contains a path satisfying the LTL formula.
Journal ArticleDOI
Closed-Chain Manipulation of Large Objects by Multi-Arm Robotic Systems
TL;DR: In this article, a regrasping move, termed "IK-switch", is proposed to bridge components of the configuration space that are otherwise mutually disconnected, which enables complex closed-chain manipulation tasks, such as flipping a chair frame.
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.