Fast planning by search in domain transition graph

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2008, Pages 886-891

  Chen, Yixin ^a   Huang, Ruoyun ^a   Zhang, Weixiong ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; COMPUTATIONAL METHODS; HEURISTIC METHODS; PLANNING;

CAUSAL GRAPHS; CLASSICAL PLANNING; DO-MAINS; DOMAIN STRUCTURES; HEURISTIC SEARCHES; INTERNATIONAL PLANNING COMPETITIONS; TRANSITION GRAPHS; TRANSITION STRUCTURES; VITAL INFORMATIONS;

SYNTHETIC APERTURE SONAR;

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

References (7)

1. Bäckström, C., and Nebel, B. 1995. Complexity results for SAS+ planning. Computational Intelligence 11:17-29.
2. Chen, Y.; Zhao, X.; and Zhang, W. 2007. Long distance mutual exclusion for propositional planning. In Proc. of International Joint Conference on Artificial Intelligence, 1840-1845.
3. Helmert, M. 2006. The Fast Downward planning system. Journal of Artificial Intelligence Research 26:191-246.
4. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
5. Jonsson, P., and Bäckström, C. 1998. State-variable planning under structural restrictions: Algorithms and complexity. Artificial Intelligence 100(1-2): 125-176.
6. Koehler, J., and Hoffmann, J. 2000. On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research 12:338-386.
7. van den Briel, M.: Benton, J.: Kambhampati. S.: and Vossen, T. 2007. An LP-based heuristic for optimal planning. In Proc. Constraint Programming Conference.