Abstract
SUMMARYA new coverage path planning (CPP) algorithm, namely cell permeability-based coverage (CPC) algorithm, is proposed in this paper. Unlike the most CPP algorithms using approximate cellular decomposition, the proposed algorithm achieves exact coverage with lower coverage overlap compared to that with the existing algorithms. Apart from a formal analysis of the algorithm, the performance of the proposed algorithm is compared with two representative approximate cellular decomposition-based coverage algorithms reported in the literature. Results of demonstrative experiments on a TurtleBot mobile robot within the robot operating system/Gazebo environment and on a Fire Bird V robot are also provided.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,General Mathematics,Software,Control and Systems Engineering
Reference25 articles.
1. 14. Zheng, X. , Jain, S. , Koenig, S. and Kempe, D. , “Multi-robot Forest Coverage,” Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, August 2005, pp. 3852–3857.
2. Path Planning for Robotic Demining: Robust Sensor-Based Coverage of Unstructured Environments and Probabilistic Methods
3. 5. Waanders, M. , “Coverage Path Planning for Mobile Cleaning Robots,” Proceedings of 15th Twente Student Conference on IT, The Netherlands. Copyright (2011).
4. Multi-robot terrain coverage and task allocation for autonomous detection of landmines
5. Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献