Finite-state controllers based on Mealy machines for centralized and decentralized POMDPs

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2010, Pages 1052-1058

  Amato, Christopher ^a   Bonet, Blai ^b   Zilberstein, Shlomo ^a  

^a University of Massachusetts Amherst   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONTROLLERS;

BENCHMARK DOMAINS; CURRENT CONTROLLER; EXISTING CONTROLLERS; FINITE-STATE CONTROLLERS; MEALY MACHINES; MOORE MACHINES; SOLUTION METHODS; STATE-OF-THE-ART ALGORITHMS;

SEQUENTIAL MACHINES;

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

References (21)

1. Amato, C, and Zilberstein, S. 2009. Achieving goals in decentralized POMDPs. In Proceedings of the Eighth International Joint Conference on Autonomous Agents and Multiagent Systems, 593-600.
2. Amato, C; Bernstein, D. S.; and Zilberstein, S. 2009. Optimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPs. Journal of Autonomous Agents and Multi-Agent Systems DOI: 10.1007/s 10458-009-9103-z.
3. Bernstein, D. S.; Amato, C; Hansen, E. A.; and Zilberstein, S. 2009. Policy iteration for decentralized control of Markov decision processes. Journal of AI Research 34:89-132.
4. Bernstein, D. S.; Hansen, E. A.; and Zilberstein, S. 2005. Bounded policy iteration for decentralized POMDPs. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, 1287-1292.
5. Bonet, B., andGeffner, H. 2009. Solving POMDPs: RTDP-Bel bs. point-based algorithms. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, 1641-1646.
6. Bonet, B.; Palacios, H.; and Geffner, H. 2009. Automatic derivation of memoryless policies and finite-state controllers using classical planners. In Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling, 34-41.
7. Cassandra, A. R. 1998. Exact and Approximate Algorithms for Partially Observable Markov Decision Processes. Ph.D. Dissertation, Brown University, Providence, RI.
8. Hansen, E. A. 1998. Solving POMDPs by searching in policy space. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 211-219.
9. Hopcroft, J. E., and Ullman, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley.
10. Ji, S.; Parr, R.; Li, H.; Liao, X.; and Carin, L. 2007. Point-based policy iteration. In Proceedings of the Twenty-Second National Conference on Artificial Intelligence, 1243-1249.
11. Madani, O.; Hanks, S.; and Condon, A. 2003. On the undecid-ability of probabilistic planning and related stochastic optimization problems. Artificial Intelligence 147:5-34.
12. Meuleau, N.; Kim, K.-E.; Kaelbling, L. P.; and Cassandra, A. R. 1999. Solving POMDPs by searching the space of finite policies. In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, 417-426.
13. Pineau, J.; Gordon, G.; and Thrun, S. 2003. Point-based value iteration: an anytime algorithm for POMDPs. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, 1025-1032.
14. Poupart, P., and Boutilier, C. 2003. Bounded finite state controllers. In Advances in Neural Information Processing Systems, 16. 823-830.
15. Poupart, P. 2005. Exploiting Structure to Efficiently Solve Large Scale Partially Observable Markov Decision Processes. Ph.D. Dissertation, University of Toronto.
16. Seuken, S., and Zilberstein, S. 2007. Improved memory-bounded dynamic programming for decentralized POMDPs. In Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence, 344-351.
17. Singh, S.; Jaakkola, T; and Jordan, M. 1994. Learning without state-estimation in partially observable Markovian decision processes. In Proceedings of the Eleventh International Conference on Machine Learning, 284-292.
18. Smith, T, and Simmons, R. 2005. Point-based POMDP algorithms: Improved analysis and implementation. In Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence, 542-549.
19. Sondik, E. J. 1978. The optimal control of partially observable Markov processes over the infinite horizon: Discounted costs. Operations Research 26:282-304.
20. Spaan, M. T. J., and Vlassis, N. 2005. Perseus: Randomized point-based value iteration for POMDPs. Journal of AI Research 24:195-220.
21. Szer, D., and Charpillet, F. 2005. An optimal best-first search algorithm for solving infinite horizon DEC-POMDPs. In Proceedings of the Sixteenth European Conference on Machine Learning, 389-399.