Safe LTL assumption-based planning

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 193-202

  Albore, Alexandre ^a   Bertoli, Piergiorgio ^b  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EFFICIENCY; LOGIC PROGRAMMING; MONITORING; SAFETY FACTOR; SCHEDULING;

ASSUMPTION-BASED PLANS; NONDETERMINISTIC DOMAINS; PLAN GENERATION; RUNTIME FAILURES;

STRATEGIC PLANNING;

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

References (17)

1. A. Albore and P. Bertoli. Generating Safe Assumption-Based Plans for Partially Observable, Nondeterministic Domains. In Proc. of AAAI'04, pages 495-500, 2004.
2. F. Bacchus and F. Kabanza. Using Temporal Logic to Express Search Control Knowledge for Planning. Artificial Intelligence, 116(1-2): 123-191, 2000.
3. P. Bertoli, A. Cimatti, and M. Roveri. Conditional Planning under Partial Observability as Heuristic-Symbolic Search in Belief Space. In Proc. of 6th European Conference on Planning (ECP'01), 2001.
4. B. Bonet and H. Geffner. Planning with Incomplete Information as Heuristic Search in Belief Space. In Proc. of Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000), pages 52-61, 2000.
5. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
6. D. Calvanese, G. De Giacomo, and M. Y. Vardi. Reasoning about actions and planning in LTL action theories. In Proc. of the 8th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2002), pages 593-602, 2002.
7. A. Cimatti, C. Pecheur, and R. Cavada. Formal Verification of Diagnosability via Symbolic Model Checking. In Proc. of 18th International Joint Conference on Artificial Intelligence (IJCAI-03), 2003.
8. E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science. Elsevier, 1990.
9. R. Hähnle and O. Ibens. Improving temporal logic tableaux using integer constraints. In Proc. of the First International Conference on Temporal Logic (ICTL '94), pages 535-539, London, UK, 1994. Springer-Verlag.
10. S. Jiang and R. Kumar. Failure Diagnosis of discrete event systems with Linear-time Temporal Logic fault specifications. IEEE Transactions on Automatic Control, 49(6):934-945, 2004.
11. F. Kabanza, M. Barbeau, and R. St-Denis. Planning Control Rules for Reactive Agents. Artificial Intelligence, 95(1):67-113, 1997.
12. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.
13. N. Muscettola, P. P. Nayak, B. Pell, and B. C. Williams. Remote agent: To boldly go where no AI system has gone before. Artificial Intelligence, 103(1-2):5-47, 1998.
14. K. L. Myers and D. E. Wilkins. Reasoning about locations in theory and practice. Computational Intelligence, 14(2):151-187, 1998.
15. J. Rintanen. Backward plan construction for planning with partial observability. In Proc. of 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS02), pages 73-182, 2002.
16. M. Sampath, R. Sengupta, S. Lafortune, K. Sinnamohideen, and D. Teneketzis. Diagnosability of discrete event systems. IEEE Transactions on Automatic Control, 40(9):1555-1575, 1995.
17. D. Weld, C. Anderson, and D. Smith. Extending Graphplan to Handle Uncertainty and Sensing Actions. In Proc. of AAAI'98, pages 897-904, 1998.