Strong planning under partial observability
Authors:
- Piergiorgio BertoliPBPiergiorgio Bertoli
- Alessandro CimattiACAlessandro Cimatti
- Marco RoveriMarco Roveri
- Paolo TraversoPTPaolo Traverso
- 1 April 2006
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 170 (4-5) , 337-384
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- In defense of PDDL axiomsArtificial Intelligence, 2005
- Conformant planning via symbolic model checking and heuristic searchArtificial Intelligence, 2004
- SAT-based planning in complex domains: Concurrency, constraints and nondeterminismArtificial Intelligence, 2003
- A logic programming approach to knowledge-state planning, II: The systemArtificial Intelligence, 2003
- LAO∗: A heuristic search algorithm that finds solutions with loopsArtificial Intelligence, 2001
- NUSMV: a new symbolic model checkerInternational Journal on Software Tools for Technology Transfer, 2000
- Planning and acting in partially observable stochastic domainsArtificial Intelligence, 1998
- An algorithm for probabilistic planningArtificial Intelligence, 1995
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplicationIEEE Transactions on Computers, 1991
- AND/OR graph heuristic search methodsJournal of the ACM, 1985