English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression

Boularias, A., & Chaib-draa, B. (2008). Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression. In J. Rintanen, B. Nebel, J. Beck, & E. Hansen (Eds.), Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008) (pp. 20-27). Menlo Park, CA, USA: AAAI Press.

Item is

 

show all hide all

Basic

show hide
Item Permalink: http://hdl.handle.net/11858/00-001M-0000-0013-C741-8 Version Permalink: http://hdl.handle.net/21.11116/0000-0003-385C-8
Genre: Conference Paper

Files

show Files
hide Files
:
ICAPS-2008-Boularias.pdf (Any fulltext), 440KB
View   Save
File Permalink:
http://hdl.handle.net/21.11116/0000-0003-3857-D
Name:
ICAPS-2008-Boularias.pdf
Description:
-
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show
hide
Locator:
http://icaps08.cecs.anu.edu.au/ (Table of contents)
Description:
-

Creators

show
hide
 Creators:
Boularias, A1, Author              
Chaib-draa, B, Author
Affiliations:
1External Organizations, ou_persistent22              

Content

show
hide
Free keywords: -
 Abstract: High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a probability distribution over the system states and the policies of other agents. Belief compression is an efficient POMDP approach that speeds up planning algorithms by projecting the belief state space to a low-dimensional one. In this paper, we introduce a new method for solving DEC-POMDP problems, based on the compression of the policy belief space. The reduced policy space contains sequences of actions and observations that are linearly independent. We tested our approach on two benchmark problems, and the preliminary results confirm that Dynamic Programming algorithm scales up better when the policy belief is compressed.

Details

show
hide
Language(s):
 Dates: 2008-09
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: 6828
 Degree: -

Event

show
hide
Title: Eighteenth International Conference on Automated Planning and Scheduling (ICAPS '08)
Place of Event: Sydney, Australia
Start-/End Date: 2008-09-14 - 2008-09-18

Legal Case

show

Project information

show

Source 1

show
hide
Title: Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008)
Source Genre: Proceedings
 Creator(s):
Rintanen, J, Editor
Nebel, B, Editor
Beck, JC, Editor
Hansen, EA, Editor
Affiliations:
-
Publ. Info: Menlo Park, CA, USA : AAAI Press
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 20 - 27 Identifier: -