{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:22:33Z","timestamp":1762352553523},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,27]],"date-time":"2017-01-27T00:00:00Z","timestamp":1485475200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Robot Syst"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s10846-017-0485-x","type":"journal-article","created":{"date-parts":[[2017,1,27]],"date-time":"2017-01-27T13:35:04Z","timestamp":1485524104000},"page":"265-290","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["B-Theta*: an Efficient Online Coverage Algorithm for Autonomous Cleaning Robots"],"prefix":"10.1007","volume":"87","author":[{"given":"SeungYoon","family":"Choi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SeungGwan","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoang Huu","family":"Viet","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":[[2017,1,27]]},"reference":[{"issue":"4","key":"485_CR1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1177\/027836402320556359","volume":"21","author":"EU Acar","year":"2002","unstructured":"Acar, E.U., Choset, H., Rizzi, A.A., Atkar, P.N., Hull, D.: Morse decompositions for coverage tasks. Int. J. Robot. Res. 21(4), 331\u2013344 (2002)","journal-title":"Int. J. Robot. Res."},{"issue":"1","key":"485_CR2","first-page":"7","volume":"1","author":"A Botea","year":"2004","unstructured":"Botea, A., Mller, M., Schaeffer, J.: Near optimal hierarchical path-finding. Journal of Game Development 1(1), 7\u201328 (2004)","journal-title":"Journal of Game Development"},{"key":"485_CR3","first-page":"357","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.: Complete coverage path planning based on ant colony algorithm. In: Proceedings of the 15Th International Conference on Mechatronics and Machine Vision in Practice, pp. 357\u2013361. Auckland, New-Zealand (2008)"},{"issue":"1","key":"485_CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1008958800904","volume":"9","author":"H Choset","year":"2000","unstructured":"Choset, H.: Coverage of known spaces: the boustrophedon cellular decomposition. Auton. Robot. 9(1), 247\u2013253 (2000)","journal-title":"Auton. Robot."},{"issue":"1-4","key":"485_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1023\/A:1016639210559","volume":"31","author":"H Choset","year":"2001","unstructured":"Choset, H.: Coverage for robotics - a survey of recent results. Ann. Math. Artif. Intell. 31(1\u20134), 113\u2013126 (2001)","journal-title":"Ann. Math. Artif. Intell."},{"key":"485_CR6","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementations","author":"H Choset","year":"2005","unstructured":"Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G.A., Burgard, W., Kavraki, L.E., Thrun, S.: Principles of Robot Motion: Theory, Algorithms, and Implementations. MIT Press, Boston (2005)"},{"key":"485_CR7","volume-title":"Proceedings of the International Conference on Field and Service Robotics. Canberra, Australia","author":"H Choset","year":"1997","unstructured":"Choset, H., Pignon, P.: Coverage path planning: the boustrophedon cellular decomposition. In: Proceedings of the International Conference on Field and Service Robotics. Canberra, Australia (1997)"},{"issue":"1","key":"485_CR8","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1613\/jair.2994","volume":"39","author":"K Daniel","year":"2010","unstructured":"Daniel, K., Nash, A., Koenig, S.: Theta*: any-angle path planning on grids. J. Artif. Intell. Res. 39(1), 533\u2013579 (2010)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"485_CR9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"485_CR10","volume-title":"Proceedings of the 16th European Workshop on Computational Geometry. Eilat, Israel","author":"M Dlouhy","year":"2000","unstructured":"Dlouhy, M., Brabec, F., Svestka, P.: A genetic approach to the cleaning path planning problem. In: Proceedings of the 16th European Workshop on Computational Geometry. Eilat, Israel (2000)"},{"key":"485_CR11","doi-asserted-by":"crossref","unstructured":"Dudek, G., Jenkin, M.: Computational Principles of Mobile Robotics, 2nd edn. Cambridge University (2010)","DOI":"10.1017\/CBO9780511780929"},{"key":"485_CR12","unstructured":"Esposito, J.M., Barton, O., Koehler, J., Lim, D.: Matlab toolbox for the create robot (2011). www.usna.edu\/Users\/weapsys\/esposito\/roomba.matlab\/"},{"issue":"4","key":"485_CR13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1023\/A:1016610507833","volume":"31","author":"Y Gabriely","year":"2001","unstructured":"Gabriely, Y., Rimon, E.: Spanning-tree based coverage of continuous areas by a mobile robot. Ann. Math. Artif. Intell. 31(4), 77\u201398 (2001)","journal-title":"Ann. Math. Artif. Intell."},{"key":"485_CR14","doi-asserted-by":"crossref","unstructured":"Gabriely, Y., Rimon, E.: 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, pp. 954\u2013960, Washington, DC, USA (2002)","DOI":"10.1109\/ROBOT.2002.1013479"},{"key":"485_CR15","doi-asserted-by":"crossref","unstructured":"Gonzalez, E., Alvarez, O., Diaz, Y., Parra, C., Bustacara, C.: BSA: a complete coverage algorithm. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 2040\u20132044, Barcelona, Spain (2005)","DOI":"10.1109\/ROBOT.2005.1570413"},{"key":"485_CR16","unstructured":"Gonzalez, E., Aristizbal, P.T., Alarcn, M.A.: Backtracking spiral algorithm: a mobile robot region filling strategy. In: Proceeding of the 2002 International Symposium on Robotics and Automation, pp. 261\u2013266, Toluca, Mexico (2002)"},{"issue":"2","key":"485_CR17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"485_CR18","doi-asserted-by":"crossref","unstructured":"Koenig, S., Liu, Y.: Terrain coverage with ant robots: a simulation study. In: Proceedings of the International Conference on Autonomous Agents, pp. 600\u2013607, Montreal, Quebec, Canada (2001)","DOI":"10.1145\/375735.376463"},{"issue":"1-2","key":"485_CR19","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(01)00094-7","volume":"129","author":"RE Korf","year":"2001","unstructured":"Korf, R.E., Reid, M., Edelkamp, S.: Time complexity of iterative-deepening-A*. Artif. Intell. 129(1-2), 199\u2013218 (2001)","journal-title":"Artif. Intell."},{"key":"485_CR20","doi-asserted-by":"crossref","unstructured":"Latombe, J.C.: Robot Motion Planning. Kluwer Academic Publishers (1991)","DOI":"10.1007\/978-1-4615-4022-9"},{"issue":"1","key":"485_CR21","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.1109\/TNN.2008.2000394","volume":"19","author":"C Luo","year":"2008","unstructured":"Luo, C., Yang, S.X.: 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 (2008)","journal-title":"IEEE Trans. Neural Netw."},{"key":"485_CR22","doi-asserted-by":"crossref","unstructured":"Mannadiar, R., Rekleitis, I.: Optimal coverage of a known arbitrary environment. In: Proceedings of the IEEE International Conference on Robotics and Automation, pp. 5525\u20135530, Anchorage, Alaska, USA (2010)","DOI":"10.1109\/ROBOT.2010.5509860"},{"key":"485_CR23","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.: Theta*: any-angle path planning on grids. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 1177\u20131183. Vancouver, Canada (2007)"},{"issue":"3","key":"485_CR24","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/TIE.2004.825197","volume":"51","author":"JS Oh","year":"2004","unstructured":"Oh, J.S., Choi, Y.H., Park, J.B., Zheng, Y.F.: Complete coverage navigation of cleaning robots using triangular-cell-based map. IEEE Trans. Ind. Electron. 51(3), 718\u2013726 (2004)","journal-title":"IEEE Trans. Ind. Electron."},{"issue":"1","key":"485_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.: Modeling floor-cleaning coverage performances of some domestic mobile robots in a reduced scenario. Robot. Auton. Syst. 58(1), 37\u201345 (2010)","journal-title":"Robot. Auton. Syst."},{"key":"485_CR26","unstructured":"Russel, S.J., Norvig, P.: Artificial Intelligence a Modern Approach, 2nd edn. Pearson Education (2003)"},{"key":"485_CR27","unstructured":"Shivashankar, V., Jain, R., Kuter, U., Nau, D.: Real-time planning for covering an initially-unknown spatial environment. In: Proceedings of the Twenty-Fourth International Florida Artificial Intelligence Research Society Conference, pp. 63\u201368, Florida, USA (2011)"},{"key":"485_CR28","unstructured":"The iRobot Create Team: iRobot create owners guide (2006). www.irobot.com\/hrd_right_rail\/create_rr\/create_fam\/createFam_rr_manuals.html"},{"key":"485_CR29","doi-asserted-by":"publisher","unstructured":"Viet, H.H., Dang, V.H., Laskar, M.N.U., Chung, T.: BA*: an online complete coverage algorithm for cleaning robots. Appl. Intell. (2012). doi: 10.1007\/s10489-012-0406-4","DOI":"10.1007\/s10489-012-0406-4"},{"key":"485_CR30","unstructured":"Wong, S.: Qualitative Topological Coverage of Unknown Environments by Mobile Robots. PhD dissertation, the University of Auckland, New Zealand (2006)"},{"key":"485_CR31","first-page":"1685","volume-title":"Proceedings of the International Conference on Intelligent Robots and Systems","author":"SC Wong","year":"2003","unstructured":"Wong, S.C., MacDonald, B.A.: A topological coverage algorithm for mobile robots. In: Proceedings of the International Conference on Intelligent Robots and Systems, pp. 1685\u20131690 (2003)"},{"issue":"1","key":"485_CR32","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/TSMCB.2003.811769","volume":"34","author":"SX Yang","year":"2004","unstructured":"Yang, S.X., Luo, C.: A neural network approach to complete coverage path planning. IEEE Trans. Syst. Man Cybern. B Cybern. 34(1), 718\u2013724 (2004)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"issue":"1","key":"485_CR33","first-page":"44","volume":"2338","author":"P Yap","year":"2002","unstructured":"Yap, P.: Grid-based path-finding. Lecture Notes in Artificial Intelligence 2338(1), 44\u201355 (2002)","journal-title":"Lecture Notes in Artificial Intelligence"}],"container-title":["Journal of Intelligent & Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10846-017-0485-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-017-0485-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-017-0485-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:31:37Z","timestamp":1568770297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10846-017-0485-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,27]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["485"],"URL":"https:\/\/doi.org\/10.1007\/s10846-017-0485-x","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"value":"0921-0296","type":"print"},{"value":"1573-0409","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,27]]}}}