.png){kind=icon}
返回
Subdimensional expansion for multirobot path planning
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2014.11.001.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Planning optimal paths for large numbers of robots is computationally expensive. In this paper, we introduce a new framework for multirobot path planning called subdimensional expansion, which initially plans for each robot individually, and then coordinates motion among the robots as needed. More specifically, subdimensional expansion initially creates a one-dimensional search space embedded in the joint configuration space of the multirobot system. When the search space is found to be blocked during planning by a robot robot collision, the dimensionality of the search space is locally increased to ensure that an alternative path can be found. As a result, robots are only coordinated when necessary, which reduces the computational cost of finding a path. We present the M* algorithm, an implementation of subdimensional expansion that adapts the A* planner to perform efficient multirobot planning. M* is proven to be complete and to find minimal cost paths. Simulation results are presented that show that M* outperforms existing optimal multirobot path planning algorithms. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Motion and path planning
Multiagent system
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间？
PREAI
分享收藏Decentralized path planning for multi-agent teams with complex constraints具有复杂约束的多智能体团队分散路径规划.png)
AUTONOMOUS ROBOTS
AUTONOMOUS ROBOTSIF4.3
PREAI
分享收藏
查看更多内容