108 search results - page 6 / 22 » Computational Complexity of Planning with Temporal Goals |
AIPS
2004
14 years 11 months ago
2004
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
ICRA
2007
IEEE
15 years 3 months ago
2007
IEEE
— Given a robot model and a class of admissible environments, this paper provides a framework for automatically and verifiably composing controllers that satisfy high level task...
ICRA
2010
IEEE
14 years 8 months ago
2010
IEEE
— This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
We present an approach to building libraries of tasks in complex action languages such as Golog, for query answering. Our formalization is based on a situation calculus framework t...
AIPS
2007
14 years 12 months ago
2007
Planning in domains with temporal and numerical properties is an important research problem. One application of this is the resource production problem in real-time strategy (RTS)...