State-variable planning under structural restrictions: algorithms and complexity
Artificial Intelligence
Decomposition of planning problems
AI Communications
Concise finite-domain representations for PDDL planning tasks
Artificial Intelligence
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
The fast downward planning system
Journal of Artificial Intelligence Research
Concise finite-domain representations for PDDL planning tasks
Artificial Intelligence
Cost-optimal planning with landmarks
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Inference and Learning in Planning (Extended Abstract)
DS '09 Proceedings of the 12th International Conference on Discovery Science
Planning with h+in theory and practice
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Optimal admissible composition of abstraction heuristics
Artificial Intelligence
On the generality of parameter tuning in evolutionary planning
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Brothers in Arms? On AI Planning and Cellular Automata
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Landmarks in Hierarchical Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Sound and Complete Landmarks for And/Or Graphs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Constraint Based Planning with Composable Substate Graphs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Compiling Uncertainty Away in Non-Deterministic Conformant Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Heuristics for planning with SAT
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A look-ahead B&B search for cost-based planning
CAEPIA'09 Proceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence
Domain Independent Goal Recognition
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Implicit abstraction heuristics
Journal of Artificial Intelligence Research
The LAMA planner: guiding cost-based anytime planning with landmarks
Journal of Artificial Intelligence Research
Planning with incomplete information
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
On-line planning and scheduling: an application to controlling modular printers
Journal of Artificial Intelligence Research
Full extraction of landmarks in propositional planning tasks
AI*IA'11 Proceedings of the 12th international conference on Artificial intelligence around man and beyond
Analyzing search topology without running any search: on the connection between causal graphs and h+
Journal of Artificial Intelligence Research
Planning in domains with derived predicates through rule-action graphs and local search
Annals of Mathematics and Artificial Intelligence
On the benefit of sub-optimality within the divide-and-evolve scheme
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Landmark-enhanced abstraction heuristics
Artificial Intelligence
An Empirical Analysis of Some Heuristic Features for Planning through Local Search and Action Graphs
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
SAS+ planning as satisfiability
Journal of Artificial Intelligence Research
On the utility of landmarks in SAT based planning
Knowledge-Based Systems
A hybrid LP-RPG heuristic for modelling numeric resource flows in planning
Journal of Artificial Intelligence Research
Problem splitting using heuristic search in landmark orderings
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Landmark-based heuristics and search control for automated planning (extended abstract)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.01 |
Landmarks for propositional planning tasks are variable assignments that must occur at some point in every solution plan. We propose a novel approach for using landmarks in planning by deriving a pseudo-heuristic and combining it with other heuristics in a search framework. The incorporation of landmark information is shown to improve success rates and solution qualities of a heuristic planner. We furthermore show how additional landmarks and orderings can be found using the information present in multi-valued state variable representations of planning tasks. Compared to previously published approaches, our landmark extraction algorithm provides stronger guarantees of correctness for the generated landmark orderings, and our novel use of landmarks during search solves more planning tasks and delivers considerably better solutions.