Online Planning in Multiagent Expedition with Graphical Models

The Atrium, University of Guelph Institutional Repository

Online Planning in Multiagent Expedition with Graphical Models

Show simple item record

dc.contributor.advisor Xiang, Yang
dc.contributor.author Hanshar, Franklin
dc.date 2011-10-28
dc.date.accessioned 2011-12-14T19:30:25Z
dc.date.available 2011-12-14T19:30:25Z
dc.date.issued 2011-12-14
dc.identifier.uri http://hdl.handle.net/10214/3191
dc.description.abstract This dissertation proposes a suite of novel approaches for solving multiagent decision and optimization problems based on the Collaborative Design Network (CDN), a framework for multiagent decision making. The framework itself is distributed, decision-theoretic and was originally proposed for multiagent component-centred design. This application is a novel use of the CDN, and demonstrate the generality of the CDN framework for general decision-theoretic planning. First, the framework is applied towards tackling a multiagent decision problem outside of collaborative design called multiagent expedition (MAE), a testbed problem which abstracts many of the features of real-world multiagent decision-making problems. We formally introduce MAE, and show it to be a subclass of a decentralized partially observable Markov Decision process (Dec-POMDP). We apply the CDN to the online MAE planning problem. We demonstrate that the CDN can plan in MAE with conditional optimality given a set of basic assumptions on the structure and organization of the agent team. We introduce a set of knowledge representational aspects to achieve conditionally optimal planning. We experimentally verify our approach on a series of benchmark problems created for this dissertation to test the various aspects of our CDN solution. We also investigate further methods for scalability and speedup in MAE. The concept of \emph{partial evaluation} (PE) is introduced, based on the assumption that an agent has an intended effect given an agent's action and considers all other effects unintended. This assumption is used to derive a bound for planning that partitions the set of joint plans into a set of fully evaluated and a set of partial evaluated plans. Plans which are partially evaluated can significantly speed up planning in the centralized case. PE is also applied to the CDN, to both public decisions between agents and private decisions local to an agent. We demonstrate that applying PE to public decisions in the CDN results in either intractable communication or suboptimal planning. When applied to private decisions, we show PE can still be very effective in decreasing planning runtime. en_US
dc.language.iso en en_US
dc.subject graphical models en_US
dc.subject uncertain reasoning en_US
dc.subject multiagent systems en_US
dc.title Online Planning in Multiagent Expedition with Graphical Models en_US
dc.type Thesis en_US
dc.degree.programme Computer Science en_US
dc.degree.name Doctor of Philosophy en_US
dc.degree.department Department of Computing and Information Science en_US


Files in this item

Files Size Format View
PhDHansharDec14.pdf 2.453Mb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search the Atrium


Advanced Search

Browse

My Account