Planning with first-order temporally extended goals using heuristic search

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 788-795

  Baier, Jorge A ^a   McIlraith, Sheila A ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PARAMETER ESTIMATION; PROBLEM SOLVING; SET THEORY;

HEURISTIC SEARCH; LINEAR TEMPORAL LOGIC; TEMPORALLY EXTENDED GOALS (TEG);

STRATEGIC PLANNING;

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

References (22)

1. F. Bacchus and M. Ady. Precondition control. Unpublished manuscript, 1999.
2. F. Bacchus and F. Kabanza. Planning for temporally extended goals. Annals Mathematics Artificial Intelligence, 22(1-2):5-27, 1998.
3. J. A. Baier and S. A. McIlraith. Planning with prepositional temporally extended goals using heuristic search. Technical Report CSRG-537, Department of Computer Science, University of Toronto, Toronto, Canada, 2006.
4. J. A. Baier and S. A. McIlraith. Planning with temporally extended goals using heuristic search. In Proc. of the 16th Intl. Conference on Automated Planning and Scheduling (ICAPS-06), 2006. To appear.
5. A. Blum and M. L. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2):281-300, 1997.
6. S. Cresswell and A. M. Coddington. Compilation of LTL goal formulas into PDDL. In R. L. de Mántaras and L. Saitta, editors, Proc. of the 16th European Conference on Artificial Intelligence (ECAI-04), pages 985-986, Valencia, Spain, August 2004. IOS Press.
7. M. Daniele, F. Giunchiglia, and M. Y. Vardi. Improved automata generation for linear temporal logic. In Proc. of the 11th Intl. Conference on Computer Aided Verification (CAV-99), volume 1633 of LAO, pages 249-260, Trento, Italy, 1999. Springer.
8. S. Edelkamp. On the compilation of plan constraints and preferences. In Proc. of the 16th Intl. Conference on Automated Planning and Scheduling (ICAPS-06), 2006. To appear.
9. K. Etessami and G. J. Holzmann. Optimizing Büchi automata. In Proc. of the 11th Intl. Conference on Concurrency Theory (CONCUR-00), volume 1877 of LNCS, pages 153-167, University Park, PA, August 2000. Springer.
10. C. Fritz. Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata. In Proc. of the 8th Intl. Conference on Implementation and Application of Automata (CIAA-03), volume 2759 of LNCS, pages 35-48, Santa Barbara, CA, 2003. Springer.
11. A. Gerevini and D. Long. Plan constraints and preferences for PDDL3. Technical Report 2005-08-07, Department of Electronics for Automation, University of Brescia, Brescia, Italy, 2005.
12. R. Gerth, D. Peled, M. Y. Vardi, and P. Wolper. Simple onthe-fly automatic verification of linear temporal logic. In Proc. of the 15th Intl. Symposium on Protocol Specification, Testing and Verification (PSTV-95), pages 3-18, Warsaw, Poland, July 1995.
13. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253-302, 2001.
14. F. Kabanza and S. Thiébaux. Search control in planning for temporally extended goals. In Proc. of the 15th Intl. Conference on Automated Planning and Scheduling (ICAPS-05), Monterey, CA, USA, June 2005.
15. J. Kvarnström and P. Doherty. Talplanner: A temporal logic based forward chaining planner. Annals of Mathematics Artificial Intelligence, 30(1-4):119-169, 2000.
16. U. D. Lago, M. Pistore, and P. Traverso. Planning with a language for extended goals. In Proc. of AAAI/IAAI, pages 447-454, Edmonton, Alberta, Canada, 2002.
17. E. P. D. Pednault. ADL: Exploring the middle ground between STRIPS and the situation calculus. In Proc. of the 1st International Conference of Knowledge Representation and Reasoning (KR-89), pages 324-332, Toronto, Canada, May 1989.
18. M. Pistore, R. Bettin, and P. Traverso. Symbolic techniques for planning with extended goals in non-deterministic domains. In Proc. of the 6th European Conference on Planning (ECP-01), Toledo, Spain, 2001.
19. A. Pnueli. The temporal logic of programs. In Proc. of the 18th IEEE Symposium on Foundations of Computer Science (FOCS-77), pages 46-57, 1977.
20. J. Rintanen. Incorporation of temporal logic control into plan operators. In W. Horn, editor, Proc. of the 14th European Conference on Artificial Intelligence (ECAI-00), pages 526-530, Berlin, Germany, August 2000. IDS Press.
21. S. Thiébaux, J. Hoffmann, and B. Nebel. In defense of PDDL axioms. Artificial Intelligence, 168(1-2):38-69, 2005.
22. M. Y. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115(1):1-37, 1994.