Advertisement

A-STC: auction-based spanning tree coverage algorithm formotion planning of cooperative robots

  • Guan-Qiang Gao
  • Bin XinEmail author
Article
  • 11 Downloads

Abstract

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 words

Coverage motion planning Multi-robot system Auction algorithm Spanning tree coverage algorithm 

CLC number

TP182 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. An V, Qu ZH, Roberts R, 2017. A rainbow coverage path planning for a patrolling mobile robot with circular sensing range. IEEE Trans Syst Man Cybern Syst, 48(8):1238–1254. https://doi.org/10.1109/TSMC.2017.2662623CrossRefGoogle Scholar
  2. Azpúrua H, Freitas GM, Macharet DG, et al., 2018. Multirobot coverage path planning using hexagonal segmentation for geophysical surveys. Robotica, 36(8):1144–1166. https://doi.org/10.1017/S0263574718000292CrossRefGoogle Scholar
  3. Chakraborty A, Misra S, Sharma R, et al., 2017. Observability conditions for switching sensing topology for cooperative localization. Unmann Syst, 5(3):141–157. https://doi.org/10.1142/S2301385017400039CrossRefGoogle Scholar
  4. Choset H, 2001. Coverage for robotics—a survey of recent results. Ann Math Artif Intell, 31(1-4):113–126. https://doi.org/10.1023/A:1016639210559CrossRefzbMATHGoogle Scholar
  5. Dias MB, Zlot R, Kalra N, et al., 2006. Market-based multirobot coordination: a survey and analysis. Proc IEEE, 94(7):1257–1270. https://doi.org/10.1109/JPROC.2006.876939CrossRefGoogle Scholar
  6. Di Franco C, Buttazzo G, 2016. Coverage path planning for UAVs photogrammetry with energy and resolution constraints. J Intell Robot Syst, 83(3-4):445–462. https://doi.org/10.1007/s10846-016-0348-xCrossRefGoogle Scholar
  7. Elango M, Nachiappan S, Tiwari MK, 2011. Balancing task allocation in multi-robot systems using K-means clustering and auction based mechanisms. Expert Syst Appl, 38(6):6486–6491. https://doi.org/10.1016/j.eswa.2010.11.097CrossRefGoogle Scholar
  8. Fang H, Lu SL, Chen J, et al., 2017. Coalition formation based on a task-oriented collaborative ability vector. Front Inform Technol Electron Eng, 18(1):139–148. https://doi.org/10.1631/FITEE.1601608CrossRefGoogle Scholar
  9. 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
  10. Gabriely Y, Rimon E, 2003. Competitive on-line coverage of grid environments by a mobile robot. Comput Geom, 24(3):197–224. https://doi.org/10.1016/S0925-7721(02)00110-4MathSciNetCrossRefzbMATHGoogle Scholar
  11. Galceran E, Carreras M, 2013. A survey on coverage path planning for robotics. Robot Auton Syst, 61(12):1258–1276. https://doi.org/10.1016/j.robot.2013.09.004CrossRefGoogle Scholar
  12. 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
  13. Hazon N, Kaminka GA, 2008. On redundancy, efficiency, and robustness in coverage for multiple robots. Robot Auton Syst, 56(12):1102–1114. https://doi.org/10.1016/j.robot.2008.01.006CrossRefGoogle Scholar
  14. Kapanoglu M, Alikalfa M, Ozkan M, et al., 2012. A patternbased genetic algorithm for multi-robot coverage path planning minimizing completion time. J Intell Manuf, 23(4):1035–1045. https://doi.org/10.1007/s10845-010-0404-5CrossRefGoogle Scholar
  15. Kapoutsis AC, Chatzichristofis SA, Kosmatopoulos EB, 2017. DARP: divide areas algorithm for optimal multi-robot coverage path planning. J Intell Robot Syst, 86(3-4):663–680. https://doi.org/10.1007/s10846-016-0461-xCrossRefGoogle Scholar
  16. 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
  17. 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
  18. Khan A, Noreen I, Habib Z, 2017. On complete coverage path planning algorithms for non-holonomic mobile robots: survey and challenges. J Inform Sci Eng, 33(1):101–121. https://doi.org/10.6688/JISE.2017.33.1.7MathSciNetGoogle Scholar
  19. 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
  20. Li GS, Chou WS, Yin F, 2018. Multi-robot coordinated exploration of indoor environments using semantic information. Sci China Inform Sci, 61(7):79201. https://doi.org/10.1007/s11432-017-9336-xCrossRefGoogle Scholar
  21. Radmanesh M, Kumar M, Guentert PH, et al., 2018. Overview of path-planning and obstacle avoidance algorithms for UAVs: a comparative study. Unmann Syst, 6(2):95–118. https://doi.org/10.1142/S2301385018400022CrossRefGoogle Scholar
  22. Rekleitis I, New AP, Rankin ES, et al., 2008. Efficient boustrophedon multi-robot coverage: an algorithmic approach. Ann Math Artif Intell, 52(2-4):109–142. https://doi.org/10.1007/s10472-009-9120-2MathSciNetCrossRefzbMATHGoogle Scholar
  23. Tang J, Zhu KJ, Guo HX, et al., 2018. Using auction-based task allocation scheme for simulation optimization of search and rescue in disaster relief. Simul Model Pract Theor, 82:132–146. https://doi.org/10.1016/j.simpat.2017.12.014CrossRefGoogle Scholar
  24. 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
  25. Yehoshua R, Agmon N, Kaminka GA, 2016. Robotic adversarial coverage of known environments. Int J Robot Res, 35(12):1419–1444. https://doi.org/10.1177/0278364915625785CrossRefGoogle Scholar

Copyright information

© Zhejiang University and Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.School of AutomationBeijing Institute of TechnologyBeijingChina
  2. 2.Key Laboratory of Intelligent Control and Decision of Complex SystemsBeijingChina
  3. 3.Beijing Advanced Innovation Center for Intelligent Robots and SystemsBeijingChina

Personalised recommendations