216 search results - page 11 / 44 » The Complexity of Planning Problems With Simple Causal Graph... |
IJCAI
2001
13 years 9 months ago
2001
Certain planning systems that deal with quantitative time constraints have used an underlying Simple Temporal Problem solver to ensure temporal consistency of plans. However, many...
ICRA
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— This paper revisits the multi-robot boundary coverage problem in which a group of k robots must inspect every point on the boundary of a 2-dimensional environment. We f...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
DNA
2006
Springer
13 years 11 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— Enabling mobile robots to assemble large structures in constrained environments requires planning systems that are both capable of dealing with high complexity and can ...