Stochastic local search for POMDP controllers

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 690-696

  Braziunas, Darius ^a   Boutilier, Craig ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION SPACES; PARTIALLY OBSERVABLE MARKOV DECISION PROCESSES (POMDP); PRECISE SEQUENCES; RESTRICTED SPACES;

ALGORITHMS; COMPUTATIONAL METHODS; DECISION MAKING; DYNAMIC PROGRAMMING; HEURISTIC METHODS; MATHEMATICAL MODELS;

MARKOV PROCESSES;

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

References (18)

1. Douglas Aberdeen and Jonathan Baxter. Scalable internal-state policy-gradient methods for POMDPs. In Proc. of ML-02, pages 3-10, 2002.
2. Craig Boutilier. A POMDP formulation of preference elicitation problems. In Proc. of AAAI-2002, pages 239-246, Edmonton, 2002.
3. Anthony R. Cassandra. Exact and Approximate Algorithms for Partially Observable Markov Decision Processes. PhD thesis, Brown University, Providence, RI, 1998.
4. Anthony R. Cassandra, Leslie Pack Kaelbling, and Michael L. Littman. Acting optimally in partially observable stochastic domains. In Proc. of AAAI-94, pages 1023-1028, Seattle, 1994.
5. Anthony R. Cassandra, Michael L. Littman, and Nevin L. Zhang. Incremental pruning: A simple, fast, exact method for POMDPs. In Proc. of UAI-97, pages 54-61, Providence, RI, 1997.
6. Hector Geffner and Blai Bonet. Solving large POMDPs by real time dynamic programming. In Working Notes, Fall AAAI Symposium on POMDPs, 1998.
7. Fred Glover. Tabu search - part I. ORSA Journal on Computing, 1(3):190-206, 1989.
8. Eric A. Hansen. Solving POMDPs by searching in policy space. In Proc. of UAI-98, pages 211-219, Madison, WI, 1998.
9. Holger H. Hoos. Stochastic Local Search - Methods, Models, Applications. PhD thesis, TU Darmstadt, Darmstadt, Germany, 1998.
10. Michael L. Littman. Memoryless policies: Theoretical limitations and practical results. In Dave Cliff, Philip Husbands, Jean-Arcady Meyer, and Stewart W. Wilson, editors, Proceedings of the Third International Conference on Simulation of Adaptive Behavior, Cambridge, MA, 1994. The MIT Press.
11. Michael L. Littman, Anthony R. Cassandra, and Leslie Pack Kaelbling. Learning policies for partially observable environments: Scaling up. In Proc. of ML-95, pages 362-370, Lake Tahoe, 1995.
12. Nicolas Meuleau, Kee-Eung Kim, Leslie Pack Kaelbling, and Anthony R. Cassandra. Solving POMDPs by searching the space of finite policies. In Proc. of UAI-99, pages 417-426, Stockholm, 1999.
13. Nicolas Meuleau, Leonid Peshkin, Kee-Eung Kim, and Leslie Pack Kaelbling. Learning finite-state controllers for partially observable environments. In Proc. of UAI-99, pages 427-436, Stockholm, 1999.
14. Joelle Pineau, Geoff Gordon, and Sebastian Thrun. Point-based value iteration: An anytime algorithm for POMDPs. In Proc. of IJCAI-03, pages 1025-1030, Acapulco, 2003.
15. Pascal Poupart and Craig Boutilier. Bounded finite state controllers. In Advances in Neural Information Processing Systems 16 (NIPS-2003), Vancouver, 2003.
16. Richard D. Smallwood and Edward J. Sondik. The optimal control of partially observable Markov processes over a finite horizon. Operations Research, 21:1071-1088, 1973.
17. Matthijs T. J. Spaan and Nikos Vlassis. A point-based POMDP algorithm for robot planning. In IEEE International Conference on Robotics and Automation, New Orleans, 2004. to appear.
18. Marco Wiering and Juergen Schmidhuber. HQ-learning. Adaptive Behavior, 6(2):219-246, 1997.