Skip to main content

Advertisement

Log in

A pattern-based genetic algorithm for multi-robot coverage path planning minimizing completion time

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

Sensor-based multi-robot coverage path planning problem is one of the challenging problems in managing flexible, computer-integrated, intelligent manufacturing systems. A novel pattern-based genetic algorithm is proposed for this problem. The area subject to coverage is modeled with disks representing the range of sensing devices. Then the problem is defined as finding a sequence of the disks for each robot to minimize the coverage completion time determined by the maximum time traveled by a robot in a mobile robot group. So the environment needs to be partitioned among robots considering their travel times. Robot turns cause the robot to slow down, turn and accelerate inevitably. Therefore, the actual travel time of a mobile robot is calculated based on the traveled distance and the number of turns. The algorithm is designed to handle routing and partitioning concurrently. Experiments are conducted using P3-DX mobile robots in the laboratory and simulation environment to validate the results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Acar E. U., Choset H., Lee J. Y. (2006) Sensor-based coverage with extended range detectors. IEEE Transactions on Robotics 22(1): 189–198

    Article  Google Scholar 

  • Agmon, N., Hazon, N., & Kaminka, G. A. (2006). Constructing spanning trees for efficient multi-robot coverage. Proceedings of 2006 IEEE International Conference on Robotics and Automation, 1698–1703.

  • AIRLAB. (2009). Artificial Intelligence and Robotic laboratory, Turkey: Eskisehir Osmangazi University, http://www.ai-robotlab.ogu.edu.tr.

  • ANSI. (2010). American National Standards Institute. Accessed February 20, 2010, http://www.webstore.ansi.org.

  • Arai T., Pagello E., Parker L. E. (2002) Advances in multi-robot systems. IEEE Transactions on Robotics and Automation 18(5): 655–661

    Article  Google Scholar 

  • ARNL. (2009). Aria-ARNL software module. Accessed July 25, 2009, http://robots.mobilerobots.com.

  • Bi Z. M., Lang SY. T., Wang L. (2008) Improved control and simulation models of a tricycle collaborative robot. Journal of Intelligent Manufacturing 19: 715–722

    Article  Google Scholar 

  • Bruno G., Ghiani G., Improta G. (2000) Dynamic positioning of idle automated guided vehicles. Journal of Intelligent Manufacturing 11: 209–215

    Article  Google Scholar 

  • Choset H. (2001) Coverage for robotics—a survey of recent results. Annals of Mathematics and Artificial Intelligence 31: 113–126

    Article  Google Scholar 

  • Goldberg D. E. (1989) Genetic algorithm in search, optimization, and machine learning. Addison Wesley, Reading

    Google Scholar 

  • Guo, Y., & Balakrishnan, M. (2006). Complete coverage control for nonholonomic mobile robots in dynamic environments. Proceedings of 2006 IEEE International Conference on Robotics and Automation, 1704–1709.

  • Hasgül S., Saricicek I., Ozkan M., Parlaktuna O. (2009) Project-oriented task scheduling for mobile robot team. Journal of Intelligent Manufacturing 20: 151–158

    Article  Google Scholar 

  • Kapanoglu, M., Ozkan, M., Yazici, A., & Parlaktuna, O. (2008). A genetic algorithm with orientation compasses for single or multi-robot coverage path planning. Proceedings of 6th International Symposium on Intelligent & Manufacturing Systems, 668–678.

  • Kapanoglu, M., Ozkan, M., Yazici, A., & Parlaktuna, O. (2009). Pattern-based genetic algorithm approach to coverage path planning for mobile robots. In G. Allen et al. (Eds.), LNCS 5544: ICCS 2009, Part I, (pp. 33–42).

  • Kong, C. S., New, A. P., & Rekleitis, I. (2006). Distributed coverage with multi-robot system. Proceedings of 2006 IEEE International Conference on Robotics and Automation, 2423–2429.

  • Ozkan, M., Yazici, A., Kapanoglu, M., & Parlaktuna, O. (2009a). Hierarchical oriented genetic algorithms for coverage path planning of multi-robot teams with load balancing. In Proceedings of the 2009 World Summit on Genetic and Evolutionary Computation GEC09 (pp. 451–458).

  • Ozkan, M., Yazici, A., Kapanoglu, M., & Parlaktuna, O. (2009b). A genetic algorithm for task completion time minimization for multi-robot sensor-based coverage. In Proceedings of IEEE International Symposium on Intelligent Control ISIC09 (pp. 1164–1169).

  • Prassler E., Ritter A., Schaeffer C., Fiorini P. (2000) A short history of cleaning robots. Autonomous Robots 9: 211–226

    Article  Google Scholar 

  • Yongguo M., Yung-Hsiang L., Hu Y. C., Lee C. S. G. (2006) Deployment of mobile robots with energy and timing constraints. IEEE Transactions on Robotics and Automation 22(3): 507–522

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Muzaffer Kapanoglu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kapanoglu, M., Alikalfa, M., Ozkan, M. et al. A pattern-based genetic algorithm for multi-robot coverage path planning minimizing completion time. J Intell Manuf 23, 1035–1045 (2012). https://doi.org/10.1007/s10845-010-0404-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-010-0404-5

Keywords

Navigation