Cooperative Online Workspace Allocation in the Presence of Obstacles for Multi-robot Simultaneous Exploration and Coverage Path Planning Problem
- 11 July 2023
- journal article
- research article
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 21 (7) , 2338-2349
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A Repartitioning Algorithm to Guarantee Complete, Non-overlapping Planar Coverage with Multiple Robots2016
- A survey on coverage path planning for roboticsRobotics and Autonomous Systems, 2013
- Frontier Based Goal Seeking for Robots in Unknown EnvironmentsJournal of Intelligent & Robotic Systems, 2012
- Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approachAnnals of Mathematics and Artificial Intelligence, 2008
- The giving tree: constructing trees for efficient offline and online multi-robot coverageAnnals of Mathematics and Artificial Intelligence, 2008
- Competitive on-line coverage of grid environments by a mobile robotComputational Geometry, 2003
- Spreading Out: A Local Approach to Multi-robot Coverage2002
- Polygon Area Decomposition for Multiple-Robot Workspace DivisionInternational Journal of Computational Geometry & Applications, 1998
- Frontier-based exploration using multiple robots1998
- Dynamic path planning in sensor-based terrain acquisitionIEEE Transactions on Robotics and Automation, 1990