Planning with Problems Requiring Temporal Coordination
نویسندگان
چکیده
We present the first planner capable of reasoning with both the full semantics of PDDL2.1 (level 3) temporal planning and with numeric resources. Our planner, CRIKEY3, employs heuristic forward search, using the start-and-end semantics of PDDL2.1 to manage temporal actions. The planning phase is interleaved with a scheduling phase, using a Simple Temporal Network, in order to ensure that temporal constraints are met. To guide search, we introduce a new temporal variant of the Relaxed Planning Graph heuristic that is capable of reasoning with the features of this class of domains, along with the Timed Initial Literals of PDDL2.2. CRIKEY3 extends the state-of-the-art in handling the full temporal expressive power of PDDL2.1, including numeric temporal domains.
منابع مشابه
Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search
We present an extension of the planning framework based on action graphs and local search to deal with PDDL2.1 temporal problems requiring concurrency, while previously the approach could only solve problems admitting a sequential solution. The paper introduces a revised plan representation supporting concurrency and some new search techniques using it, which are implemented in a new version of...
متن کاملManaging Temporal cycles in Planning Problems Requiring Concurrency
In order to correctly model certain real-world planning problems, it is essential to take into account time. This is the case for problems requiring the concurrent execution of actions (known as temporally-expressive problems). In this paper we define and study the notion of temporally-cyclic problems, that is problems involving sets of cyclically-dependent actions. We characterize those tempor...
متن کاملEnabling Agility through Coordinating Temporally Constrained Planning Agents
In crisis response, hierarchical organizations are being replaced by dynamic assemblies of autonomous agents that promise more agility. However, these autonomous agents might cause a decrease in effectiveness when individually constructed plans for moderately-coupled tasks are not jointly feasible. Existing coordination techniques can be applied in the pre-planning phase to guarantee feasible j...
متن کاملMonotone Temporal Planning :
Wedescribe apolynomially-solvable class of temporal planning problems. Polynomiality follows from two assumptions. Firstly, by supposing that each fluent (fact) can be established by at most one action, we can quickly determine which actions are necessary in any plan. Secondly, the monotonicity of fluents allows us to express planning as an instance of STP (Simple Temporal Problemwith differenc...
متن کاملSMT Spatio-Temporal Planning
Solving real planning problems requires to consider spatial and temporal information. Indeed, to be solved more efficiently many real world problems need to take the action duration, the instants of effects occurrences, the instants of requiring preconditions. . . and the space in which the mission is accomplished by defining the different actions zones and know the path between these zones int...
متن کامل