DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiagent expedition. A typical instance consists of an area populated by mobile agents. Agents have no prior knowledge of the area, have limited sensing and communication, and effects of their actions are uncertain. Success relies on planing actions that result in high accumulated rewards. We solve an instance of multiagent expedition based on collaborative design network, a decision theoretic multiagent graphical model. We present a number of techniques employed in knowledge representation and demonstrate the superior performance of our system in comparison to greedy agents experimentally. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Xiang, Y., & Hanshar, F. (2007). Planning in multiagent expedition with collaborative design networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4509 LNAI, pp. 526–538). Springer Verlag. https://doi.org/10.1007/978-3-540-72665-4_45
Mendeley helps you to discover research relevant for your work.