{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T06:34:17Z","timestamp":1723271657363},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T00:00:00Z","timestamp":1489622400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004681","name":"Higher Education Commission, Pakistan","doi-asserted-by":"publisher","award":["20-2359\/NRPU\/R&D\/HEC\/12-6779"],"id":[{"id":"10.13039\/501100004681","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s11370-017-0223-z","type":"journal-article","created":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T04:13:11Z","timestamp":1489637591000},"page":"229-240","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Online complete coverage path planning using two-way proximity search"],"prefix":"10.1007","volume":"10","author":[{"given":"Amna","family":"Khan","sequence":"first","affiliation":[]},{"given":"Iram","family":"Noreen","sequence":"additional","affiliation":[]},{"given":"Hyejeong","family":"Ryu","sequence":"additional","affiliation":[]},{"given":"Nakju Lett","family":"Doh","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9758-9162","authenticated-orcid":false,"given":"Zulfiqar","family":"Habib","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,16]]},"reference":[{"issue":"5","key":"223_CR1","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1108\/01439911211249779","volume":"39","author":"M Dakulovic","year":"2012","unstructured":"Dakulovic M, Petrovic I (2012) Complete coverage path planning of mobile robots for humanitarian demining. Ind Robot: Int J 39(5):484\u2013493","journal-title":"Ind Robot: Int J"},{"key":"223_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.5772\/56248","volume":"10","author":"AI Hameed","year":"2013","unstructured":"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\u20139","journal-title":"Int J Adv Robot Syst"},{"key":"223_CR3","unstructured":"Waanders M (2011) Coverage path planning for mobile cleaning robots. In: 15th twente student conference on IT, Enschede"},{"key":"223_CR4","doi-asserted-by":"crossref","unstructured":"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\u20131379","DOI":"10.1109\/COASE.2016.7743569"},{"key":"223_CR5","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/IROS.2012.6385553"},{"key":"223_CR6","unstructured":"Franco CD, Buttazzo G (2016) Energy-aware coverage path planning of UAVs. In: IEEE international conference on autonomous robot systems and competitions, pp 111\u2013117"},{"key":"223_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/A:1016639210559","volume":"31","author":"H Choset","year":"2001","unstructured":"Choset H (2001) Coverage for robotics\u2014a survey for recent results. Ann Math Artif Intell 31:13\u2013126","journal-title":"Ann Math Artif Intell"},{"key":"223_CR8","doi-asserted-by":"crossref","unstructured":"Choset H, Pignon P (1998) Coverage path planning: the boustrophedon cellular decomposition. In: Zelinsky A (ed) Field and service robotics. Springer, London, pp 203\u2013209","DOI":"10.1007\/978-1-4471-1273-0_32"},{"key":"223_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013960","DOI":"10.1109\/ROBOT.2002.1013479"},{"key":"223_CR10","unstructured":"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\u2013151"},{"issue":"6","key":"223_CR11","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.13031\/2013.40615","volume":"27","author":"IA Hameed","year":"2011","unstructured":"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\u20131086","journal-title":"Appl Eng Agric ASABE"},{"key":"223_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013361","DOI":"10.1109\/MMVIP.2008.4749559"},{"key":"223_CR13","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1016\/j.robot.2013.09.004","volume":"61","author":"E Galceran","year":"2013","unstructured":"Galceran E, Carreras M (2013) A survey on coverage path planning for robotics. Robots Auton Syst 61:1258\u20131276","journal-title":"Robots Auton Syst"},{"issue":"2","key":"223_CR14","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s12555-011-0184-5","volume":"11","author":"A Janchiv","year":"2013","unstructured":"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\u2013376","journal-title":"Int J Control Autom Syst"},{"key":"223_CR15","doi-asserted-by":"crossref","unstructured":"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\u201332","DOI":"10.1109\/ROBOT.2001.932525"},{"key":"223_CR16","doi-asserted-by":"crossref","unstructured":"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\u20131841","DOI":"10.2991\/emeit.2012.407"},{"key":"223_CR17","volume-title":"Principals of robot motion: theory, algorithms and implementations","author":"H Choset","year":"2005","unstructured":"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, Cambridge"},{"key":"223_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013735","DOI":"10.1109\/ICCAS.2014.6987875"},{"key":"223_CR19","unstructured":"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\u20138276"},{"key":"223_CR20","unstructured":"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\u2013151"},{"key":"223_CR21","doi-asserted-by":"crossref","unstructured":"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\u2013544","DOI":"10.1109\/CIMCA.2008.145"},{"key":"223_CR22","doi-asserted-by":"crossref","unstructured":"Senthilkumar KS, Bharadwaj KK (2008) Spanning tree based terrain coverage by multi robots in an unknown environment. In: INDICON, pp 120\u2013125","DOI":"10.1109\/INDCON.2008.4768812"},{"key":"223_CR23","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.robot.2011.09.005","volume":"60","author":"KS Senthilkumar","year":"2012","unstructured":"Senthilkumar KS, Bharadwaj KK (2012) Multi-robot exploration and terrain coverage in an unknown environment. Robot Auton Syst 60:123\u2013132","journal-title":"Robot Auton Syst"},{"key":"223_CR24","unstructured":"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\u2013200"},{"issue":"1","key":"223_CR25","doi-asserted-by":"crossref","first-page":"283","DOI":"10.13031\/2013.29488","volume":"53","author":"J Jin","year":"2010","unstructured":"Jin J, Tang L (2010) Optimal coverage path planning for arable farming on 2D surfaces. Trans ASABE 53(1):283\u2013295","journal-title":"Trans ASABE"},{"key":"223_CR26","first-page":"217235","volume":"39","author":"HH Viet","year":"2013","unstructured":"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","journal-title":"Int J Appl Intell Neural Netw Complex Probl Solving Technol"},{"issue":"2","key":"223_CR27","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"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\u2013107","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"223_CR28","doi-asserted-by":"crossref","unstructured":"Stentz A (1994) Optimal and efficient path planning for partially-known environments. In: Proceedings IEEE conference on robotics and automation","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"223_CR29","doi-asserted-by":"crossref","unstructured":"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\u20135955","DOI":"10.3182\/20110828-6-IT-1002.03400"},{"key":"223_CR30","unstructured":"Witkowsky C (1983) A parallel processor algorithm for robot route planning. In: International joint conference on artificial intelligence, pp 827\u2013829"},{"key":"223_CR31","unstructured":"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"},{"issue":"1","key":"223_CR32","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1958","unstructured":"Dijkstra E (1958) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269\u2013271","journal-title":"Numerische Mathematik"},{"key":"223_CR33","first-page":"7","volume":"1","author":"A Botean","year":"2004","unstructured":"Botean A, M\u00fcller M, Schaeffer J (2004) Near optimal hierarchical path-finding. J Game Dev 1:7\u201328","journal-title":"J Game Dev"},{"issue":"1","key":"223_CR34","first-page":"533","volume":"39","author":"A Nash","year":"2010","unstructured":"Nash A, Daniel K, Koenig S, Felner A (2010) Theta*: any angle path planning on grids. J Artif Intell Res 39(1):533\u2013579","journal-title":"J Artif Intell Res"},{"key":"223_CR35","unstructured":"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\u2013800"},{"key":"223_CR36","doi-asserted-by":"crossref","unstructured":"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\u2013504","DOI":"10.1109\/ICCAS.2015.7364969"},{"key":"223_CR37","unstructured":"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\u20134458"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11370-017-0223-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-017-0223-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-017-0223-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T16:33:41Z","timestamp":1568910821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11370-017-0223-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,16]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["223"],"URL":"https:\/\/doi.org\/10.1007\/s11370-017-0223-z","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,16]]}}}