The input/output complexity of sorting and related problems
Communications of the ACM
I/O-complexity of graph algorithms
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Breadth-first heuristic search
Artificial Intelligence
Constraint partitioning in penalty formulations for solving temporal planning problems
Artificial Intelligence
Structured duplicate detection in external-memory graph search
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Large-scale parallel breadth-first search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
PDDL2.1: an extension to PDDL for expressing temporal planning domains
Journal of Artificial Intelligence Research
The metric-FF planning system: translating "Ignoring delete lists" to numeric state variables
Journal of Artificial Intelligence Research
An approach to temporal planning and scheduling in domains with predictable exogenous events
Journal of Artificial Intelligence Research
Parallel external directed model checking with linear i/o
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
COLIN: planning with continuous linear numeric change
Journal of Artificial Intelligence Research
Evaluation of a simple, scalable, parallel best-first search strategy
Artificial Intelligence
Hi-index | 0.00 |
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costoptimal solution. We contribute a procedure for finding the 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. We also discuss an external variant of Enforced Hill Climbing. Using relaxed-plan heuristic without helpful-action pruning we have been able to perform large explorations on metric planning problems, providing better plan lengths than have been reported earlier. A novel approach to plan reconstruction in external setting with linear I/O complexity is proposed. We provide external exploration results on some recently proposed planning domains.