Computing upper bounds on lengths of transition sequences

Authors:
Jussi Rintanen;Charles Orgill Gretton
Affiliations:
Department of Information and Computer Science, Aalto University, Finland;Optimisation Research Group, NICTA, Australia
Venue:
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Year:
2013

Citing 17
Cited 0

The computational complexity of propositional STRIPS planning

Artificial Intelligence
Automatically generating abstractions for planning

Artificial Intelligence
Inferring state constraints for domain-independent planning

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Planning as heuristic search

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Tractable plan existence does not imply tractable plan generation

Annals of Mathematics and Artificial Intelligence
Searching with Pattern Databases

AI '96 Proceedings of the 11th Biennial Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Directed model checking with distance-preserving abstractions

International Journal on Software Tools for Technology Transfer (STTT)
Regression for Classical and Nondeterministic Planning

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Domain-independent construction of pattern database heuristics for cost-optimal planning

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
A reactive planner for a model-based executive

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Structure and complexity in planning with unary operators

Journal of Artificial Intelligence Research
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Finding optimal solutions to Rubik's cube using pattern databases

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
A weighted CSP approach to cost-optimal planning

AI Communications
The influence of k-dependence on the complexity of planning

Artificial Intelligence
Heuristics for fast exact model counting

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Planning as satisfiability: Heuristics

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an approach to computing upper bounds on the lengths of solutions to reachability problems in transition systems. It is based on a decomposition of state-variable dependency graphs (causal graphs). Our approach is able to find practical upper bounds in a number of planning benchmarks. Computing the bounds is computationally cheap in practice, and in a number of benchmarks our algorithm runs in polynomial time in the number of actions and propositional variables that characterize the problem.