{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:30:50Z","timestamp":1773707450370,"version":"3.50.1"},"reference-count":46,"publisher":"Informa UK Limited","issue":"7","license":[{"start":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T00:00:00Z","timestamp":1738195200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Open Fund of Key Laboratory of Urban Land Resources Monitoring and Simulation, Ministry of Natural Resources"},{"name":"Open Fund of Key Laboratory of Urban Land Resources Monitoring and Simulation"},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFC3005702"],"award-info":[{"award-number":["2022YFC3005702"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Geographical Information Science"],"published-print":{"date-parts":[[2025,7,3]]},"DOI":"10.1080\/13658816.2025.2457482","type":"journal-article","created":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T12:16:16Z","timestamp":1738239376000},"page":"1484-1517","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":3,"title":["HMLPA*: a hierarchical multi-target LPA* pathfinding algorithm designed for dynamic indoor path network"],"prefix":"10.1080","volume":"39","author":[{"given":"Yan","family":"Zhou","sequence":"first","affiliation":[{"name":"School of Resources and Environment, University of Electronic Science and Technology of China","place":["Chengdu, China"]},{"name":"The Yangtze Delta Region Institute (Huzhou), University of Electronic Science and Technology of China","place":["Huzhou, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunhan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Resources and Environment, University of Electronic Science and Technology of China","place":["Chengdu, China"]},{"name":"The Yangtze Delta Region Institute (Huzhou), University of Electronic Science and Technology of China","place":["Huzhou, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yeting","family":"Zhang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University","place":["Wuhan, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2025,1,30]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2022.101891"},{"key":"e_1_3_4_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2017.03.002"},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2016.08.041"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v1i1.18174"},{"issue":"1","key":"e_1_3_4_6_1","first-page":"1","article-title":"Near optimal hierarchical path-finding","volume":"1","author":"Botea A.","year":"2004","unstructured":"Botea, A., M\u00fcller, M., and Schaeffer, J., 2004. Near optimal hierarchical path-finding. Journal of Game Development, 1 (1), 1\u201330.","journal-title":"Journal of Game Development,"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292390.3292394"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi11020076"},{"key":"e_1_3_4_9_1","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi10080499"},{"key":"e_1_3_4_10_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7994"},{"key":"e_1_3_4_11_1","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v3i1.18254"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1997.1404"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-015-0241-y"},{"key":"e_1_3_4_15_1","first-page":"476","article-title":"D* lite. ed","author":"Koenig S.","year":"2002","unstructured":"Koenig, S., and Likhachev, M., 2002. D* lite. ed. 476\u2013483. Eighteenth national conference on Artificial intelligence,","journal-title":"Eighteenth national conference on Artificial intelligence"},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:GEIN.0000034820.93914.d0"},{"key":"e_1_3_4_18_1","unstructured":"Lee J. et\u00a0al. 2020. OGC\u00ae IndoorGML 1.1. [online]. Available from http:\/\/www.opengeospatial.org\/standards\/indoorgml#downloads [Accessed 3 July 2024]."},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2010.07.006"},{"key":"e_1_3_4_20_1","first-page":"262","article-title":"Anytime dynamic A*: An anytime, replanning algorithm. ed","author":"Likhachev M.","year":"2005","unstructured":"Likhachev, M., et\u00a0al., 2005. Anytime dynamic A*: An anytime, replanning algorithm. ed. 262\u2013271. ICAPS,","journal-title":"ICAPS"},{"key":"e_1_3_4_21_1","first-page":"31","article-title":"A two-level path-finding strategy for indoor navigation","author":"Liu L.","year":"2013","unstructured":"Liu, L., and Zlatanova, S., 2013. A two-level path-finding strategy for indoor navigation. In: S. Zlatanova, et al., eds. Intelligent systems for crisis management. Berlin\/Heidelberg, Germany: Springer, 31\u201342.","journal-title":"In"},{"key":"e_1_3_4_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/tgis.13002"},{"key":"e_1_3_4_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00227"},{"issue":"1","key":"e_1_3_4_24_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TKDE.2021.3076144","article-title":"Towards indoor temporal-variation aware shortest path query","volume":"35","author":"Liu T.","year":"2021","unstructured":"Liu, T., et\u00a0al., 2021. Towards indoor temporal-variation aware shortest path query. IEEE Transactions on Knowledge and Data Engineering, 35 (1), 1\u20131.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/IGARSS.2015.7326839"},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2157493"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45814-4_11"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","DOI":"10.1080\/13658816.2019.1664741"},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2016.05.023"},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2009.117"},{"key":"e_1_3_4_31_1","first-page":"1","article-title":"Boosting vertex-cut partitioning for streaming graphs. ed","author":"Sajjad H.P.","year":"2016","unstructured":"Sajjad, H.P., et\u00a0al., 2016. Boosting vertex-cut partitioning for streaming graphs. ed. 2016 IEEE International Congress on Big Data (BigData Congress), 1\u20138.","journal-title":"2016 IEEE International Congress on Big Data (BigData Congress)"},{"key":"e_1_3_4_32_1","first-page":"293","article-title":"Lifelong Dynamic Timed A*(LTA*) for fastest path retrieval in congested road networks using predicted speeds. ed","author":"Sondhi K.","year":"2024","unstructured":"Sondhi, K., Dalapati, P., and Kumar, S., 2024. Lifelong Dynamic Timed A*(LTA*) for fastest path retrieval in congested road networks using predicted speeds. ed. VEHITS, 293\u2013298.","journal-title":"VEHITS,"},{"key":"e_1_3_4_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1463434.1463499"},{"key":"e_1_3_4_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23862-3_5"},{"key":"e_1_3_4_35_1","doi-asserted-by":"publisher","DOI":"10.1088\/1755-1315\/18\/1\/012123"},{"key":"e_1_3_4_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2016.04.007"},{"key":"e_1_3_4_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2015.2421493"},{"key":"e_1_3_4_38_1","first-page":"309","volume-title":"International Conference on Materials Engineering and Information Technology Applications (MEITA 2015)","author":"Xu Y.","year":"2015","unstructured":"Xu, Y., Wen, Z., and Zhang, X., 2015. Indoor optimal path planning based on Dijkstra Algorithm. ed. International Conference on Materials Engineering and Information Technology Applications (MEITA 2015), 309\u2013313."},{"key":"e_1_3_4_39_1","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/978-3-030-52249-0_39","article-title":"A comprehensive survey and analysis on path planning algorithms and heuristic functions. ed","volume":"1","author":"Yan B.","year":"2020","unstructured":"Yan, B., et\u00a0al., 2020. A comprehensive survey and analysis on path planning algorithms and heuristic functions. ed. Intelligent Computing: Proceedings of the 2020 Computing Conference, 1, 581\u2013598. Volume","journal-title":"Intelligent Computing: Proceedings of the 2020 Computing Conference,"},{"key":"e_1_3_4_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TransAI49837.2020.00018"},{"key":"e_1_3_4_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-020-09956-3"},{"key":"e_1_3_4_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098033"},{"key":"e_1_3_4_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/IGARSS.2018.8518507"},{"key":"e_1_3_4_44_1","first-page":"611","article-title":"Multi-objective indoor path planning method with dynamic environment awareness","volume":"54","author":"Zhou Y.","year":"2019","unstructured":"Zhou, Y., et\u00a0al., 2019. Multi-objective indoor path planning method with dynamic environment awareness. Journal of Southwest Jiaotong University, 54, 611\u2013618.","journal-title":"Journal of Southwest Jiaotong University,"},{"key":"e_1_3_4_45_1","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi9100558"},{"key":"e_1_3_4_46_1","first-page":"1","volume-title":"LBS 2021: 16th International Conference on Location Based Services, Glasgow\/Online","author":"Zhou Z.","year":"2021","unstructured":"Zhou, Z., et\u00a0al., November 24-25, 2021, 2021. Towards a hierarchical indoor data model from a route perspective. ed. LBS 2021: 16th International Conference on Location Based Services, Glasgow\/Online, 1\u20134."},{"key":"e_1_3_4_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compenvurbsys.2021.101751"}],"container-title":["International Journal of Geographical Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/13658816.2025.2457482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T12:29:57Z","timestamp":1749817797000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/13658816.2025.2457482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,30]]},"references-count":46,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,7,3]]}},"alternative-id":["10.1080\/13658816.2025.2457482"],"URL":"https:\/\/doi.org\/10.1080\/13658816.2025.2457482","relation":{},"ISSN":["1365-8816","1362-3087"],"issn-type":[{"value":"1365-8816","type":"print"},{"value":"1362-3087","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,30]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tgis20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tgis20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2024-04-22","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-20","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-01-30","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}