28 search results - page 4 / 6 » Graph Decomposition for Efficient Multi-Robot Path Planning |
DAM
1999
13 years 5 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
CSCLP
2007
Springer
13 years 11 months ago
2007
Springer
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
ACMACE
2008
ACM
13 years 7 months ago
2008
ACM
This paper proposes a new method to generate smooth camera movement that is collision-free in a three-dimensional virtual environment. It generates a set of cells based on cell de...
JAIR
2006
13 years 5 months ago
2006
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...