Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy 
Compression

Boularias, A; Chaib-draa, B

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

http://icaps08.cecs.anu.edu.au/
(目次)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

ICAPS-2008-Boularias.pdf
(全文テキスト（全般）), 440KB

付随資料 (公開)

There is no public supplementary material available

引用

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.

引用: https://hdl.handle.net/11858/00-001M-0000-0013-C741-8

要旨

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.