{"id":"https://openalex.org/W1592300291","doi":"https://doi.org/10.1007/0-387-34403-9_35","title":"An Effective Algorithm of Shortest Path Planning in a Static Environment","display_name":"An Effective Algorithm of Shortest Path Planning in a Static Environment","publication_year":2006,"publication_date":"2006-08-29","ids":{"openalex":"https://openalex.org/W1592300291","doi":"https://doi.org/10.1007/0-387-34403-9_35","mag":"1592300291"},"language":"en","primary_location":{"id":"doi:10.1007/0-387-34403-9_35","is_oa":false,"landing_page_url":"https://doi.org/10.1007/0-387-34403-9_35","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"},"type":"book-chapter","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/A5100930470","display_name":"Lingyu Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I14748160","display_name":"Jinggangshan University","ror":"https://ror.org/04exd0a76","country_code":"CN","type":"education","lineage":["https://openalex.org/I14748160"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lingyu Sun","raw_affiliation_strings":["Department of Computer Science, Jinggangshan College, Ji\u2019an, China","Jinggangshan College"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Jinggangshan College, Ji\u2019an, China","institution_ids":["https://openalex.org/I14748160"]},{"raw_affiliation_string":"Jinggangshan College","institution_ids":["https://openalex.org/I14748160"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100419204","display_name":"Xuemei Liu","orcid":"https://orcid.org/0000-0002-6738-0787"},"institutions":[{"id":"https://openalex.org/I74485261","display_name":"Shandong Agricultural University","ror":"https://ror.org/02ke8fw32","country_code":"CN","type":"education","lineage":["https://openalex.org/I74485261"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuemei Liu","raw_affiliation_strings":["School of Mechanical & Electronic Engineering, Shandong Agricultural University, China","SHANDONG AGRICULTURAL UNIVERSITY"],"affiliations":[{"raw_affiliation_string":"School of Mechanical & Electronic Engineering, Shandong Agricultural University, China","institution_ids":["https://openalex.org/I74485261"]},{"raw_affiliation_string":"SHANDONG AGRICULTURAL UNIVERSITY","institution_ids":["https://openalex.org/I74485261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071836942","display_name":"Ming Leng","orcid":null},"institutions":[{"id":"https://openalex.org/I141962983","display_name":"Shanghai University of Engineering Science","ror":"https://ror.org/0557b9y08","country_code":"CN","type":"education","lineage":["https://openalex.org/I141962983"]},{"id":"https://openalex.org/I113940042","display_name":"Shanghai University","ror":"https://ror.org/006teas31","country_code":"CN","type":"education","lineage":["https://openalex.org/I113940042"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ming Leng","raw_affiliation_strings":["School of Computer Engineering and Science, Shanghai University, Shanghai, China","Shanghai University"],"affiliations":[{"raw_affiliation_string":"School of Computer Engineering and Science, Shanghai University, Shanghai, China","institution_ids":["https://openalex.org/I141962983"]},{"raw_affiliation_string":"Shanghai University","institution_ids":["https://openalex.org/I113940042"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100930470"],"corresponding_institution_ids":["https://openalex.org/I14748160"],"apc_list":null,"apc_paid":null,"fwci":0.3166,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.56447921,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"257","last_page":"262"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"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.9994000196456909,"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/T12288","display_name":"Optimization and Search Problems","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7701727151870728},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7631494998931885},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7168335914611816},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6204156875610352},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.6141632795333862},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.6038891673088074},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5687437653541565},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5530475378036499},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5502536296844482},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.539764404296875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.518812358379364},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5112514495849609},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5064631700515747},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4932782053947449},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.4891231656074524},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.46474048495292664},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.421358585357666},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.41526585817337036},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.38399970531463623},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.339402437210083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3057507872581482},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2221238613128662},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21387061476707458}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7701727151870728},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7631494998931885},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7168335914611816},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6204156875610352},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.6141632795333862},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.6038891673088074},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5687437653541565},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5530475378036499},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5502536296844482},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.539764404296875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.518812358379364},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5112514495849609},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5064631700515747},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4932782053947449},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4891231656074524},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.46474048495292664},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.421358585357666},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.41526585817337036},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.38399970531463623},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.339402437210083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3057507872581482},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2221238613128662},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21387061476707458},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/0-387-34403-9_35","is_oa":false,"landing_page_url":"https://doi.org/10.1007/0-387-34403-9_35","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IFIP International Federation for Information Processing","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1559215823","https://openalex.org/W1584169088","https://openalex.org/W1604021722","https://openalex.org/W1809059965","https://openalex.org/W1957996277","https://openalex.org/W1969483458","https://openalex.org/W1981031568","https://openalex.org/W2122410182","https://openalex.org/W2169528473","https://openalex.org/W2339500526","https://openalex.org/W4244635418"],"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/W2381351584","https://openalex.org/W2372677512","https://openalex.org/W2514247065","https://openalex.org/W2348177054"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}