Optimizing Coverage Performance of Multiple Random Path-planning Robots
This paper presents a new approach to the multi-agent coverage path-planning problem. An efficient multi-robot coverage algorithm yields a coverage path for each robot, such that the union of all paths generates an almost full coverage of the terrain and the total coverage time is minimized. The pro...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2012-03-01
|
| Series: | Paladyn |
| Subjects: | |
| Online Access: | https://doi.org/10.2478/s13230-012-0012-5 |