{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T06:27:00Z","timestamp":1768458420843,"version":"3.49.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62472027"],"award-info":[{"award-number":["62472027"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202046"],"award-info":[{"award-number":["62202046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62394332"],"award-info":[{"award-number":["62394332"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21A20516"],"award-info":[{"award-number":["U21A20516"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21B2007"],"award-info":[{"award-number":["U21B2007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018617","name":"Liaoning Revitalization Talents Program","doi-asserted-by":"publisher","award":["XLYC2204005"],"award-info":[{"award-number":["XLYC2204005"]}],"id":[{"id":"10.13039\/501100018617","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62427808"],"award-info":[{"award-number":["62427808"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ARC Discovery Project","award":["DP240100356"],"award-info":[{"award-number":["DP240100356"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1109\/tkde.2025.3591460","type":"journal-article","created":{"date-parts":[[2025,7,22]],"date-time":"2025-07-22T18:07:28Z","timestamp":1753207648000},"page":"7154-7168","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing Global Path Planning via Simple Queries Across Multiple Platforms"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8696-9685","authenticated-orcid":false,"given":"Yurong","family":"Cheng","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Beijing Insitute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4639-1278","authenticated-orcid":false,"given":"Xiaoxi","family":"Cui","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Insitute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0247-9866","authenticated-orcid":false,"given":"Ye","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Insitute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1302-818X","authenticated-orcid":false,"given":"Xiangmin","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Science, RMIT University, Melbourne, VIC, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0181-8379","authenticated-orcid":false,"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Insitute of Technology, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.36"},{"key":"ref2","first-page":"2118","article-title":"Optimal route search with the coverage of users\u2019 preferences","volume-title":"Proc. 24th Int. Joint Conf. Artif. Intell.","author":"Zeng"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/167"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00035"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0278364910386259"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-015-0227-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v30i1.6678"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103624"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6224710"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/21680566.2018.1496861"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/470"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/503"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/ett.2704"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4009"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-14391-5_6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2911697"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref19","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","volume-title":"Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Goldberg"},{"key":"ref20","first-page":"100","article-title":"Reach-based routing: A new approach to shortest path algorithms optimized for road networks","volume-title":"Proc. 6th Workshop Algorithm Eng. Experiments 1st Workshop Anal. Algorithmics Combinatorics","author":"Gutman"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353371"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342265"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05813-9_9"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236211"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368297"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00086"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3488723"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/470"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2018.2876830"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00162"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00008"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00102"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539047"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.14778\/3561261.3561266"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918780335"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00030"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992698"},{"key":"ref38","article-title":"Playing atari with deep reinforcement learning","author":"Mnih","year":"2013"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.10295"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71682-4_5"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1997.9.8.1735"},{"key":"ref42","first-page":"41753","article-title":"Provable dynamic fusion for low-quality multimodal data","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref43","first-page":"7034","article-title":"Confidence-aware learning for deep neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Moon"},{"key":"ref44","first-page":"37704","article-title":"UMIX: Improving importance weighting for subpopulation shift via uncertainty-aware mixup","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Han"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015231126594"},{"key":"ref46","article-title":"Optimization, learning and natural algorithms","author":"Dorigo","year":"1992"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/11233837\/11090024.pdf?arnumber=11090024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T19:09:52Z","timestamp":1762888192000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11090024\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":46,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2025.3591460","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]}}}