scispace - formally typeset
Proceedings ArticleDOI

Motion planning using dynamic roadmaps

M. Kallman, +1 more
- Vol. 5, pp 4399-4404
TLDR
This paper focuses on analyzing the tradeoffs between maintaining dynamic roadmaps and applying an on-line bidirectional rapidly-exploring random tree (RRT) planner alone, which requires no preprocessing or maintenance.
Abstract
We evaluate the use of dynamic roadmaps for online motion planning in changing environments. When changes are detected in the workspace, the validity state of affected edges and nodes of a precompiled roadmap are updated accordingly. We concentrate in this paper on analyzing the tradeoffs between maintaining dynamic roadmaps and applying an on-line bidirectional rapidly-exploring random tree (RRT) planner alone, which requires no preprocessing or maintenance. We ground the analysis in several benchmarks in virtual environments with randomly moving obstacles. Different robotics structures are used, including a 17 degrees of freedom model of NASA's Robonaut humanoid. Our results show that dynamic roadmaps can be both faster and more capable for planning difficult motions than using on-line planning alone. In particular, we investigate its scalability to 3D workspaces and higher dimensional configurations spaces, as our main interest is the application of the method to interactive domains involving humanoids.

read more

Content maybe subject to copyright    Report

Citations
More filters
MonographDOI

Planning Algorithms: Introductory Material

TL;DR: This coherent and comprehensive book unifies material from several sources, including robotics, control theory, artificial intelligence, and algorithms, into planning under differential constraints that arise when automating the motions of virtually any mechanical system.
Proceedings ArticleDOI

Replanning with RRTs

TL;DR: This work uses a replanning algorithm for repairing rapidly-exploring random trees when changes are made to the configuration space to create a probabilistic analog to the widely-used D* family of deterministic algorithms, and demonstrates its effectiveness in a multirobot planning domain.
Proceedings ArticleDOI

Multipartite RRTs for Rapid Replanning in Dynamic Environments

TL;DR: The multipartite RRT (MP-RRT), an RRT variant which supports planning in unknown or dynamic environments, is presented, by purposefully biasing the sampling distribution and re-using branches from previous planning iterations.
Proceedings ArticleDOI

Interactive navigation of multiple agents in crowded environments

TL;DR: A novel approach for interactive navigation and planning of multiple agents in crowded scenes with moving obstacles that uses a precomputed roadmap that provides macroscopic, global connectivity for wayfinding and combines it with fast and localized navigation for each agent.
Dissertation

Planning biped locomotion using motion capture data and probabilistic roadmaps = 동작 포착 데이터 및 확률적 로드맵을 이용한 이족 이동 동작 계획

Min-Gyu Choi, +1 more
TL;DR: This paper presents a new scheme for planning natural-looking locomotion of a biped figure to facilitate rapid motion prototyping and task-level motion generation.
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

Probabilistic roadmaps for path planning in high-dimensional configuration spaces

TL;DR: 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).
Journal Article

Rapidly-exploring random trees : a new tool for path planning

TL;DR: The Rapidly-exploring Random Tree (RRT) as discussed by the authors is a data structure designed for path planning problems with high degrees of freedom and non-holonomic constraints, including dynamics.
Proceedings ArticleDOI

RRT-connect: An efficient approach to single-query path planning

TL;DR: A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces by incrementally building two rapidly-exploring random trees rooted at the start and the goal configurations.
Proceedings ArticleDOI

OBBTree: a hierarchical structure for rapid interference detection

TL;DR: A data structure and an algorithm for efficient and exact interference detection amongst complex models undergoing rigid motion that can robustly and accurately detect all the contacts between large complex geometries composed of hundreds of thousands of polygons at interactive rates are presented.