Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs

Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs

Full Text:

PDF

Buy this Article

Authors:	Jilles S. Dibangoye	University of Caen, Caen, France
	Abdel-Illah Mouaddib	University of Caen, Caen, France
	Brahim Chai-draa	Laval University, Québec, Qc, Canada

Published in:

	· Proceeding
	AAMAS '09 Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
	International Foundation for Autonomous Agents and Multiagent Systems Richland, SC ©2009 table of contents ISBN: 978-0-9817381-6-1

	2009 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 29 · Citation Count: 5

Tools and Resources

Buy this Article
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Tags: algorithms artificial intelligence branch-and-bound decentralized pomdps distributed artificial intelligence experimentation performance planning under uncertainty point-based solver

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player