{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:16:35Z","timestamp":1743020195944,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031245206"},{"type":"electronic","value":"9783031245213"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-24521-3_1","type":"book-chapter","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T12:12:28Z","timestamp":1673957548000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Coarse-Grained Path Planning Under Dynamic Situational Environment"],"prefix":"10.1007","author":[{"given":"Mengmeng","family":"Chang","sequence":"first","affiliation":[]},{"given":"Zhiming","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Lutong","family":"Li","sequence":"additional","affiliation":[]},{"given":"Nannan","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,18]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","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."},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"E Hart","year":"1968","unstructured":"Hart, E., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. SSC 4(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern. SSC"},{"key":"1_CR3","unstructured":"Noreen, I., Khan, A., Habib, Z.: A comparison of RRT, RRT* and RRT*-smart path planning algorithms (2016)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"14523","DOI":"10.1109\/TVT.2020.3043306","volume":"69","author":"OS Oubbati","year":"2020","unstructured":"Oubbati, O.S., Atiquzzaman, M., Lorenz, P., et al.: SEARCH: an SDN-enabled approach for vehicle path-planning. IEEE Trans. Veh. Technol. 69, 14523\u201314536 (2020)","journal-title":"IEEE Trans. Veh. Technol."},{"issue":"MAY 1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1016\/j.scitotenv.2019.01.222","volume":"663","author":"D Guo","year":"2019","unstructured":"Guo, D., Wang, J., Zhao, J.B., et al.: A vehicle path planning method based on a dynamic traffic network that considers fuel consumption and emissions. Sci. Total Environ. 663(MAY 1), 935\u2013943 (2019)","journal-title":"Sci. Total Environ."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., et al.: Fast shortest path distance estimation in large networks. In: Conference on Information and Knowledge Management, pp. 867\u2013876 (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.procs.2020.06.109","volume":"174","author":"CA Yan","year":"2020","unstructured":"Yan, C.A., Adb, C., Yi, S.B.: Road-condition-aware dynamic path planning for intelligent vehicles. Proc. Comput. Sci. 174, 419\u2013423 (2020)","journal-title":"Proc. Comput. Sci."},{"issue":"6","key":"1_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/MWC.001.1900151","volume":"26","author":"A Ahmad","year":"2019","unstructured":"Ahmad, A., Din, S., Paul, A., et al.: Real-time route planning and data dissemination for urban scenarios using the internet of things. IEEE Wirel. Commun. 26(6), 50\u201355 (2019)","journal-title":"IEEE Wirel. Commun."},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Ma, A., Ouimet, M., Cort\u00e9s, J.: Hierarchical reinforcement learning via dynamic subspace search for multi-agent planning. Auton. Robots. 44(3-4), 485\u2013503 (2020)","DOI":"10.1007\/s10514-019-09871-2"},{"issue":"5","key":"1_CR10","first-page":"542","volume":"32","author":"E Cohen","year":"2002","unstructured":"Cohen, E., Halperin, E., Kaplan, H., et al.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 542\u2013556 (2002)","journal-title":"SIAM J. Comput."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling (2013)","DOI":"10.1145\/2463676.2465315"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling. In: Proceedings of the 23rd International Conference on World Wide Web, pp. 237\u2013248. ACM (2014)","DOI":"10.1145\/2566486.2568007"},{"issue":"6","key":"1_CR13","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/90.893870","volume":"8","author":"P Narvaez","year":"2000","unstructured":"Narvaez, P., Siu, K.Y., Tzeng, H.Y.: New dynamic algorithms for shortest path tree computation. IEEE\/ACM Trans. Netw. 8(6), 734\u2013746 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Hayashi, T., Akiba, T., Kawarabayashi, K.I.: Fully dynamic shortest-path distance query acceleration on massive networks (2016)","DOI":"10.1145\/2983323.2983731"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Tretyakov, K., Armas-Cervantes, A., Garc\u00eda-Bauelos, L., et al.: Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In: ACM International Conference on Information and Knowledge Management. ACM (2011)","DOI":"10.1145\/2063576.2063834"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Yu, Z., Yu, X., Koudas, N., et al.: Distributed processing of k shortest path queries over dynamic road networks (2020)","DOI":"10.1145\/3318464.3389735"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s41060-019-00189-x","volume":"9","author":"I Tsalouchidou","year":"2020","unstructured":"Tsalouchidou, I., Baeza-Yates, R., Bonchi, F., et al.: Temporal betweenness centrality in dynamic graphs. Int. J. Data Sci. Anal. 9(3), 257\u2013272 (2020)","journal-title":"Int. J. Data Sci. Anal."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Kawarabayashi, K., et al.: Fast shortest-path distance queries on road networks by pruned highway labeling. In: 2014 Proceedings the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 147\u2013154. Society for Industrial and Applied Mathematics (2014)","DOI":"10.1137\/1.9781611973198.14"},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"48","DOI":"10.14778\/2850578.2850580","volume":"9","author":"T Hayashi","year":"2015","unstructured":"Hayashi, T., Akiba, T., Yoshida, Y.: Fully dynamic betweenness centrality maintenance on massive networks. Proc. VLDB Endow. 9(2), 48\u201359 (2015)","journal-title":"Proc. VLDB Endow."},{"issue":"9","key":"1_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2015-60657-4","volume":"88","author":"P Holme","year":"2015","unstructured":"Holme, P.: Modern temporal network theory: a colloquium. Eur. Phys. J. B 88(9), 1\u201330 (2015). https:\/\/doi.org\/10.1140\/epjb\/e2015-60657-4","journal-title":"Eur. Phys. J. B"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/16M1066142","volume":"15","author":"D Taylor","year":"2017","unstructured":"Taylor, D., Myers, S.A., Clauset, A., et al.: Eigenvector-based centrality measures for temporal networks. Multisc. Model. Simul. 15(1), 537\u2013574 (2017)","journal-title":"Multisc. Model. Simul."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.chaos.2014.12.009","volume":"72","author":"A Alsayed","year":"2015","unstructured":"Alsayed, A., Higham, D.J.: Betweenness in time dependent networks. Chaos Solitons Fractals 72, 35\u201348 (2015)","journal-title":"Chaos Solitons Fractals"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1140\/epjb\/e2016-60498-7","volume":"89","author":"T Takaguchi","year":"2016","unstructured":"Takaguchi, T., Yano, Y., Yoshida, Y.: Coverage centralities for temporal networks. Eur. Phys. J. B 89(2), 1\u201311 (2016). https:\/\/doi.org\/10.1140\/epjb\/e2016-60498-7","journal-title":"Eur. Phys. J. B"},{"issue":"9","key":"1_CR24","doi-asserted-by":"publisher","first-page":"8012","DOI":"10.1109\/JIOT.2020.2994963","volume":"7","author":"C Lin","year":"2020","unstructured":"Lin, C., Han, G., Du, J., et al.: Spatiotemporal congestion-aware path planning toward intelligent transportation systems in software-defined smart city IoT. IEEE Internet Things J. 7(9), 8012\u20138024 (2020)","journal-title":"IEEE Internet Things J."},{"key":"1_CR25","unstructured":"Kicki, P., Gawron, T., Skrzypczy\u0144ski, P.: A Self-supervised learning approach to rapid path planning for car-like vehicles maneuvering in urban environment (2020)"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Zakrzewska, A., Bader, D.A.: A dynamic algorithm for local community detection in graphs. In: Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining 2015, pp. 559\u2013564. ACM (2015)","DOI":"10.1145\/2808797.2809375"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Stanton, I., Kliot, G.: Streaming graph partitioning for large distributed graphs. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1222\u20131230. ACM (2012)","DOI":"10.1145\/2339530.2339722"}],"container-title":["Lecture Notes in Computer Science","Spatial Data and Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24521-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T00:12:30Z","timestamp":1680653550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24521-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031245206","9783031245213"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24521-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"18 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SpatialDI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Spatial Data and Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spatialdi2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spatialdi2022.cug.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"77","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}