{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:44:59Z","timestamp":1757623499299,"version":"3.44.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032014856"},{"type":"electronic","value":"9783032014863"}],"license":[{"start":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T00:00:00Z","timestamp":1755043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T00:00:00Z","timestamp":1755043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-01486-3_33","type":"book-chapter","created":{"date-parts":[[2025,8,19]],"date-time":"2025-08-19T15:46:53Z","timestamp":1755618413000},"page":"433-444","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchical Coverage Path Planning for\u00a0a\u00a0Multi-modal Robot Exploring Disconnected Regions"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Stelter","sequence":"first","affiliation":[]},{"given":"Daniel Kuan Io","family":"U.","sequence":"additional","affiliation":[]},{"given":"Sabyasachi","family":"Mondal","sequence":"additional","affiliation":[]},{"given":"Leonard","family":"Felicetti","sequence":"additional","affiliation":[]},{"given":"Saurabh","family":"Upadhyay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,13]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"119310","DOI":"10.1109\/ACCESS.2021.3108177","volume":"9","author":"CS Tan","year":"2021","unstructured":"Tan, C.S., Mohd-Mokhtar, R., Arshad, M.R.: A comprehensive review of coverage path planning in robotics using classical and heuristic algorithms. IEEE Access 9, 119310\u2013119342 (2021)","journal-title":"IEEE Access"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.55417\/fr.2022047","volume":"2","author":"B Morrell","year":"2022","unstructured":"Morrell, B., et al.: NeBula: team costar\u2019s robotic autonomy solution that won phase ii of DARPA subterranean challenge. Field Robot. 2, 1432\u20131506 (2022)","journal-title":"Field Robot."},{"key":"33_CR3","doi-asserted-by":"publisher","DOI":"10.3389\/fcteg.2022.803468","volume":"3","author":"M Jung","year":"2022","unstructured":"Jung, M., Chuen Tan, K., Dai, R.: Path planning for a jumping rover team with a charging station in multi-waypoints visiting missions. Front. Control Eng. 3, 803468 (2022)","journal-title":"Front. Control Eng."},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Araki, B., Strang, J., Pohorecky, S., Qiu, C., Naegeli, T., Rus, D.: Multi-robot path planning for a swarm of robots that can both fly and drive. In: 2017 IEEE International Conference on Robotics and Automation (ICRA), pp. 5575\u20135582. IEEE (2017)","DOI":"10.1109\/ICRA.2017.7989657"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Choset, H., Pignon, P.: Coverage path planning: The boustrophedon cellular decomposition. In: Field and Service Robotics, pp. 203\u2013209. Springer, London (1998)","DOI":"10.1007\/978-1-4471-1273-0_32"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Chen, X., et al.: Region coverage path planning of multiple disconnected convex polygons based on simulated annealing algorithm. In: 2021 IEEE 4th International Conference on Computer and Communication Engineering Technology (CCET), pp. 238\u2013242. IEEE (2021)","DOI":"10.1109\/CCET52649.2021.9544414"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Yu, K., O\u2019Kane, J.M., Tokekar, P.: Coverage of an environment using energy-constrained unmanned aerial vehicles. In: 2019 international Conference on Robotics and Automation (ICRA), pp. 3259\u20133265. IEEE (2019)","DOI":"10.1109\/ICRA.2019.8794150"},{"key":"33_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc","volume":"112","author":"G Chen","year":"2021","unstructured":"Chen, G., Shen, Y., Zhang, Y., Zhang, W., Wang, D., He, B.: 2D multi-area coverage path planning using l-shade in simulated ocean survey. Appl. Soft Comput. 112, 107754 (2021). https:\/\/doi.org\/10.1016\/j.asoc","journal-title":"Appl. Soft Comput."},{"issue":"12","key":"33_CR9","doi-asserted-by":"publisher","first-page":"692","DOI":"10.3390\/drones7120692","volume":"7","author":"D Lexu","year":"2023","unstructured":"Lexu, D., Fan, Y., Gui, M., Zhao, D.: A multi-regional path-planning method for rescue UAVs with priority constraints. Drones 7(12), 692 (2023)","journal-title":"Drones"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"51770","DOI":"10.1109\/ACCESS.2020.2980203","volume":"8","author":"J Xie","year":"2020","unstructured":"Xie, J., Carrillo, L.R.G., Jin, L.: Path planning for UAV to cover multiple separated convex polygonal regions. IEEE Access 8, 51770\u201351785 (2020)","journal-title":"IEEE Access"},{"issue":"11","key":"33_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.3390\/aerospace8110343","volume":"8","author":"Abdul Majeed and Seong Oun Hwang","year":"2021","unstructured":"Abdul Majeed and Seong Oun Hwang: A multi-objective coverage path planning algorithm for UAVs to cover spatially distributed regions in urban environments. Aerospace 8(11), 343 (2021)","journal-title":"Aerospace"},{"issue":"4","key":"33_CR12","doi-asserted-by":"publisher","first-page":"9731","DOI":"10.1109\/LRA.2022.3191939","volume":"7","author":"M Ramesh","year":"2022","unstructured":"Ramesh, M., Imeson, F., Fidan, B., Smith, S.L.: Optimal partitioning of non-convex environments for minimum turn coverage planning. IEEE Robot. Autom. Lett. 7(4), 9731\u20139738 (2022)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"33_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.128528","volume":"610","author":"B Zhao","year":"2024","unstructured":"Zhao, B., Huo, M., Li, Z., Ze, Yu., Qi, N.: Clustering-based hyper-heuristic algorithm for multi-region coverage path planning of heterogeneous UAVs. Neurocomputing 610, 128528 (2024)","journal-title":"Neurocomputing"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Yu, X., Jin, S., Shi, D., Li, L., Kang, Y., Zou, J.: Balanced multi-region coverage path planning for unmanned aerial vehicles. In: 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 3499\u20133506. IEEE (2020)","DOI":"10.1109\/SMC42975.2020.9283426"},{"issue":"12","key":"33_CR15","doi-asserted-by":"publisher","first-page":"776","DOI":"10.3390\/drones8120776","volume":"8","author":"L Wang","year":"2024","unstructured":"Wang, L., Zhuang, X., Zhang, W., Cheng, J., Zhang, T.: Coverage path planning for UAVs: an energy-efficient method in convex and non-convex mixed regions. Drones 8(12), 776 (2024)","journal-title":"Drones"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Rockenbauer, F.M., Lim, J., M\u00fcller, M.G., Siegwart, R., Schmid, L.: Traversing mars: cooperative informative path planning to efficiently navigate unknown scenes. IEEE Robot. Autom. Lett. (2024)","DOI":"10.1109\/LRA.2024.3513036"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Tang, J., Sun, C., Zhang, X.: Mstc*: multi-robot coverage path planning under physical constrain. In: 2021 IEEE International Conference on Robotics and Automation (ICRA), pp. 2518\u20132524. IEEE (2021)","DOI":"10.1109\/ICRA48506.2021.9561371"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"198101","DOI":"10.1109\/ACCESS.2020.3027422","volume":"8","author":"X Huang","year":"2020","unstructured":"Huang, X., Sun, M., Zhou, H., Liu, S.: A multi-robot coverage path planning algorithm for the environment with multiple land cover types. IEEE Access 8, 198101\u2013198117 (2020)","journal-title":"IEEE Access"},{"key":"33_CR19","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780195100563.001.0001","volume-title":"Nonlinear and Mixed-integer Optimization: Fundamentals and Applications","author":"CA Floudas","year":"1995","unstructured":"Floudas, C.A.: Nonlinear and Mixed-integer Optimization: Fundamentals and Applications. Oxford University Press, Oxford (1995)"},{"issue":"3","key":"33_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF00977785","volume":"9","author":"DT Lee","year":"1980","unstructured":"Lee, D.T., Schachter, B.J.: Two algorithms for constructing a Delaunay triangulation. Int. J. Comput. Inf. Sci. 9(3), 219\u2013242 (1980)","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"33_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2022.100031","volume":"10","author":"T Koch","year":"2022","unstructured":"Koch, T., Berthold, T., Pedersen, J., Vanaret, C.: Progress in mathematical programming solvers from 2001 to 2020. EURO J. Comput. Optim. 10, 100031 (2022)","journal-title":"EURO J. Comput. Optim."},{"key":"33_CR22","unstructured":"Law, E., Day, B.: Mars trek: an interactive web portal for current and future missions to mars. In: European Planetary Science Congress, pp. EPSC2017\u201399 (2017)"}],"container-title":["Lecture Notes in Computer Science","Towards Autonomous Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01486-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T07:09:29Z","timestamp":1757401769000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01486-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,13]]},"ISBN":["9783032014856","9783032014863"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01486-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,13]]},"assertion":[{"value":"13 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAROS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference Towards Autonomous Robotic Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"York","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"taros2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/taros-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}