Pushing the Envelope: Planning, Propositional Logic and Stochastic Search

Abstract

Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning problems many times faster than the best current planning systems. Although stochastic methods have been shown to be very e ective on a wide range of scheduling problems, this is the rst demonstration of its power on truly challenging classical planning instances. This work also provides a new perspective on representational issues in planning.

Extracted Key Phrases

3 Figures and Tables

050100'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

1,095 Citations

Semantic Scholar estimates that this publication has 1,095 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Kautz1996PushingTE, title={Pushing the Envelope: Planning, Propositional Logic and Stochastic Search}, author={Henry A. Kautz and Bart Selman}, booktitle={AAAI/IAAI, Vol. 2}, year={1996} }