{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T15:43:13Z","timestamp":1774453393738,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,12,19]],"date-time":"2012-12-19T00:00:00Z","timestamp":1355875200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s10489-012-0406-4","type":"journal-article","created":{"date-parts":[[2012,12,17]],"date-time":"2012-12-17T21:35:08Z","timestamp":1355780108000},"page":"217-235","source":"Crossref","is-referenced-by-count":103,"title":["BA*: an online complete coverage algorithm for cleaning robots"],"prefix":"10.1007","volume":"39","author":[{"given":"Hoang Huu","family":"Viet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viet-Hung","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md Nasir Uddin","family":"Laskar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TaeChoong","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,12,19]]},"reference":[{"issue":"4","key":"406_CR1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1177\/027836402320556359","volume":"21","author":"EU Acar","year":"2002","unstructured":"Acar EU, Choset H, Rizzi AA, Atkar PN, Hull D (2002) Morse decompositions for coverage tasks. Int J Robot Res 21(4):331\u2013344","journal-title":"Int J Robot Res"},{"issue":"1","key":"406_CR2","first-page":"7","volume":"1","author":"A Botea","year":"2004","unstructured":"Botea A, M\u00fcller M, Schaeffer J (2004) Near optimal hierarchical path-finding. J Game Dev 1(1):7\u201328","journal-title":"J Game Dev"},{"key":"406_CR3","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/MMVIP.2008.4749559","volume-title":"Proceedings of the 15th international conference on mechatronics and machine vision in practice","author":"Z Chibin","year":"2008","unstructured":"Chibin Z, Xingsong W, Yong D (2008) Complete coverage path planning based on ant colony algorithm. In: Proceedings of the 15th international conference on mechatronics and machine vision in practice, Auckland, New-Zealand, pp 357\u2013361"},{"issue":"1","key":"406_CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1008958800904","volume":"9","author":"H Choset","year":"2000","unstructured":"Choset H (2000) Coverage of known spaces: the boustrophedon cellular decomposition. Auton Robots 9(1):247\u2013253","journal-title":"Auton Robots"},{"issue":"1\u20134","key":"406_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1016639210559","volume":"31","author":"H Choset","year":"2001","unstructured":"Choset H (2001) Coverage for robotics\u2014a survey of recent results. Ann Math Artif Intell 31(1\u20134):113\u2013126","journal-title":"Ann Math Artif Intell"},{"key":"406_CR6","volume-title":"Proceedings of the international conference on field and service robotics","author":"H Choset","year":"1997","unstructured":"Choset H, Pignon P (1997) Coverage path planning: the boustrophedon cellular decomposition. In: Proceedings of the international conference on field and service robotics, Canberra, Australia"},{"issue":"1","key":"406_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271","journal-title":"Numer Math"},{"key":"406_CR8","volume-title":"Proceedings of the 16th European workshop on computational geometry","author":"M Dlouhy","year":"2000","unstructured":"Dlouhy M, Brabec F, Svestka P (2000) A genetic approach to the cleaning path planning problem. In: Proceedings of the 16th European workshop on computational geometry, Eilat, Israel"},{"key":"406_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511780929","volume-title":"Computational principles of mobile robotics","author":"G Dudek","year":"2010","unstructured":"Dudek G, Jenkin M (2010) Computational principles of mobile robotics, 2nd edn. Cambridge Univerity Press, Cambridge","edition":"2"},{"key":"406_CR10","unstructured":"Esposito JM, Barton O, Koehler J, Lim D (2011) Matlab toolbox for the create robot. www.usna.edu\/Users\/weapsys\/esposito\/roomba.matlab\/"},{"issue":"4","key":"406_CR11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1016610507833","volume":"31","author":"Y Gabriely","year":"2001","unstructured":"Gabriely Y, Rimon E (2001) Spanning-tree based coverage of continuous areas by a mobile robot. Ann Math Artif Intell 31(4):77\u201398","journal-title":"Ann Math Artif Intell"},{"key":"406_CR12","first-page":"954","volume-title":"Proceedings of the IEEE international conference on robotics and automation","author":"Y Gabriely","year":"2002","unstructured":"Gabriely Y, Rimon E (2002) Spiral-STC: an on-line coverage algorithm of grid environments by a mobile robot. In: Proceedings of the IEEE international conference on robotics and automation, Washington, DC, USA, pp 954\u2013960"},{"key":"406_CR13","first-page":"261","volume-title":"Proceeding of the 2002 international symposium on robotics and automation","author":"E Gonz\u00e1lez","year":"2002","unstructured":"Gonz\u00e1lez E, Aristiz\u00e1bal PT, Alarc\u00f3n MA (2002) Backtracking spiral algorithm: a mobile robot region filling strategy. In: Proceeding of the 2002 international symposium on robotics and automation, Toluca, Mexico, pp 261\u2013266"},{"key":"406_CR14","doi-asserted-by":"crossref","first-page":"2040","DOI":"10.1109\/ROBOT.2005.1570413","volume-title":"Proceedings of the IEEE international conference on robotics and automation","author":"E Gonz\u00e1lez","year":"2005","unstructured":"Gonz\u00e1lez E, \u00c1lvarez O, D\u00edaz Y, Parra C, Bustacara C (2005) BSA: a complete coverage algorithm. In: Proceedings of the IEEE international conference on robotics and automation, Barcelona, Spain, pp 2040\u20132044"},{"issue":"2","key":"406_CR15","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":"406_CR16","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1145\/375735.376463","volume-title":"Proceedings of the international conference on autonomous agents","author":"S Koenig","year":"2001","unstructured":"Koenig S, Liu Y (2001) Terrain coverage with ant robots: a simulation study. In: Proceedings of the international conference on autonomous agents, Montreal, Quebec, Canada, pp 600\u2013607"},{"issue":"1\u20132","key":"406_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(01)00094-7","volume":"129","author":"RE Korf","year":"2001","unstructured":"Korf RE, Reid M, Edelkamp S (2001) Time complexity of iterative-deepening-A*. Artif Intell 129(1\u20132):199\u2013218","journal-title":"Artif Intell"},{"key":"406_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot motion planning","author":"JC Latombe","year":"1991","unstructured":"Latombe JC (1991) Robot motion planning. Kluwer Academic, Amsterdam"},{"issue":"1","key":"406_CR19","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1109\/TNN.2008.2000394","volume":"19","author":"C Luo","year":"2008","unstructured":"Luo C, Yang SX (2008) A bioinspired neural network for real-time concurrent map building and complete coverage robot navigation in unknown environments. IEEE Trans Neural Netw 19(1):1279\u20131298","journal-title":"IEEE Trans Neural Netw"},{"key":"406_CR20","first-page":"5525","volume-title":"Proceedings of the IEEE international conference on robotics and automation","author":"R Mannadiar","year":"2010","unstructured":"Mannadiar R, Rekleitis I (2010) Optimal coverage of a known arbitrary environment. In: Proceedings of the IEEE international conference on robotics and automation, Anchorage, Alaska, USA, pp 5525\u20135530"},{"issue":"1","key":"406_CR21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10489-011-0320-1","volume":"37","author":"M Mendon\u00e7a","year":"2012","unstructured":"Mendon\u00e7a M, de Arruda LVR, Jr FN (2012) Autonomous navigation system using event driven-fuzzy cognitive maps. Appl Intell 37(1):175\u2013188","journal-title":"Appl Intell"},{"key":"406_CR22","first-page":"1177","volume-title":"Proceedings of the AAAI conference on artificial intelligence","author":"A Nash","year":"2007","unstructured":"Nash A, Daniel K, Koenig S, Felner A (2007) Theta*: any-angle path planning on grids. In: Proceedings of the AAAI conference on artificial intelligence, Vancouver, Canada, pp 1177\u20131183"},{"issue":"3","key":"406_CR23","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/TIE.2004.825197","volume":"51","author":"JS Oh","year":"2004","unstructured":"Oh JS, Choi YH, Park JB, Zheng YF (2004) Complete coverage navigation of cleaning robots using triangular-cell-based map. IEEE Trans Ind Electron 51(3):718\u2013726","journal-title":"IEEE Trans Ind Electron"},{"key":"406_CR24","doi-asserted-by":"crossref","first-page":"4236","DOI":"10.1109\/ROBOT.2005.1570771","volume-title":"Proceedings of the IEEE international conference on robotics and automation","author":"J Palac\u00edn","year":"2005","unstructured":"Palac\u00edn J, Palleja T, Valga\u00f1\u00f3n I, Pernia R, Roca J (2005) Measuring coverage performances of a floor cleaning mobile robot using a vision system. In: Proceedings of the IEEE international conference on robotics and automation, Barcelona, Spain, pp 4236\u20134241"},{"issue":"1","key":"406_CR25","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.robot.2009.07.030","volume":"58","author":"T Palleja","year":"2010","unstructured":"Palleja T, Tresanchez M, Teixido M, Palacin J (2010) Modeling floor-cleaning coverage performances of some domestic mobile robots in a reduced scenario. Robot Auton Syst 58(1):37\u201345","journal-title":"Robot Auton Syst"},{"key":"406_CR26","volume-title":"Artificial intelligence a modern approach","author":"SJ Russel","year":"2003","unstructured":"Russel SJ, Norvig P (2003) In: Artificial intelligence a modern approach. Pearson Education, Upper Saddle River"},{"key":"406_CR27","unstructured":"The iRobot Create Team: iRobot Create owner\u2019s guide (2006). www.irobot.com\/hrd_right_rail\/create_rr\/create_fam\/createFam_rr_manuals.html"},{"key":"406_CR28","unstructured":"Wong S (2006) Qualitative topological coverage of unknown environments by mobile robots. PhD dissertation, The University of Auckland, New Zealand"},{"issue":"1","key":"406_CR29","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/TSMCB.2003.811769","volume":"34","author":"SX Yang","year":"2004","unstructured":"Yang SX, Luo C (2004) A neural network approach to complete coverage path planning. IEEE Trans Syst Man Cybern, Part B, Cybern 34(1):718\u2013724","journal-title":"IEEE Trans Syst Man Cybern, Part B, Cybern"},{"key":"406_CR30","first-page":"44","volume-title":"Lecture notes in artificial intelligence","author":"P Yap","year":"2002","unstructured":"Yap P (2002) Grid-based path-finding. In: Lecture notes in artificial intelligence, vol 2338. Springer, Berlin, pp 44\u201355"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-012-0406-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-012-0406-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-012-0406-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T00:37:43Z","timestamp":1562459863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-012-0406-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,19]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["406"],"URL":"https:\/\/doi.org\/10.1007\/s10489-012-0406-4","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,19]]}}}