Heuristic search + symbolic model checking = efficient conformant planning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 467-472

  Bertoli, Piergiorgio ^a   Cimatti, Alessandro ^a   Roveri, Marco ^a,b  

^a ITC IRST   (Italy)

^b UNIVERSITY OF MILAN   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONFORMANT PLANNING; DEGREE OF UNCERTAINTY; EXPERIMENTAL EVALUATION; ORDERS OF MAGNITUDE; SELECTION FUNCTION; SYMBOLIC MODEL CHECKING; SYMBOLIC TECHNIQUES; THREE ORDERS OF MAGNITUDE;

ARTIFICIAL INTELLIGENCE; BINARY DECISION DIAGRAMS; HEURISTIC ALGORITHMS; MODEL CHECKING;

MODULAR ROBOTS;

EID: 84880886485     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso. Planning in Nondeterministic Domains under Partial Observability via Symbolic Model Checking. In Proc. IJCAI-01. AAAI Press, 2001.
2. B. Bonet and H. Geffner. Planning with Incomplete Information as Heuristic Search in Belief Space. In Proc. AIPS-00, pages 52-61. AAAI Press, April 2000.
3. R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
4. A. Cimatti and M. Roveri. Conformant Planning via Symbolic Model Checking. Journal of Artificial Intelligence Research, 13:305-338, 2000. (Pubitemid 33682088)
5. A. Cimatti, E. Giunchiglia, F. Giunchiglia, and P. Traverso. Planning via Model Checking: A Decision Procedure for AR. In Proc. ECP-97, LNCS 1348, pages 130-142, Toulouse, France, September 1997. Springer-Verlag.
6. A. Cimatti, M. Roveri, and P. Traverso. Strong Planning in Non-Deterministic Domains via Model Checking. In Proc. AIPS-98, Pittsburgh, USA, June 1998. AAAI Press.
7. A. Cimatti, M. Roveri, and P. Bertoli. Searching Powerset Automata by Combining Explicit-State and Symbolic Model Checking. In Proc. TACAS 2001, pages 313-327. Springer, April 2001.
8. P. Ferraris and E. Giunchiglia. Planning as satisfiability in nondeterministic domains. In Proc. AAAI'00), Austin, Texas, July-August 2000. AAAI Press.
9. A. Finzi, F. Pirri, and R. Reiter. Open world planning in the situation calculus. In Proc. AAAI'00), Austin, Texas, July-August 2000. AAAI Press.
10. R.P. Goldman and M.S. Boddy. Expressive Planning and Explicit Knowledge. In Proc. AIPS-96, pages 110-117. AAAI Press, 1996.
11. F. Kabanza, M. Barbeau, and R. St-Denis. Planning control rules for reactive agents. Artificial Intelligence, 95(1):67-113, 1997. (Pubitemid 127402476)
12. Z. Kohavi. Switching and Finite Automata Theory. McGraw-Hill Book Company, New York, 1978. ISBN 0-07-035310-7.
13. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publ., 1993.
14. C. Pixley, S.-W. Jeong, and G. D. Hachtel. Exact calculation of synchronization sequences based on binary decision diagrams. In Proc. of the 29th Design Automation Conference, IEEE CS Press, 1992.
15. L. Pryor and G. Collins. Planning for Contingency: a Decision Based Approach. J. of Artificial Intelligence Research, 4:81-120, 1996.
16. J.-K. Rho, F. Somenzi, and C. Pixley. Minimum length synchronizing sequences of finite state machine. In Proc. of the 30th ACM/IEEE Design Automation Conference, pages 463-468, Dallas, TX, June 1993. ACM Press.
17. J. Rintanen. Constructing conditional plans by a theorem-prover. Journal of Artificial Intellegence Research, 10:323-352, 1999.
18. D. E. Smith and D. S. Weld. Conformant graphplan. In Proc. AAAI-98, pages 889-896, Menlo Park, July 26-30 1998. AAAI Press.
19. D. S. Weld, C. R. Anderson, and D. E. Smith. Extending graphplan to handle uncertainty and sensing actions. In Proc. AAAI-98, pages 897-904, Menlo Park, July 26-30 1998. AAAI Press.