Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Scalable accelerated decentralized multi-robot policy search in continuous observation spaces

Scalable accelerated decentralized multi-robot policy search in continuous observation spaces

Thumbnail Image
Download
Name

1703.05626.pdf

Size

3.48 MB

Format

Adobe PDF

Checksum (MD5)

ce35fbd3b3bd3949575719e9d378f38f

Download all files submitted through automated deposit
sword-2018-03-21.original.zip (3.28 MB)
Author(s)
Amato, Christopher
•
Liu, Miao
•
Vian, John
•
Omidshafiei, Shayegan
•
Everett, Michael F
•
How, Jonathan P
Date Issued
July 2017
Journal
2017 IEEE International Conference on Robotics and Automation (ICRA)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Omidshafiei, Shayegan, Christopher Amato, Miao Liu, Michael Everett, Jonathan P. How, and John Vian. “Scalable Accelerated Decentralized Multi-Robot Policy Search in Continuous Observation Spaces.” 2017 IEEE International Conference on Robotics and Automation (ICRA), May 2017, Singapore, Singapore, 2017.
Version
Original manuscript
Abstract
This paper presents the first ever approach for solving continuous-observation Decentralized Partially Observable Markov Decision Processes (Dec-POMDPs) and their semi-Markovian counterparts, Dec-POSMDPs. This contribution is especially important in robotics, where a vast number of sensors provide continuous observation data. A continuous-observation policy representation is introduced using Stochastic Kernel-based Finite State Automata (SK-FSAs). An SK-FSA search algorithm titled Entropy-based Policy Search using Continuous Kernel Observations (EPSCKO) is introduced and applied to the first ever continuous-observation Dec-POMDP/Dec-POSMDP domain, where it significantly outperforms state-of-the-art discrete approaches. This methodology is equally applicable to Dec-POMDPs and Dec-POSMDPs, though the empirical analysis presented focuses on Dec-POSMDPs due to their higher scalability. To improve convergence, an entropy injection policy search acceleration approach for both continuous and discrete observation cases is also developed and shown to improve convergence rates without degrading policy quality.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Department of Mechanical Engineering
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
http://hdl.handle.net/1721.1/114736
DOI of Published Version
https://doi.org/10.1109/ICRA.2017.7989106
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.