.png){kind=icon}
返回
A pattern-based genetic algorithm for multi-robot coverage path planning minimizing completion time
.png){kind=icon}
PRE
AI
DOI：10.1007/s10845-010-0404-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sensor-based multi-robot coverage path planning problem is one of the challenging problems in managing flexible, computer-integrated, intelligent manufacturing systems. A novel pattern-based genetic algorithm is proposed for this problem. The area subject to coverage is modeled with disks representing the range of sensing devices. Then the problem is defined as finding a sequence of the disks for each robot to minimize the coverage completion time determined by the maximum time traveled by a robot in a mobile robot group. So the environment needs to be partitioned among robots considering their travel times. Robot turns cause the robot to slow down, turn and accelerate inevitably. Therefore, the actual travel time of a mobile robot is calculated based on the traveled distance and the number of turns. The algorithm is designed to handle routing and partitioning concurrently. Experiments are conducted using P3-DX mobile robots in the laboratory and simulation environment to validate the results.
Keyword:
Genetic algorithms
Multi-robot
Sensor-based coverage
Path planning
Intelligent manufacturing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.4
论文数:
3.5K
被引数:
1.1W
机构
引用论文
Nano-sized LaMnO3 powders prepared by spray pyrolysis from spray solution containing citric acid从含柠檬酸的喷雾溶液中通过喷雾热解制备纳米LaMnO3粉末
OAAI
.png){kind=icon}
OAAI分享收藏分享收藏
查看更多内容