Decentralized stochastic planning with anonymity in interactions
In this paper, we solve cooperative decentralized stochastic planning problems, where the interactions between agents (specified using transition and reward functions) are dependent on the number of agents (and not on the identity of the individual agents) involved in the interaction. A collision...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Association for the Advancement of Artificial Intelligence (AAAI)
2015
|
| Online Access: | http://hdl.handle.net/1721.1/100438 https://orcid.org/0000-0002-8585-6566 |