Automatic derivation of memoryless policies and finite-state controllers using classical planners

ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2009, Pages 34-41

  Bonet, Blai ^a   Palacios, Héctor ^a   Geffner, Héctor ^b  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION EFFECT; ACTION SELECTION MECHANISM; AUTOMATIC DERIVATION; CONFORMANT PLANNING; CONTROLLER STATE; FINITE-STATE; FINITE-STATE CONTROLLERS; FLUENTS; INITIAL SITUATION; MEMORYLESS; MEMORYLESS POLICY; MOBILE ROBOTIC;

PLANNING; SCHEDULING;

CONTROLLERS;

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

References (22)

1. Amato, C.; Bernstein, D.; and Zilberstein, S. 2007. Optimizing memory-bounded controllers for decentralized pomdps. In Proc. UAI.
2. Ballard, D.; Hayhoe, M.; Pook, P.; and Rao, R. 1997. Deictic codes for the embodiment of cognition. Behavioral and Brain Sciences 20(04):723-742.
3. Buckland, M. 2004. Programming Game AI by Example. Wordware Publishing, Inc.
4. Chapman, D. 1989. Penguins can make cake. AI magazine 10(4):45-50.
5. Connell, J. H. 1990. Minimalist Mobile Robotics. Morgan Kaufmann.
6. Hansen, E. 1998. Solving POMDPs by searching in policy space. In Proc. UAI, 211-219.
7. Hoffmann, J., and Brafman, R. 2005. Contingent planning via heuristic forward search with implicit belief states. In Proc. ICAPS, 71-80.
8. Hoffmann, J.; Gomes, C.; Selman, B.; and Kautz, H. A. 2007. SAT encodings of state-space reachability problems in numeric domains. In Proc. IJCAI, 1918-1923.
9. Hopcroft, J., and Ullman, J. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
10. Kaelbling, L. P.; Littman, M.; and Cassandra, A. R. 1999. Planning and acting in partially observable stochastic domains. Artif. Intell. 101:99-134.
11. Kautz, H., and Selman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. AAAI, 1194-1201.
12. Levesque, H. 1996. What is planning in the presence of sensing? In Proc. AAAI, 1139-1146.
13. Levesque, H. 2005. Planning with loops. In Proc. IJCAI, 509-515.
14. Littman, M. L. 1994. Memoryless policies: Theoretical limitations and practical results. In Cliff, D., ed., From Animals to Animats 3. MIT Press.
15. Mataric, M. J. 2007. The Robotics Primer. MIT Press.
16. Meuleau, N.; Peshkin, L.; Kim, K.; and Kaelbling, L. P. 1999. Learning finite-state controllers for partially observable environments. In Proc. UAI, 427-436.
17. Murphy, R. R. 2000. An Introduction to AI Robotics. MIT Press.
18. Palacios, H., and Geffner, H. 2007. From conformant into classical planning: Efficient translations that may be efficient too. In Proc. ICAPS, 264-271.
19. Poupart, P., and Boutilier, C. 2003. Bounded finite state controllers. In Proc. NIPS, 823-830.
20. Richter, S.; Helmert, M.; and Westphal, M. 2008. Landmarks revisited. In Proc. AAAI, 975-982.
21. Sardina, S.; Giacomo, G. D.; Lesperance, Y.; and Levesque, H. 2006. On the limits of planning over belief states. In Proc. KR, 463-471.
22. Thiébaux, S.; Hoffmann, J.; and Nebel, B. 2005. In defense of PDDL axioms. Artif. Intell. 168(1-2):38-69.