{"id":"https://openalex.org/W3125609744","doi":"https://doi.org/10.1109/access.2021.3053169","title":"A New Algorithm Based on Dijkstra for Vehicle Path Planning Considering Intersection Attribute","display_name":"A New Algorithm Based on Dijkstra for Vehicle Path Planning Considering Intersection Attribute","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3125609744","doi":"https://doi.org/10.1109/access.2021.3053169","mag":"3125609744"},"language":"en","primary_location":{"id":"doi:10.1109/access.2021.3053169","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2021.3053169","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/9312710/09328816.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/9312710/09328816.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015831760","display_name":"Dandan Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I136765683","display_name":"Tianjin University of Technology","ror":"https://ror.org/00zbe0w13","country_code":"CN","type":"education","lineage":["https://openalex.org/I136765683"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dan-Dan Zhu","raw_affiliation_strings":["Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, China"],"raw_orcid":"https://orcid.org/0000-0002-0278-1109","affiliations":[{"raw_affiliation_string":"Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, China","institution_ids":["https://openalex.org/I136765683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100663027","display_name":"Junqing Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I136765683","display_name":"Tianjin University of Technology","ror":"https://ror.org/00zbe0w13","country_code":"CN","type":"education","lineage":["https://openalex.org/I136765683"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jun-Qing Sun","raw_affiliation_strings":["Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology, Tianjin University of Technology, Tianjin, China","institution_ids":["https://openalex.org/I136765683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I136765683"],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":8.5877,"has_fulltext":true,"cited_by_count":149,"citation_normalized_percentile":{"value":0.98644512,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"9","issue":null,"first_page":"19761","last_page":"19775"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.998199999332428,"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"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11942","display_name":"Transportation and Mobility Innovations","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8112746477127075},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6823207139968872},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.6660387516021729},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6408889293670654},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6284873485565186},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6275935173034668},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5267336368560791},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5135188698768616},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4781145453453064},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4728425145149231},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4520733654499054},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.41042301058769226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2519186735153198},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1676928997039795},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15168869495391846},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.09339246153831482}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8112746477127075},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6823207139968872},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.6660387516021729},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6408889293670654},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6284873485565186},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6275935173034668},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5267336368560791},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5135188698768616},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4781145453453064},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4728425145149231},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4520733654499054},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.41042301058769226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2519186735153198},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1676928997039795},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15168869495391846},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09339246153831482},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2021.3053169","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2021.3053169","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/9312710/09328816.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:cb170d5c71a34defbeb048a11b556d00","is_oa":true,"landing_page_url":"https://doaj.org/article/cb170d5c71a34defbeb048a11b556d00","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 9, Pp 19761-19775 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2021.3053169","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2021.3053169","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/9312710/09328816.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7599999904632568}],"awards":[{"id":"https://openalex.org/G8863418517","display_name":"\u57fa\u4e8e\u591a\u81ea\u4e3b\u4f53\u7684\u96c6\u88c5\u7bb1\u591a\u5f0f\u8054\u8fd0\u534f\u8c03\u4e0e\u534f\u540c\u4f18\u5316\u7814\u7a76","funder_award_id":"71501141","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3125609744.pdf","grobid_xml":"https://content.openalex.org/works/W3125609744.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W2133962014","https://openalex.org/W2169528473","https://openalex.org/W2387412354","https://openalex.org/W2604821153","https://openalex.org/W2738294059","https://openalex.org/W2898360688","https://openalex.org/W2934525760","https://openalex.org/W2971981774","https://openalex.org/W3013518474","https://openalex.org/W4376454037","https://openalex.org/W6982403305","https://openalex.org/W7036019065"],"related_works":["https://openalex.org/W2886722595","https://openalex.org/W2990531685","https://openalex.org/W2170980056","https://openalex.org/W2379804627","https://openalex.org/W2363342665","https://openalex.org/W2359532380","https://openalex.org/W4310124294","https://openalex.org/W4221129498","https://openalex.org/W2375661673","https://openalex.org/W4402599120"],"abstract_inverted_index":{"Vehicle":[0],"path":[1,12,37],"planning":[2,38],"is":[3,20,30,101,188,203],"a":[4,52,76,85,118],"key":[5],"issue":[6],"for":[7,79,143],"car":[8],"navigation":[9],"systems.":[10],"When":[11,197],"planning,":[13],"considering":[14],"the":[15,25,36,49,56,62,65,68,80,98,104,107,114,126,131,137,140,144,162,181,185,198,207,210],"time":[16,60,121],"spent":[17],"at":[18],"intersections":[19],"more":[21],"in":[22,51],"line":[23],"with":[24],"actual":[26,127],"situation,":[27],"so":[28],"it":[29,100],"of":[31,58,106,139,151,153,184,192,200],"practical":[32],"significance":[33],"to":[34,64,96,135,160],"study":[35,48],"problem":[39,50],"take":[40],"account":[41],"intersection":[42],"attributes.":[43],"In":[44],"this":[45,72],"article,":[46],"we":[47,74,124],"deterministic":[53],"network,":[54],"taking":[55],"minimization":[57],"travel":[59],"from":[61],"origin":[63],"destination":[66],"as":[67,130],"optimization":[69],"goal.":[70],"For":[71],"purpose,":[73],"construct":[75],"mathematical":[77],"model":[78],"problem.":[81],"This":[82],"paper":[83],"proposes":[84],"reverse":[86],"labeling":[87],"Dijkstra":[88,94],"algorithm":[89,95,109,116,141,187,208],"(RLDA)":[90],"based":[91],"on":[92],"traditional":[93],"solve":[97],"problem,":[99],"proved":[102],"that":[103,113,180,191],"correctness":[105],"RLDA":[108,115,169,186],"theoretically,":[110],"and":[111,156,165,170,195],"analyze":[112],"has":[117,209],"lower":[119],"polynomial":[120],"complexity.":[122],"Finally,":[123],"selected":[125],"road":[128],"network":[129,201],"simulation":[132],"experiment":[133],"object":[134],"verify":[136],"effectiveness":[138],"searching":[142],"optimal":[145],"path.":[146],"And":[147],"select":[148],"10":[149],"groups":[150],"networks":[152],"different":[154],"sizes":[155],"conduct":[157],"extensive":[158],"experiments":[159],"compare":[161],"convergence":[163,182],"efficiency":[164],"calculation":[166],"speed":[167],"between":[168],"PSO,":[171],"GA,":[172],"ACO,":[173,193],"NNA,":[174,194],"OPABRL.":[175],"The":[176],"statistical":[177],"results":[178],"show":[179],"rate":[183],"better":[189],"than":[190,205],"GA.":[196],"number":[199],"nodes":[202],"less":[204],"350,":[206],"smallest":[211],"running":[212],"time.":[213]},"counts_by_year":[{"year":2026,"cited_by_count":7},{"year":2025,"cited_by_count":47},{"year":2024,"cited_by_count":35},{"year":2023,"cited_by_count":29},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":15}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}