A-STC: auction-based spanning tree coverage algorithm formotion planning of cooperative robots
- 11 Downloads
The multi-robot coverage motion planning (MCMP) problem in which every reachable area must be covered is common in multi-robot systems. To deal with the MCMP problem, we propose an efficient, complete, and off-line algorithm, named the “auction-based spanning tree coverage (A-STC)” algorithm. First, the configuration space is divided into mega cells whose size is twice the minimum coverage range of a robot. Based on connection relationships among mega cells, a graph structure can be obtained. A robot that circumnavigates a spanning tree of the graph can generate a coverage trajectory. Then, the proposed algorithm adopts an auction mechanism to construct one spanning tree for each robot. In this mechanism, an auctioneer robot chooses a suitable vertex of the graph as an auction item from neighboring vertexes of its spanning tree by heuristic rules. A bidder robot submits a proper bid to the auctioneer according to the auction vertexes’ relationships with the spanning tree of the robot and the estimated length of its trajectory. The estimated length is calculated based on vertexes and edges in the spanning tree. The bidder with the highest bid is selected as a winner to reduce the makespan of the coverage task. After auction processes, acceptable coverage trajectories can be planned rapidly. Computational experiments validate the effectiveness of the proposed MCMP algorithm and the method for estimating trajectory lengths. The proposed algorithm is also compared with the state-of-the-art algorithms. The comparative results show that the A-STC algorithm has apparent advantages in terms of the running time and the makespan for large crowded configuration spaces.
Key wordsCoverage motion planning Multi-robot system Auction algorithm Spanning tree coverage algorithm
Unable to display preview. Download preview PDF.
- Gabriely Y, Rimon E, 2002. Spiral-STC: an on-line coverage algorithm of grid environments by a mobile robot. Proc IEEE Int Conf on Robotics and Automation, p.954–960. https://doi.org/10.1109/ROBOT.2002.1013479Google Scholar
- Gautam A, Murthy JK, Kumar G, et al., 2015. Cluster, allocate, cover: an efficient approach for multi-robot coverage. Proc IEEE Int Conf on Systems, Man, and Cybernetics, p.197–203. https://doi.org/10.1109/SMC.2015.47Google Scholar
- Karapetyan N, Benson K, McKinney C, et al., 2017. Efficient multi-robot coverage of a known environment. Proc IEEE/RSJ Int Conf on Intelligent Robots and Systems, p.1846–1852. https://doi.org/10.1109/IROS.2017.8206000Google Scholar
- Khamis A, Hussein A, Elmogy A, 2015. Multi-robot task allocation: a review of the state-of-the-art. In: Koubâa A, Martínez-de Dios J (Eds.), Cooperative Robots and Sensor Networks 2015. Springer, Cham. https://doi.org/10.1007/978-3-319-18299-5_2Google Scholar
- Kong Y, Zhang MJ, Ye DY, 2016. A group task allocation strategy in open and dynamic grid environments. In: Fukuta N, Ito T, Zhang M, et al., (Eds.), Recent Advances in Agent-Based Complex Automated Negotiation. Springer, Cham. https://doi.org/10.1007/978-3-319-30307-9_8Google Scholar
- Xin B, Gao GQ, Ding YL, et al., 2017. Distributed multirobot motion planning for cooperative multi-area coverage. Proc 13th IEEE Int Conf on Control & Automation, p.361–366. https://doi.org/10.1109/ICCA.2017.8003087Google Scholar