{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T07:58:48Z","timestamp":1769587128520,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819612413","type":"print"},{"value":"9789819612420","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1242-0_21","type":"book-chapter","created":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T08:07:50Z","timestamp":1733990870000},"page":"279-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Time-Efficient Path Planning Algorithm for\u00a0Mobile Robots on\u00a0Uneven Terrain"],"prefix":"10.1007","author":[{"given":"Faiza","family":"Babakano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed","family":"Fahmin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bojie","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muhammad Aamir","family":"Cheema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1007\/s00454-009-9204-0","volume":"44","author":"L Aleksandrov","year":"2010","unstructured":"Aleksandrov, L., Djidjev, H.N., Guo, H., Maheshwari, A., Nussbaum, D., Sack, J.R.: Algorithms for approximate shortest path queries on weighted polyhedral surfaces. Discrete Comput. Geom. 44(4), 762\u2013801 (2010)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1044731.1044733","volume":"52","author":"L Aleksandrov","year":"2005","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.R.: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM (JACM) 52(1), 25\u201353 (2005)","journal-title":"J. ACM (JACM)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Botea, A.: Ultra-fast optimal pathfinding without runtime search. In: Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2011, 10\u201314 October 2011, Stanford, California, USA, pp. 122\u2013127. The AAAI Press (2011)","DOI":"10.1609\/aiide.v7i1.12443"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Chen, J., Han, Y.: Shortest paths on a polyhedron. In: Proceedings of the Sixth Annual Symposium on Computational Geometry, Berkeley, CA, USA, 6\u20138 June 1990, pp. 360\u2013369. ACM (1990)","DOI":"10.1145\/98524.98601"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Choi, S., Park, J., Lim, E., Yu, W.: Global path planning on uneven elevation maps. In: 2012 9th International Conference on Ubiquitous Robots and Ambient Intelligence (URAI), pp. 49\u201354. IEEE (2012)","DOI":"10.1109\/URAI.2012.6462928"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Cui, M., Harabor, D.D., Grastien, A.: Compromise-free pathfinding on a navigation mesh. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, 19\u201325 August 2017, pp. 496\u2013502. ijcai.org (2017)","DOI":"10.24963\/ijcai.2017\/70"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Djidjev, H.N., Sommer, C.: Approximate distance queries for weighted polyhedral surfaces. In: Algorithms\u2013ESA 2011: 19th Annual European Symposium, Saarbr\u00fccken, Germany, 5\u20139 September 2011, Proceedings 19, pp. 579\u2013590. Springer (2011)","DOI":"10.1007\/978-3-642-23719-5_49"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Ganganath, N., Cheng, C.T., Chi, K.T.: Finding energy-efficient paths on uneven terrains. In: 2014 10th France-Japan\/8th Europe-Asia Congress on Mecatronics (MECATRONICS2014-Tokyo), pp. 383\u2013388. IEEE (2014)","DOI":"10.1109\/MECATRONICS.2014.7018555"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1109\/TII.2015.2413355","volume":"11","author":"N Ganganath","year":"2015","unstructured":"Ganganath, N., Cheng, C.T., Chi, K.T.: A constraint-aware heuristic path planner for finding energy-efficient paths on uneven terrains. IEEE Trans. Industr. Inf. 11(3), 601\u2013611 (2015)","journal-title":"IEEE Trans. Industr. Inf."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Ganganath, N., Cheng, C.T., Chi, K.T.: Multiobjective path planning on uneven terrains based on namoa. In: 2016 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1846\u20131849. IEEE (2016)","DOI":"10.1109\/ISCAS.2016.7538930"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, K., Bj\u00f6rnsson, Y.: Automated decomposition of game maps. In: Proceedings of the Eleventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE 2015, 14\u201318 November 2015, University of California, Santa Cruz, CA, USA, pp. 122\u2013127. AAAI Press (2015)","DOI":"10.1609\/aiide.v11i1.12796"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Shen, B., Cheema, M.A., Harabor, D., Stuckey, P.J.: Euclidean pathfinding with compressed path databases. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 4229\u20134235. ijcai.org (2020)","DOI":"10.24963\/ijcai.2020\/584"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Shen, B., Cheema, M.A., Harabor, D.D., Stuckey, P.J.: Contracting and compressing shortest path databases. In: Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, ICAPS 2021, Guangzhou, China (Virtual), 2\u201313 August 2021, pp. 322\u2013330. AAAI Press (2021)","DOI":"10.1609\/icaps.v31i1.15977"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Shen, B., Cheema, M.A., Harabor, D.D., Stuckey, P.J.: Improving time-dependent contraction hierarchies. In: Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, ICAPS 2022, Singapore (Virtual), 13\u201324 June 2022, pp. 338\u2013347. AAAI Press (2022)","DOI":"10.1609\/icaps.v32i1.19818"},{"key":"21_CR15","unstructured":"Strasser, B., Harabor, D., Botea, A.: Fast first-move queries through run-length encoding. In: Proceedings of the Seventh Annual Symposium on Combinatorial Search, SOCS 2014, Prague, Czech Republic, 15\u201317 August 2014. AAAI Press (2014)"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Sturtevant, N.R., et al.: The Grid-based Path Planning Competition: 2014 Entries and Results. In: Proceedings of the Symposium on Combinatorial Search (SoCS), pp. 241\u2013251 (2015)","DOI":"10.1609\/socs.v6i1.18364"},{"key":"21_CR17","doi-asserted-by":"crossref","unstructured":"Verma, V., Snoeyink, J.: Reducing the memory required to find a geodesic shortest path on a large mesh. In: 17th ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2009, 4\u20136 November 2009, Seattle, Washington, USA, Proceedings, pp. 227\u2013235. ACM (2009)","DOI":"10.1145\/1653771.1653804"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Wei, V.J., Wong, R.C., Long, C., Mount, D.M.: Distance oracle on terrain surface. In: Proceedings of the 2017 ACM International Conference on Management of Data, SIGMOD Conference 2017, Chicago, IL, USA, 14\u201319 May 2017, pp. 1211\u20131226. ACM (2017)","DOI":"10.1145\/3035918.3064038"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Wei, V.J., Wong, R.C.W., Long, C., Mount, D.M., Samet, H.: On efficient shortest path computation on terrain surface: a direction-oriented approach. IEEE Trans. Knowl. Data Eng. (2024)","DOI":"10.1109\/TKDE.2024.3363147"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.procs.2018.07.018","volume":"133","author":"MN Zafar","year":"2018","unstructured":"Zafar, M.N., Mohanta, J.: Methodology for path planning and optimization of mobile robots: a review. Procedia Comput. Sci. 133, 141\u2013152 (2018)","journal-title":"Procedia Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1242-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T20:05:18Z","timestamp":1736193918000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1242-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"ISBN":["9789819612413","9789819612420"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1242-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"13 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gold Coast, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc-conference.github.io\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}