{"id":"https://openalex.org/W2087489341","doi":"https://doi.org/10.1109/igarss.2014.6947135","title":"A re-optimization dynamic shortest path algorithm for vehicle navigation","display_name":"A re-optimization dynamic shortest path algorithm for vehicle navigation","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2087489341","doi":"https://doi.org/10.1109/igarss.2014.6947135","mag":"2087489341"},"language":"en","primary_location":{"id":"doi:10.1109/igarss.2014.6947135","is_oa":false,"landing_page_url":"https://doi.org/10.1109/igarss.2014.6947135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Geoscience and Remote Sensing Symposium","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070181158","display_name":"Jincheng Jiang","orcid":"https://orcid.org/0000-0001-5522-6910"},"institutions":[{"id":"https://openalex.org/I25254941","display_name":"Beijing Normal University","ror":"https://ror.org/022k4wk35","country_code":"CN","type":"education","lineage":["https://openalex.org/I25254941"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jincheng Jiang","raw_affiliation_strings":["Academy of Disaster Reduction and Emergency Management, Beijing Normal University, Beijing, China","Academy of Disaster Reduction & Emergency Management, Beijing Normal University, Beijing 100875, China"],"affiliations":[{"raw_affiliation_string":"Academy of Disaster Reduction and Emergency Management, Beijing Normal University, Beijing, China","institution_ids":["https://openalex.org/I25254941"]},{"raw_affiliation_string":"Academy of Disaster Reduction & Emergency Management, Beijing Normal University, Beijing 100875, China","institution_ids":["https://openalex.org/I25254941"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103510331","display_name":"Lixin Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I25757504","display_name":"China University of Mining and Technology","ror":"https://ror.org/01xt2dr21","country_code":"CN","type":"education","lineage":["https://openalex.org/I25757504"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Lixin Wu","raw_affiliation_strings":["IoT Perception Mine Research Center, China University of Mining and Technology, Xuzhou, China","IOT Perception Mine Research Center, China University of Mining and Technology, Xuzhou 221008, China"],"affiliations":[{"raw_affiliation_string":"IoT Perception Mine Research Center, China University of Mining and Technology, Xuzhou, China","institution_ids":["https://openalex.org/I25757504"]},{"raw_affiliation_string":"IOT Perception Mine Research Center, China University of Mining and Technology, Xuzhou 221008, China","institution_ids":["https://openalex.org/I25757504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070181158"],"corresponding_institution_ids":["https://openalex.org/I25254941"],"apc_list":null,"apc_paid":null,"fwci":0.5823,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.68645833,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"3109","last_page":"3112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8477065563201904},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7117579579353333},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.709995448589325},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6288838386535645},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6147118210792542},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5729276537895203},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.570372462272644},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5359642505645752},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.517802357673645},{"id":"https://openalex.org/keywords/travel-time","display_name":"Travel time","score":0.5144679546356201},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.42859163880348206},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.4258943498134613},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.41490602493286133},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4083189368247986},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38065260648727417},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1222948431968689},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12161144614219666},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11108052730560303},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09409841895103455},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08305463194847107},{"id":"https://openalex.org/keywords/transport-engineering","display_name":"Transport engineering","score":0.07670912146568298}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8477065563201904},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7117579579353333},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.709995448589325},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6288838386535645},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6147118210792542},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5729276537895203},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.570372462272644},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5359642505645752},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.517802357673645},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.5144679546356201},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.42859163880348206},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4258943498134613},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.41490602493286133},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4083189368247986},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38065260648727417},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1222948431968689},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12161144614219666},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11108052730560303},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09409841895103455},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08305463194847107},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.07670912146568298}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/igarss.2014.6947135","is_oa":false,"landing_page_url":"https://doi.org/10.1109/igarss.2014.6947135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Geoscience and Remote Sensing Symposium","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320335773","display_name":"National High-tech Research and Development Program","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W570927969","https://openalex.org/W633205017","https://openalex.org/W1524281075","https://openalex.org/W1969483458","https://openalex.org/W1990043277","https://openalex.org/W1996548298","https://openalex.org/W2017694061","https://openalex.org/W2029706450","https://openalex.org/W2033471184","https://openalex.org/W2034204928","https://openalex.org/W2048815087","https://openalex.org/W2058605898","https://openalex.org/W2059547694","https://openalex.org/W2069480138","https://openalex.org/W2079274727","https://openalex.org/W2093746928","https://openalex.org/W2119257015","https://openalex.org/W2136444822","https://openalex.org/W2169528473","https://openalex.org/W2319431290","https://openalex.org/W6620448405"],"related_works":["https://openalex.org/W2136320479","https://openalex.org/W4281943708","https://openalex.org/W2810620529","https://openalex.org/W2348287729","https://openalex.org/W3015233512","https://openalex.org/W4253588386","https://openalex.org/W1562631103","https://openalex.org/W2381351584","https://openalex.org/W2372677512","https://openalex.org/W2514247065"],"abstract_inverted_index":{"The":[0,51],"traffic":[1],"congestion":[2],"changes":[3],"over":[4],"time":[5,23,67],"in":[6,86],"the":[7,12,20,48,57,70,77,87,94,104],"real":[8],"transportation":[9,34,88],"network,":[10],"and":[11,22,99],"vehicle":[13,84],"navigation":[14,26,85],"is":[15],"a":[16],"real-time":[17],"processing.":[18],"Both":[19],"accuracy":[21],"performance":[24],"of":[25,56,93],"algorithm":[27],"are":[28],"important.":[29],"To":[30],"respond":[31],"rapidly":[32],"to":[33,68,83],"network":[35,89],"changes,":[36],"this":[37],"paper":[38],"proposes":[39],"two":[40],"new":[41],"dynamic":[42,91],"shortest":[43],"path":[44],"algorithms":[45,52,79],"based":[46],"on":[47,97],"re-optimization":[49],"method.":[50],"take":[53,63],"full":[54],"advantage":[55],"previous":[58],"search":[59],"results,":[60],"thus":[61],"they":[62],"relatively":[64],"few":[65],"computing":[66],"obtain":[69],"optimal":[71],"solution.":[72],"Experimental":[73],"results":[74],"demonstrate":[75],"that":[76],"proposed":[78],"can":[80],"be":[81],"applied":[82],"with":[90],"variation":[92],"travel":[95],"times":[96],"arcs":[98],"runs":[100],"much":[101],"faster":[102],"than":[103],"traditional":[105],"Dijkstra":[106],"algorithm.":[107]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}