REVIEW 1 cited by
MAA*: A Heuristic Search Algorithm for Solving Decentralized POMDPs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We present multi-agent A* (MAA*), the first complete and optimal heuristic search algorithm for solving decentralized partially-observable Markov decision problems (DEC-POMDPs) with finite horizon. The algorithm is suitable for computing optimal plans for a cooperative group of agents that operate in a stochastic environment such as multirobot coordination, network traffic control, `or distributed resource allocation. Solving such problems efiectively is a major challenge in the area of planning under uncertainty. Our solution is based on a synthesis of classical heuristic search and decentralized control theory. Experimental results show that MAA* has significant advantages. We introduce an anytime variant of MAA* and conclude with a discussion of promising extensions such as an approach to solving infinite horizon problems.
Forward citations
Cited by 1 Pith paper
-
A Deep Actor-Critic Reinforcement Learning Framework for Dynamic Multichannel Access
An actor-critic reinforcement learning framework for dynamic multichannel access matches or beats DQN in simulations, scales to 64 channels, and supports decentralized multi-user decisions without information exchange.
Discussion (0). Continue with ORCID to comment.