Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Modeling and Planning with Macro-Actions in Decentralized POMDPs

Modeling and Planning with Macro-Actions in Decentralized POMDPs

Thumbnail Image
Download
Name

nihms-1054659.pdf

Description
Accepted version
Size

2.15 MB

Format

Adobe PDF

Checksum (MD5)

64089b421155a291a109f2eb91d36ccc

sword-2020-12-22T18:27:57.original.xml (130 B)
Original SWORD entry document
Author(s)
Amato, Christopher
•
Konidaris, George
•
Kaelbling, Leslie P
•
How, Jonathan P
Date Issued
2019
Journal
Journal of Artificial Intelligence Research
Publisher
AI Access Foundation
Version
Author's final manuscript
Abstract
© 2019 AI Access Foundation. All rights reserved. Decentralized partially observable Markov decision processes (Dec-POMDPs) are general models for decentralized multi-agent decision making under uncertainty. However, they typically model a problem at a low level of granularity, where each agent’s actions are primitive operations lasting exactly one time step. We address the case where each agent has macro-actions: temporally extended actions that may require different amounts of time to execute. We model macro-actions as options in a Dec-POMDP, focusing on actions that depend only on information directly available to the agent during execution. Therefore, we model systems where coordination decisions only occur at the level of deciding which macro-actions to execute. The core technical difficulty in this setting is that the options chosen by each agent no longer terminate at the same time. We extend three leading Dec-POMDP algorithms for policy generation to the macro-action case, and demonstrate their effectiveness in both standard benchmarks and a multi-robot coordination problem. The results show that our new algorithms retain agent coordination while allowing high-quality solutions to be generated for significantly longer horizons and larger state-spaces than previous Dec-POMDP methods. Furthermore, in the multi-robot domain, we show that, in contrast to most existing methods that are specialized to a particular problem class, our approach can synthesize control policies that exploit opportunities for coordination while balancing uncertainty, sensor information, and information about other agents.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/132314
DOI of Published Version
https://doi.org/10.1613/JAIR.1.11418
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.