.png){kind=icon}
返回
Incremental multi-agent path finding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2020.09.032.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Existing multi-agent path finding (MAPF) algorithms are offline methods that aim at finding conflict-ree paths for more than one agent. In many real-life applications it is possible that a multi-agent plan cannot be fully executed due to some changes in the environment (represented as a graph), or in missions in which the agents are involved. Even in the case of a minor change, the offline planning algorithm must be re-started from scratch to generate a new plan, and this often requires a substantial amount of time. Motivated by this real-life requirement, we introduced the Incremental Multi-Agent Path Finding (I-MAPF) problem. Any location (node) in the initial environment (graph) can become unavailable for some time and then become available again. Agents can be informed about these changes before they occur and some agents have to update their plans if they planned to use that location. The Conflict Based Search (CBS) is one of most the successful algorithms in solving MAPF problems. To our best knowledge, there are no currently existing studies that attempt at solving the I-MAPF problem. In this paper, we propose a new method to solve the I-MAPF problem, called CBS-D*-lite. CBS-D*-lite is built upon CBS and avoids re-planning for agents that are not affected by the environmental changes. To achieve this, CBS-D*-lite employs D*-lite, an incremental single-agent pathfinding algorithm as the lower-level search method in CBS. We show that the number of time-steps required to solve a problem is generally lower than with regular CBS. Empirically, we show that the CBS-D*-lite provided faster results than regular CBS, and the total cost provided CBS-D*-lite is generally close to the total cost values provided by the regular CBS when there are environmental changes. (C) 2020 Elsevier B.V. All rights reserved.
Keyword:
Multi-agent path finding
Multi-agent planning
Incremental path planning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
引用论文
Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间？
.png){kind=icon}
PREAI
分享收藏
New and improved search algorithms and precise analysis of their average-case complexity新的和改进的搜索算法及其平均情况复杂度的精确分析
PREAI
分享收藏分享收藏
查看更多内容