## A Planning Algorithm not based on Directional Search (1998)

### Cached

### Download Links

- [www.informatik.uni-freiburg.de]
- [www.ics.uci.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING: PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE (KR '98 |

Citations: | 46 - 14 self |

### BibTeX

@INPROCEEDINGS{Rintanen98aplanning,

author = {Jussi Rintanen},

title = {A Planning Algorithm not based on Directional Search},

booktitle = {PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING: PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE (KR '98},

year = {1998},

pages = {617--624},

publisher = {Morgan Kaufmann Publishers}

}

### Years of Citing Articles

### OpenURL

### Abstract

The initiative in STRIPS planning has recently been taken by work on propositional satisfiability. Best current planners, like Graphplan, and earlier planners originating in the partial-order or refinement planning community have proved in many cases to be inferior to general-purpose satisfiability algorithms in solving planning problems. However, no explanation of the success of programs like Walksat or relsat in planning has been offered. In this paper we discuss a simple planning algorithm that reconstructs the planner in the background of the SAT/CSP approach.

### Citations

955 | Fast Planning through Planning Graph Analysis - Blum, Furst - 1995 |

876 | Symbolic Boolean manipulation with ordered binary-decision diagrams
- Bryant
- 1992
(Show Context)
Citation Context ...umes a lot of memory (our implementation uses a slightly better representation), and therefore a more concise representation should be used instead, for example one based on binary decision diagrams [=-=Bryant, 1992-=-]. Acknowledgements We thank Chu Min Li for kindly providing us copies of satz and related satisfiability programs, and Harald Rueß for comments and advice. Financial support from Suomalainen tiedeaka... |

740 |
A machine program for theorem proving
- Davis, Logemann, et al.
- 1962
(Show Context)
Citation Context ...s [Kautz and Selman, 1996; Kautz et al., 1996; Ernst et al., 1997]. Parallel to advances in solving satisfiability problems by stochastic search, improvements to the well-known DavisPutnam procedure [=-=Davis et al., 1962-=-] have been discovered. State-of-the-art implementations include Crawford's [1996] tableau and Freeman's [1995] Posit. Techniques that have made it possible to solve planning problems of the same diff... |

521 | Pushing the envelope: planning, propositional logic and stochastic search
- Kautz, Selman
(Show Context)
Citation Context ...lgorithms for checking the satisfiability of propositional formulae. STRIPS planning problems have been used as benchmarks to test SAT algorithms based on greedy local search [Kautz and Selman, 1992; =-=Kautz and Selman, 1996-=-], and new developments [Bayardo, Jr. and Schrag, 1997] of the well-known Davis-Putnam procedure. As a contribution to planning research, these SAT algorithms have proved to be in many cases orders of... |

384 | Systematic Nonlinear Planning
- Mcallester, Rosenblitt
- 1991
(Show Context)
Citation Context ...t is not. This is in strong contrast with Graphplan [Blum and Furst, 1995] that generates a branch for every minimal set of operators that produces the current subgoal, and with algorithms like SNLP [=-=McAllester and Rosenblitt, 1991-=-] that branch on possible ways of extending a partially ordered plan so that a threat is removed or an operation in the incomplete plan has its precondition fulfilled. An inference technique from sati... |

160 | Improvements to Propositional Satisfiability Search Algorithms - Freeman - 1995 |

147 | Encoding plans in propositional logic
- Kautz, McAllester, et al.
- 1996
(Show Context)
Citation Context ...ral ways to express the frame axioms and to make the set of formulae more concise, which has led to a thread of research on the quantitative properties of different encodings [Kautz and Selman, 1996; =-=Kautz et al., 1996-=-; Ernst et al., 1997]. Parallel to advances in solving satisfiability problems by stochastic search, improvements to the well-known DavisPutnam procedure [Davis et al., 1962] have been discovered. Sta... |

143 | Monotonic solution of the frame problem in the situation calculus: an efficient method for worlds with fully specified actions
- Schubert
- 1990
(Show Context)
Citation Context ...ditions and effects of operators, and formulae describing the initial state and the goal. We take as an example the axiomatization from [Kautz et al., 1996] with explanatory frame axioms [Haas, 1987; =-=Schubert, 1990-=-] and parallel operations. For a fluent that can be made true by operators , explanatory frame axioms are where "!# $&% is an integer referring to a point of time and $ is the plan length. An operator... |

136 | AUTON: Experimental results on the crossover point in random 3-SAT - CRAWFORD, LARRY - 1996 |

120 | Anbulagan: Heuristics based on unit propagation for satisfiability problems - Li - 1997 |

114 | Encoding planning problems in nonmonotonic logic programs
- Dimopoulos, Nebel, et al.
- 1997
(Show Context)
Citation Context ...The parallel versions of these blocks world problems are more constrained and solutions are found quickly, for example, solving bw-large.d even with standard parallelism without post-serializability [=-=Dimopoulos et al., 1997-=-] takes 100 seconds. The number ofTable 1: Runtimes of some benchmark problems problem R BF95 KS96 rocket.ext.a 3.8 (1.4) 520 (0.1) rocket.ext.b 2.7 (0.6) 2337 (0.2) bw-large.b 74.1 (33.0) 27115 (22)... |

89 | Powerful techniques for the automatic generation of invariants
- Bensalem, Lakhnech, et al.
- 1996
(Show Context)
Citation Context ...then make True at . 4.1 COMPUTATION OF INVARIANTS We have devised an algorithm for computing 2-literal invariants. Its structure is similar to the invariant algorithms in computer-aided verification [=-=Bensalem et al., 1996-=-]. ' The algorithm starts with a candidate invariant , consisting of all the 2-literal clauses true in the initial state, and weakening it repeatedly by removing clauses that are made false by an oper... |

3 | Schrag.“Using CSP look-back techniques to solve exceptionally hard - Bayardo, R - 1996 |

2 |
Weld: Tradeoffs in automatic SAT-compilation of planning problems
- Ernst, Millstein, et al.
- 1997
(Show Context)
Citation Context ...the frame axioms and to make the set of formulae more concise, which has led to a thread of research on the quantitative properties of different encodings [Kautz and Selman, 1996; Kautz et al., 1996; =-=Ernst et al., 1997-=-]. Parallel to advances in solving satisfiability problems by stochastic search, improvements to the well-known DavisPutnam procedure [Davis et al., 1962] have been discovered. State-of-the-art implem... |