.png){kind=icon}
返回
Polynomial-Time Algorithms for Multiagent Minimal-Capacity Planning
.png){kind=icon}
OA
AI
DOI：10.1109/TCNS.2022.3146297.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we study the problem of minimizing the resource capacity of autonomous agents that cooperate to achieve a shared task. More specifically, we consider high-level planning for a team of homogeneous agents that operate under resource constraints in stochastic environments and share a common goal: given a set of target locations, ensure that each location is visited infinitely often by some agents almost surely. We formalize the dynamics of agents by the so-called consumption Markov decision processes. In a consumption Markov decision process, the agent has a resource of limited capacity. Each action of the agent may consume some amount of the resource. To avoid exhaustion, the agent can replenish its resource to full capacity in designated reload states. The resource capacity restricts the capabilities of the agent. The objective is to assign target locations to agents, and each agent is only responsible for visiting the assigned subset of target locations repeatedly. Moreover, the assignment must ensure that the agents can carry out their tasks with minimal resource capacity. We reduce the problem to an equivalent graph-theoretical problem. We develop an algorithm that solves this graph problem in time that is polynomial in the number of agents, target locations, and size of the consumption Markov decision process. We demonstrate the applicability and scalability of the algorithm in a scenario where hundreds of unmanned underwater vehicles monitor hundreds of locations in environments with stochastic ocean currents.
Keyword:
Markov decision processes (MDPs)
multi-agent systems
resource-constrained systems
期刊
IF:
5
论文数:
1.7K
被引数:
5.8K
机构
引用论文
.png){kind=icon}
查看更多内容