Periodic finite state controllers for efficient POMDP and DEC-POMDP planning

Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011, NIPS 2011

Volumn , Issue , 2011, Pages

  Pajarinen, Joni ^a   Peltonen, Jaakko ^a  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE SEGMENTATION; MARKOV PROCESSES; MULTI AGENT SYSTEMS; ROBOT PROGRAMMING; STOCHASTIC SYSTEMS;

CONTROL COMMUNICATIONS; DETERMINISTICS; FINITE-STATE CONTROLLERS; INFINITE HORIZONS; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; PLANNING UNDER UNCERTAINTY; PROCESS PLAN; ROBOTS CONTROL; SINGLE-AGENT; WIRELESS COMMUNICATIONS;

MAXIMUM PRINCIPLE;

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

References (18)

1. R. D. Smallwood and E. J. Sondik. The optimal control of partially observable Markov processes over a finite horizon. Operations Research, pages 1071-1088, 1973.
2. S. Seuken and S. Zilberstein. Formal models and algorithms for decentralized decision making under uncertainty. Autonomous Agents and Multi-Agent Systems, 17(2):190-250, 2008.
3. H. Kurniawati, D. Hsu, and W.S. Lee. Sarsop: Efficient point-based pomdp planning by approximating optimally reachable belief spaces. In Proc. Robotics: Science and Systems, 2008.
4. S. Seuken and S. Zilberstein. Memory-bounded dynamic programming for DEC-POMDPs. In Proc. of 20th IJCAI, pages 2009-2016.Morgan Kaufmann, 2007.
5. F. Wu, S. Zilberstein, and X. Chen. Point-based policy generation for decentralized POMDPs. In Proc. of 9th AAMAS, pages 1307-1314. IFAAMAS, 2010.
6. P. Poupart and C. Boutilier. Bounded finite state controllers. Advances in neural information processing systems, 16:823-830, 2003.
7. M. Toussaint, S. Harmeling, and A. Storkey. Probabilistic inference for solving (PO)MDPs. Technical report, University of Edinburgh, 2006.
8. C. Amato, D. Bernstein, and S. Zilberstein. Optimizing Memory-Bounded Controllers for Decentralized POMDPs. In Proc. of 23rd UAI, pages 1-8. AUAI Press, 2007.
9. A. Kumar and S. Zilberstein. Point-Based Backup for Decentralized POMDPs: Complexity and New Algorithms. In Proc. of 9th AAMAS, pages 1315-1322. IFAAMAS, 2010.
10. Joni Pajarinen and Jaakko Peltonen. Efficient Planning for Factored Infinite-Horizon DECPOMDPs. In Proc. of 22nd IJCAI, pages 325-331. AAAI Press, July 2011.
11. D. S. Bernstein, R. Givan, N. Immerman, and S. Zilberstein. The Complexity of Decentralized Control of Markov Decision Processes. Mathematics of Operations Research, 27(4):819-840, 2002.
12. A. Kumar and S. Zilberstein. Anytime Planning for Decentralized POMDPs using Expectation Maximization. In Proc. of 26th UAI, 2010.
13. D.S. Bernstein, E.A. Hansen, and S. Zilberstein. Bounded policy iteration for decentralized POMDPs. In Proc. of 19th IJCAI, pages 1287-1292.Morgan Kaufmann, 2005.
14. D. Szer and F. Charpillet. An optimal best-first search algorithm for solving infinite horizon DEC-POMDPs. Proc. of 16th ECML, pages 389-399, 2005.
15. C. Amato and S. Zilberstein. Achieving goals in decentralized POMDPs. In Proc. of 8th AAMAS, volume 1, pages 593-600. IFAAMAS, 2009.
16. C. Amato, B. Bonet, and S. Zilberstein. Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs. In Proc. of 24th AAAI, 2010.
17. S. Ji, R. Parr, H. Li, X. Liao, and L. Carin. Point-based policy iteration. In Proc. of 22nd AAAI, volume 22, page 1243, 2007.
18. F.A. Oliehoek, M.T.J. Spaan, and N. Vlassis. Optimal and approximate q-value functions for decentralized pomdps. Journal of Artificial Intelligence Research, 32(1):289-353, 2008.