{"id":"https://openalex.org/W3015233512","doi":"https://doi.org/10.1145/3378065.3378106","title":"Application of Improved Dijkstra Algorithm in Two-dimensional Path Planning Problem","display_name":"Application of Improved Dijkstra Algorithm in Two-dimensional Path Planning Problem","publication_year":2019,"publication_date":"2019-11-16","ids":{"openalex":"https://openalex.org/W3015233512","doi":"https://doi.org/10.1145/3378065.3378106","mag":"3015233512"},"language":"en","primary_location":{"id":"doi:10.1145/3378065.3378106","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3378065.3378106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 4th International Conference on Intelligent Information Processing","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/A5103709650","display_name":"Zhang Ruifang","orcid":null},"institutions":[{"id":"https://openalex.org/I38706770","display_name":"Guilin University of Technology","ror":"https://ror.org/03z391397","country_code":"CN","type":"education","lineage":["https://openalex.org/I38706770"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhang Ruifang","raw_affiliation_strings":["Department of Guilin University of Technology, Guilin City, the Guangxi Zhuang Autonomous Region"],"affiliations":[{"raw_affiliation_string":"Department of Guilin University of Technology, Guilin City, the Guangxi Zhuang Autonomous Region","institution_ids":["https://openalex.org/I38706770"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066029955","display_name":"Ji Tianyi","orcid":"https://orcid.org/0009-0002-1886-4598"},"institutions":[{"id":"https://openalex.org/I38706770","display_name":"Guilin University of Technology","ror":"https://ror.org/03z391397","country_code":"CN","type":"education","lineage":["https://openalex.org/I38706770"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ji Tianyi","raw_affiliation_strings":["Department of Guilin University of Technology, Guilin City, the Guangxi Zhuang Autonomous Region"],"affiliations":[{"raw_affiliation_string":"Department of Guilin University of Technology, Guilin City, the Guangxi Zhuang Autonomous Region","institution_ids":["https://openalex.org/I38706770"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014340711","display_name":"Zheng Haitao","orcid":null},"institutions":[{"id":"https://openalex.org/I38706770","display_name":"Guilin University of Technology","ror":"https://ror.org/03z391397","country_code":"CN","type":"education","lineage":["https://openalex.org/I38706770"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zheng Haitao","raw_affiliation_strings":["Department of Guilin University of Technology, Guilin City, the Guangxi Zhuang Autonomous Region"],"affiliations":[{"raw_affiliation_string":"Department of Guilin University of Technology, Guilin City, the Guangxi Zhuang Autonomous Region","institution_ids":["https://openalex.org/I38706770"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5103709650"],"corresponding_institution_ids":["https://openalex.org/I38706770"],"apc_list":null,"apc_paid":null,"fwci":0.2024,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.57116844,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"211","last_page":"215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9660000205039978,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9182000160217285,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.9338664412498474},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.8445847034454346},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.8379407525062561},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.8058101534843445},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.7282167077064514},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6949908137321472},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.686156690120697},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6575878262519836},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.6238802671432495},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6158703565597534},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.507707953453064},{"id":"https://openalex.org/keywords/roulette","display_name":"Roulette","score":0.5076767206192017},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4941568672657013},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47604894638061523},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4655289053916931},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.262068510055542},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1860450804233551},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18493130803108215},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10132816433906555},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07813772559165955},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.05905628204345703}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.9338664412498474},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.8445847034454346},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.8379407525062561},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.8058101534843445},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.7282167077064514},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6949908137321472},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.686156690120697},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6575878262519836},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.6238802671432495},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6158703565597534},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.507707953453064},{"id":"https://openalex.org/C195502155","wikidata":"https://www.wikidata.org/wiki/Q2810237","display_name":"Roulette","level":2,"score":0.5076767206192017},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4941568672657013},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47604894638061523},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4655289053916931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.262068510055542},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1860450804233551},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18493130803108215},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10132816433906555},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07813772559165955},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.05905628204345703},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3378065.3378106","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3378065.3378106","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 4th International Conference on Intelligent Information Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2966130688"],"related_works":["https://openalex.org/W2300444527","https://openalex.org/W3205035283","https://openalex.org/W2810620529","https://openalex.org/W4253588386","https://openalex.org/W2348287729","https://openalex.org/W1508906807","https://openalex.org/W1562631103","https://openalex.org/W2147862592","https://openalex.org/W2100214387","https://openalex.org/W2381419702"],"abstract_inverted_index":{"The":[0,95],"Dijkstra":[1,55,88,93],"algorithm":[2,9,56,63,89,102],"is":[3,78],"a":[4,22],"typical":[5],"single-source":[6],"shortest":[7,13],"path":[8,14,72,106],"for":[10],"calculating":[11],"the":[12,19,30,35,43,47,53,59,62,81,86,91,100,105,111],"from":[15],"one":[16],"node":[17,36],"to":[18,57,84],"other":[20],"in":[21,68],"non-negative":[23],"weight":[24],"map,":[25],"but":[26],"its":[27,66],"use":[28],"of":[29,45,61],"roulette":[31],"method":[32],"greatly":[33,103],"affects":[34],"selection.":[37],"Speed":[38],"and":[39,64,90,109],"efficiency.":[40,113],"Therefore,":[41],"on":[42],"basis":[44],"ensuring":[46],"search":[48],"accuracy,":[49],"this":[50,75],"paper":[51],"improves":[52,110],"initial":[54,87],"improve":[58],"efficiency":[60],"meet":[65],"needs":[67],"2D":[69],"or":[70],"3D":[71],"planning.":[73],"In":[74],"paper,":[76],"MATLAB2018a":[77],"used":[79],"as":[80],"experimental":[82,96],"platform":[83],"simulate":[85],"improved":[92,101],"algorithm.":[94],"results":[97],"show":[98],"that":[99],"reduces":[104],"planning":[107],"vision":[108],"operating":[112]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}