Download:
by Stefan Edelkamp, Shahid Jabbar, Mohammed Nazih
In International Conference on Automated Planning and Scheduling (ICAPS) Workshop on Preferences and Soft Constraints in Planning
http://andorfer.cs.uni-dortmund.de/~jabbar/MIPS-XXL-IPC5.pdf
Add To MetaCart
Abstract:
This paper deals with planning in the presence of constraints and preferences as proposed for the 5 th International Planning Competition. State trajectory constraints are translated into LTL formulae and are compiled into Büchi automata in PDDL format. Preference constraints are compiled into numerical fluents. Values of these fluents are changed by grounded operator effects upon violation. We propose two exploration strategies for optimal planning in PDDL3 domains: (i) a best-first branchand-bound weighted heuristic search; (ii) an external breadth-first search exploration algorithm that exploits secondary memory, such as harddisk, to save the open and closed lists. We prove an upper bound on the locality of the search in planning graphs that dictates the number of layers that have to be kept to avoid re-openings. For non-optimal planning, we present an external variant of enforced hill climbing.
Citations
|
2869
|
Introduction to Automata Theory, Languages and Computation
– Hopcroft, Ullman
- 1979
|
|
410
|
The Input/Output complexity of sorting and related problems
– Aggarwal, Vitter
- 1988
|
|
246
|
On a decision method in restricted second order arithmetic
– Büchi
- 1962
|
|
209
|
PDDL 2.1: an Extension to PDDL for Expressing Temporal Planning Domains
– FOX, LONG
- 2002
|
|
195
|
Using Temporal Logics to Express Search Control Knowledge for Planning
– Bacchus, Kabanza
- 2000
|
|
172
|
Temporal logic can be more expressive
– Wolper
- 1983
|
|
97
|
The Complementation Problem for Buchi Automata with Applications to Temporal Logic,’’ Theoret
– Sistla, Vardi, et al.
- 1987
|
|
64
|
Combining the expressivity of UCPOP with the efficiency of graphplan
– Gazen, Knoblock
- 1997
|
|
52
|
I/O-complexity of graph algorithms
– Kameshwar, Ranade
- 1999
|
|
51
|
The Metric-FF planning system: Translating “ignoring delete lists” to numeric state variables
– Hoffmann
|
|
51
|
Planning as model checking for extended goals in non-deterministic domains
– Postore, Traverso
- 2001
|
|
47
|
Planning with a language for extended goals
– Lago, Pistore, et al.
- 2002
|
|
41
|
On the compilability and expressive power of propositional planning formalisms
– Nebel
|
|
26
|
The deterministic part of IPC-4: An overview
– Hoffmann, Edelkamp
- 2005
|
|
26
|
Breadth-First heuristic search
– Zhou, Hansen
- 2007
|
|
25
|
Plan constraints and preferences in PDDL3
– Gerevini, Long
- 2006
|
|
22
|
Automata-theoretic approach to planning for temporally extended goals
– Giacomo, Vardi
- 1999
|
|
21
|
Large-scale parallel breadth-first search
– Korf, Schultze
- 2005
|
|
20
|
On the complexity of omega-automata
– Safra
- 1988
|
|
19
|
Planning with reduced operator sets
– Haslum, Jonsson
- 2000
|
|
12
|
Fast plan generation through heuristic search
– Hoffmann, Nebel
- 2001
|
|
8
|
I/O efficient directed model checking
– Jabbar, Edelkamp
- 2005
|
|
2
|
Search control in planing for termporally extended goals
– Kabanza, Thiebaux
- 2005
|
|
1
|
Cost-optimal external planning
– Edelkamp, Jabbar
- 2006
|
