Skip to main content
Erschienen in: Intelligent Service Robotics 3/2017

16.03.2017 | Original Research Paper

Online complete coverage path planning using two-way proximity search

verfasst von: Amna Khan, Iram Noreen, Hyejeong Ryu, Nakju Lett Doh, Zulfiqar Habib

Erschienen in: Intelligent Service Robotics | Ausgabe 3/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper presents an efficient online approach for complete coverage path planning of mobile robots in an unknown workspace based on online boustrophedon motion and an optimized backtracking mechanism. The presented approach first performs a single continuous boustrophedon motion until a critical point is reached. In order to completely cover the environment, next starting point is decided by using the accumulated knowledge of the environment map. An efficient backtracking technique based on proposed Two-way Proximity Search algorithm is used to plan a path from the critical point to the new starting point. Simulation results show the efficiency of proposed backtracking approach with improved total coverage time, coverage path length and memory requirements.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Dakulovic M, Petrovic I (2012) Complete coverage path planning of mobile robots for humanitarian demining. Ind Robot: Int J 39(5):484–493CrossRef Dakulovic M, Petrovic I (2012) Complete coverage path planning of mobile robots for humanitarian demining. Ind Robot: Int J 39(5):484–493CrossRef
2.
Zurück zum Zitat Hameed AI, Bochtis D, Sorensen CA (2013) An optimized field coverage path planning approach for navigation of agricultural robots in fields involving obstacles. Int J Adv Robot Syst 10:1–9CrossRef Hameed AI, Bochtis D, Sorensen CA (2013) An optimized field coverage path planning approach for navigation of agricultural robots in fields involving obstacles. Int J Adv Robot Syst 10:1–9CrossRef
3.
Zurück zum Zitat Waanders M (2011) Coverage path planning for mobile cleaning robots. In: 15th twente student conference on IT, Enschede Waanders M (2011) Coverage path planning for mobile cleaning robots. In: 15th twente student conference on IT, Enschede
4.
Zurück zum Zitat Perezimaz HIA, Rezeck PAF, Macharet DG, Campos MFM (2016) Multi-robot 3D coverage path planning for First Responders teams. In: IEEE international conference on automation science and engineering (CASE), pp 1374–1379 Perezimaz HIA, Rezeck PAF, Macharet DG, Campos MFM (2016) Multi-robot 3D coverage path planning for First Responders teams. In: IEEE international conference on automation science and engineering (CASE), pp 1374–1379
5.
Zurück zum Zitat Galceran E, Carreras M (2012) Efficient Seabed Coverage Path Planning for ASVs and AUVs. In: IEEE/RSJ international conference on intelligent robots and systems, Vilamoura, Portugal Galceran E, Carreras M (2012) Efficient Seabed Coverage Path Planning for ASVs and AUVs. In: IEEE/RSJ international conference on intelligent robots and systems, Vilamoura, Portugal
6.
Zurück zum Zitat Franco CD, Buttazzo G (2016) Energy-aware coverage path planning of UAVs. In: IEEE international conference on autonomous robot systems and competitions, pp 111–117 Franco CD, Buttazzo G (2016) Energy-aware coverage path planning of UAVs. In: IEEE international conference on autonomous robot systems and competitions, pp 111–117
7.
Zurück zum Zitat Choset H (2001) Coverage for robotics—a survey for recent results. Ann Math Artif Intell 31:13–126CrossRef Choset H (2001) Coverage for robotics—a survey for recent results. Ann Math Artif Intell 31:13–126CrossRef
8.
Zurück zum Zitat Choset H, Pignon P (1998) Coverage path planning: the boustrophedon cellular decomposition. In: Zelinsky A (ed) Field and service robotics. Springer, London, pp 203–209 Choset H, Pignon P (1998) Coverage path planning: the boustrophedon cellular decomposition. In: Zelinsky A (ed) Field and service robotics. Springer, London, pp 203–209
9.
Zurück zum Zitat Gabriely Y, Rimon E (2002) Spiral-STC : an on-line coverage algorithm of grid environments by a mobile robot. In: International conference on robotics and automation, pp 954–960 Gabriely Y, Rimon E (2002) Spiral-STC : an on-line coverage algorithm of grid environments by a mobile robot. In: International conference on robotics and automation, pp 954–960
10.
Zurück zum Zitat Qiu X, Liu S , Yang SX (2004) A rolling method for complete coverage path planning in uncertain environments. In: International conference on robotics and biometric, pp 146–151 Qiu X, Liu S , Yang SX (2004) A rolling method for complete coverage path planning in uncertain environments. In: International conference on robotics and biometric, pp 146–151
11.
Zurück zum Zitat Hameed IA, Bochtis DD, Sorensen CG (2011) Driving angle and track sequence optimization for operational path planning using genetic algorithms. Appl Eng Agric ASABE 27(6):1077–1086CrossRef Hameed IA, Bochtis DD, Sorensen CG (2011) Driving angle and track sequence optimization for operational path planning using genetic algorithms. Appl Eng Agric ASABE 27(6):1077–1086CrossRef
12.
Zurück zum Zitat Chibin Z, Xingsong W, Yong D (2008) Complete coverage path Planning based on ant colony algorithm. In: 15th international conference on mechatronics and machine vision in practice, pp 357–361 Chibin Z, Xingsong W, Yong D (2008) Complete coverage path Planning based on ant colony algorithm. In: 15th international conference on mechatronics and machine vision in practice, pp 357–361
13.
Zurück zum Zitat Galceran E, Carreras M (2013) A survey on coverage path planning for robotics. Robots Auton Syst 61:1258–1276CrossRef Galceran E, Carreras M (2013) A survey on coverage path planning for robotics. Robots Auton Syst 61:1258–1276CrossRef
14.
Zurück zum Zitat Janchiv A, Batsaikhan D, Kim B, Lee W, Lee S (2013) Time-efficient and complete coverage path planning based on flow networks for multi-robots. Int J Control Autom Syst 11(2):369–376CrossRef Janchiv A, Batsaikhan D, Kim B, Lee W, Lee S (2013) Time-efficient and complete coverage path planning based on flow networks for multi-robots. Int J Control Autom Syst 11(2):369–376CrossRef
15.
Zurück zum Zitat Huang W H (2001) Optimal line-sweep-based decompositions for coverage algorithm. In: Proceedings of the 2001 IEEE international conference on robotics and automation, pp 27–32 Huang W H (2001) Optimal line-sweep-based decompositions for coverage algorithm. In: Proceedings of the 2001 IEEE international conference on robotics and automation, pp 27–32
16.
Zurück zum Zitat Zhou P, Wang Z , Li Z , Li Y (2012) Complete coverage path planning of mobile robot based on dynamic programming algorithm. In: 2nd international conference on electronic and mechanical engineering and information technology, pp 1837–1841 Zhou P, Wang Z , Li Z , Li Y (2012) Complete coverage path planning of mobile robot based on dynamic programming algorithm. In: 2nd international conference on electronic and mechanical engineering and information technology, pp 1837–1841
17.
Zurück zum Zitat Choset H, Lynch K, Hutchinson S, Kantor G, Burgard W, Kavraki I, Thrun S (2005) Principals of robot motion: theory, algorithms and implementations. MIT Press, CambridgeMATH Choset H, Lynch K, Hutchinson S, Kantor G, Burgard W, Kavraki I, Thrun S (2005) Principals of robot motion: theory, algorithms and implementations. MIT Press, CambridgeMATH
18.
Zurück zum Zitat Kim DH, Hoang G, Bae MJ, Kim JW, Yoon SM, Yeo TK, Sup H, Kim SB (2014) Path tracking control coverage of a mining robot based on exhaustive path planning with exact cell decomposition. In: International conference on control, automation and systems, pp 730–735 Kim DH, Hoang G, Bae MJ, Kim JW, Yoon SM, Yeo TK, Sup H, Kim SB (2014) Path tracking control coverage of a mining robot based on exhaustive path planning with exact cell decomposition. In: International conference on control, automation and systems, pp 730–735
19.
Zurück zum Zitat Liu Y, Lin X, Zho S (2008) Combined coverage path planning for autonomous cleaning robots in unstructured environments. In: Proceedings of the 7th world congress on intelligent control and automation, pp 8271–8276 Liu Y, Lin X, Zho S (2008) Combined coverage path planning for autonomous cleaning robots in unstructured environments. In: Proceedings of the 7th world congress on intelligent control and automation, pp 8271–8276
20.
Zurück zum Zitat Qiu X, Liu S , Yang S (2004) A rolling method for complete coverage path planning in uncertain environments. In: International conference on robotics and biometrics, pp 146–151 Qiu X, Liu S , Yang S (2004) A rolling method for complete coverage path planning in uncertain environments. In: International conference on robotics and biometrics, pp 146–151
21.
Zurück zum Zitat Weiss-Cohen M, Sirotin I, Rave E (2008) Lawn mowing system for known areas. In: International conference on computational intelligence for modeling control and automation, pp 539–544 Weiss-Cohen M, Sirotin I, Rave E (2008) Lawn mowing system for known areas. In: International conference on computational intelligence for modeling control and automation, pp 539–544
22.
Zurück zum Zitat Senthilkumar KS, Bharadwaj KK (2008) Spanning tree based terrain coverage by multi robots in an unknown environment. In: INDICON, pp 120–125 Senthilkumar KS, Bharadwaj KK (2008) Spanning tree based terrain coverage by multi robots in an unknown environment. In: INDICON, pp 120–125
23.
Zurück zum Zitat Senthilkumar KS, Bharadwaj KK (2012) Multi-robot exploration and terrain coverage in an unknown environment. Robot Auton Syst 60:123–132CrossRef Senthilkumar KS, Bharadwaj KK (2012) Multi-robot exploration and terrain coverage in an unknown environment. Robot Auton Syst 60:123–132CrossRef
24.
Zurück zum Zitat Zuo G, Zhang P , Qiao J (2010) Path planning algorithm based on sub-region for agricultural robot. In: International Asia conference on informatics in control, automation and robotics, pp 197–200 Zuo G, Zhang P , Qiao J (2010) Path planning algorithm based on sub-region for agricultural robot. In: International Asia conference on informatics in control, automation and robotics, pp 197–200
25.
Zurück zum Zitat Jin J, Tang L (2010) Optimal coverage path planning for arable farming on 2D surfaces. Trans ASABE 53(1):283–295CrossRef Jin J, Tang L (2010) Optimal coverage path planning for arable farming on 2D surfaces. Trans ASABE 53(1):283–295CrossRef
26.
Zurück zum Zitat Viet HH, Dang VH, Laskar MNU, Chung TC (2013) BA* : an online complete coverage algorithm for cleaning robots. Int J Appl Intell Neural Netw Complex Probl Solving Technol 39:217235 Viet HH, Dang VH, Laskar MNU, Chung TC (2013) BA* : an online complete coverage algorithm for cleaning robots. Int J Appl Intell Neural Netw Complex Probl Solving Technol 39:217235
27.
Zurück zum Zitat Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107CrossRef Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybern 4(2):100–107CrossRef
28.
Zurück zum Zitat Stentz A (1994) Optimal and efficient path planning for partially-known environments. In: Proceedings IEEE conference on robotics and automation Stentz A (1994) Optimal and efficient path planning for partially-known environments. In: Proceedings IEEE conference on robotics and automation
29.
Zurück zum Zitat Dakulovic M, Horvatic S, Petrovic I (2011) Complete coverage D* algorithm for path planning of a floor-cleaning mobile robot. In: 18th international federation of automatic control (IFAC) world congress, pp 5950–5955 Dakulovic M, Horvatic S, Petrovic I (2011) Complete coverage D* algorithm for path planning of a floor-cleaning mobile robot. In: 18th international federation of automatic control (IFAC) world congress, pp 5950–5955
30.
Zurück zum Zitat Witkowsky C (1983) A parallel processor algorithm for robot route planning. In: International joint conference on artificial intelligence, pp 827–829 Witkowsky C (1983) A parallel processor algorithm for robot route planning. In: International joint conference on artificial intelligence, pp 827–829
31.
Zurück zum Zitat Zelinsky A , Jarvis RA , Byrne JC , Yuta S (1993) Planning paths of complete coverage of an unstructured environment by a mobile-robot. In: Proceedings of international conference on advanced robotics Zelinsky A , Jarvis RA , Byrne JC , Yuta S (1993) Planning paths of complete coverage of an unstructured environment by a mobile-robot. In: Proceedings of international conference on advanced robotics
33.
Zurück zum Zitat Botean A, Müller M, Schaeffer J (2004) Near optimal hierarchical path-finding. J Game Dev 1:7–28 Botean A, Müller M, Schaeffer J (2004) Near optimal hierarchical path-finding. J Game Dev 1:7–28
34.
Zurück zum Zitat Nash A, Daniel K, Koenig S, Felner A (2010) Theta*: any angle path planning on grids. J Artif Intell Res 39(1):533–579MathSciNetMATH Nash A, Daniel K, Koenig S, Felner A (2010) Theta*: any angle path planning on grids. J Artif Intell Res 39(1):533–579MathSciNetMATH
35.
Zurück zum Zitat Yang K ,Sukkareih S (2008) 3D Smooth path planning for a UAV in cluttered natural environment. In International conference on intelligent robots and systems, pp 794–800 Yang K ,Sukkareih S (2008) 3D Smooth path planning for a UAV in cluttered natural environment. In International conference on intelligent robots and systems, pp 794–800
36.
Zurück zum Zitat Pratama PS, Kim JW, Kim HK, Yoon SM, Yeu TK, Hong S, Oh SJ, Kim SB (2015) Path planning algorithm to minimize an overlapped path and turning number for an underwater mining robot. In:15th international conference on control, automation and systems, pp 499–504 Pratama PS, Kim JW, Kim HK, Yoon SM, Yeu TK, Hong S, Oh SJ, Kim SB (2015) Path planning algorithm to minimize an overlapped path and turning number for an underwater mining robot. In:15th international conference on control, automation and systems, pp 499–504
37.
Zurück zum Zitat Yu X, Hung JY (2015) Coverage path planning based on a multiple sweep line decomposition. In: 41st annual conference of the IEEE industrial electronics society pp 4052–4458 Yu X, Hung JY (2015) Coverage path planning based on a multiple sweep line decomposition. In: 41st annual conference of the IEEE industrial electronics society pp 4052–4458
Metadaten
Titel
Online complete coverage path planning using two-way proximity search
verfasst von
Amna Khan
Iram Noreen
Hyejeong Ryu
Nakju Lett Doh
Zulfiqar Habib
Publikationsdatum
16.03.2017
Verlag
Springer Berlin Heidelberg
Erschienen in
Intelligent Service Robotics / Ausgabe 3/2017
Print ISSN: 1861-2776
Elektronische ISSN: 1861-2784
DOI
https://doi.org/10.1007/s11370-017-0223-z

Weitere Artikel der Ausgabe 3/2017

Intelligent Service Robotics 3/2017 Zur Ausgabe

Neuer Inhalt