Strong Planning in Non-Deterministic Domains via Model Checking

Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems, AIPS 1998

Volumn , Issue , 1998, Pages 36-43

  Cimatti, Alessandro ^a   Roveri, Marco ^a   Traverso, Paolo ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DETERMINISTIC DOMAINS; DETERMINISTICS; MODEL-CHECKING TECHNIQUES; MODELS CHECKING; NON DETERMINISM; OPTIMAL PLAN; REAL-WORLD; VIA MODELING;

MODEL CHECKING;

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

References (20)

1. Beetz, M., and McDermott, D. 1994. Improving Robot Plans During Their Execution. In Proc. of AIPS-9.
2. Bryant, R. E. 1992. Symbolic Boolean manipolation with ordered binary-decision diagrams. A CMComputing Surveys 24(3):293-318.
3. Burch, J. R.; Clarke, E. M.; McMillan, K. L.; Dill, D. L.; and Hwang,L. J. 1992. Symbolic ModelChecking: 1020 States and Beyond. Information and Computation 98(2):142-170.
4. Cimatti, A.; Giunchiglia, E.; Giunchiglia, F.; and Traverso, P. 1997. Planning via Model Checking: A Decision Procedure for ATe. In Proc. o] ECP-97.
5. Cimatti, A.; Roveri, M.; and Traverso, P. 1998a. Automatic OBDD-basedGeneration of Universal Plans in Non-Deterministic Domains. To appear in Proc. of AAAI-98.
6. Cimatti, A.; Roveri, M.; and Iaverso, P. 1998b. Strong Planning in Non-Deterministic Domains via Model Checking. Technical Report 9801-07, IRST, Trento, Italy. Extendedversion of this paper.
7. Clarke, E.; Grunberg, 0.; and Long, D. 1994. Modelchecking. In Proc. of the International Summer School on Deductive ProgramDesign, Marktoberdorf.
8. Fikes, ft. E., and Nilsson, N. J. 1971. STRIPS: A newapproach to the application of TheoremProving to ProblemSolving. Artificial Intelligence 2(3-4):189-208.
9. Firby, ft. J. 1987. An Investigation into Reactive Planning in Complex Domains. In Proc. of AAAI-8?, 202-206.
10. Georgetf, M., and Lansky, A. L. 1986. Procedural knowledge. Proc. of IEEE 74(10):1383-1398.
11. Giunchiglia, E.; Kartha, G. N.; and Lifschitz, V. 1997. ftepresenting action: Indeterminacy and ramifications. Artificial Intelligence 95(2):409-438.
12. Harel, D. 1984. DynamicLogic. In Gabbay, D., and Guenthner, F., eds., Handbookof Philosophical Logic, volume II. D. Reidel Publishing Company.497-604.
13. Koenig, S., and Simmons,ft. 1995. Real-Time Search in Non-Deterministic Domains. In Proc. of IJCAI-gS, 1660-1667.
14. Penberthy, J., and Weld, D. 1992. UCPOP:A sound, complete, partial order planner for adl. In Proc. of KR-9.
15. Peot, M., and Smith, D. 1992. Conditional Nonlinear Planning. In Proc. of AIPS-9, 189-197.
16. Schoppers, M. J. 1987. Universal plans for Reactive Robots in Unpredictable Environments. In Proc. of the IOth International Joint Conference on Artificial Intelligence, 1039-1046.
17. Simmons, R. 1990. An Architecture for Coordinating Planning, Sensing and Action. In Proceedings of the Workshopon Innovative Approaches to Planning, Scheduling and Control, 292-297.
18. Steel, S. 1994. Action under Uncertainty. J. Logic and Computation, Special Issue on Action and Processes 4(5):777-795.
19. Stephan, W., and Biundo, S. 1993. A New Logical Framework for Deductive Planning. In Proc.lJCAI-93, 32-38. Morgan Kaufmann.
20. Warren, D. 1976. Generating Conditional Plans and Programs. In Proc. of AISB-76.