Simple and fast strong cyclic planning for fully-observable nondeterministic planning problems

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 1949-1954

  Fu, Jicheng ^a   Ng, Vincent ^b   Bastani, Farokh B ^b   Yen, I Ling ^b  

^a UNIVERSITY OF CENTRAL OKLAHOMA   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CYCLIC SOLUTIONS; EFFICIENT PLANNING; NONDETERMINISTIC PLANNING; PLANNING PROBLEM; SEARCH DIRECTION;

ARTIFICIAL INTELLIGENCE;

EID: 84866458358     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-326     Document Type: Conference Paper

References (13)

1. D. Bryce and O. Buffet. 6th International Planning Competition: Uncertainty Part. In Proceedings of IPC, 2008.
2. D. Bryce and O. Buffet. International Planning Competition Uncertainty Part: Benchmarks and Results. In Proceedings of IPC, 2008.
3. A. Cimatti, M. Pistore, M. Roveri, and P. Traverso. Weak, strong, and strong cyclic planning via symbolic model checking. Artificial Intelligence, 147(1-2):35-84, 2003.
4. S. Edelkamp. Planning with pattern databases. In Proceedings of ECP, pages 13-24, 2001.
5. E. A. Hansen and S. Zilberstein. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129(1-2):35-62, 2001. (Pubitemid 32498415)
6. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14: 253-302, 2001.
7. P. Kissmann and S. Edelkamp. Solving fully-observable non-deterministic planning problems via translation into a general game. In Proceedings of KI, Vol. 5803 of LNCS, pages 1-8, Springer, 2009.
8. U. Kuter. Pushing the limits of AI planning. In Proceedings of ICAPS Doctoral Consortium, 2004.
9. U. Kuter and D. Nau. Forward-chaining planning in nondeterministic domains. In Proceedings of AAAI, pages 513-518, 2004.
10. U. Kuter, D. Nau, E. Reisner, and R. P. Goldman. Using classical planners to solve nondeterministic planning problems. In Proceedings of ICAPS, 2008.
11. H. Levesque. Planning with loops. In Proceedings of IJCAI, 509-515, 2005.
12. M. Magnusson and P. Doherty. Deductive planning with inductive loops. In Proceedings of KR, pages 528-534, 2008.
13. R. Mattmüller, M. Ortlieb, M. Helmert, and P. Bercher. Pattern database heuristics for fully observable nondeterministic planning. In Proceedings of ICAPS, pages 105-112, 2010.