28 search results - page 2 / 6 » Graph Decomposition for Efficient Multi-Robot Path Planning |
TVCG
2008
13 years 4 months ago
2008
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
IJRR
2002
13 years 4 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
AIPS
1996
13 years 5 months ago
1996
An increasing number of planners can handle uncertainty in the domain or in action outcomes. However, less work has addressed building plans when the planner's world can chan...
ICTAI
2000
IEEE
13 years 8 months ago
2000
IEEE
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
IROS
2007
IEEE
13 years 10 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...