{"id":"https://openalex.org/W3048463148","doi":"https://doi.org/10.1109/access.2020.3015976","title":"Surface Optimal Path Planning Using an Extended Dijkstra Algorithm","display_name":"Surface Optimal Path Planning Using an Extended Dijkstra Algorithm","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3048463148","doi":"https://doi.org/10.1109/access.2020.3015976","mag":"3048463148"},"language":"en","primary_location":{"id":"doi:10.1109/access.2020.3015976","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3015976","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09165710.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/8948470/09165710.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002711709","display_name":"Min Luo","orcid":"https://orcid.org/0000-0002-3154-1657"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]},{"id":"https://openalex.org/I165745306","display_name":"Southwest Petroleum University","ror":"https://ror.org/03h17x602","country_code":"CN","type":"education","lineage":["https://openalex.org/I165745306"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Min Luo","raw_affiliation_strings":["School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China","School of Electrical Engineering and Information, Southwest Petroleum University, Chengdu, China"],"raw_orcid":"https://orcid.org/0000-0002-3154-1657","affiliations":[{"raw_affiliation_string":"School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China","institution_ids":["https://openalex.org/I150229711"]},{"raw_affiliation_string":"School of Electrical Engineering and Information, Southwest Petroleum University, Chengdu, China","institution_ids":["https://openalex.org/I165745306"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007919131","display_name":"Xiaorong Hou","orcid":"https://orcid.org/0000-0001-8217-8491"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaorong Hou","raw_affiliation_strings":["School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China"],"raw_orcid":"https://orcid.org/0000-0001-8217-8491","affiliations":[{"raw_affiliation_string":"School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China","institution_ids":["https://openalex.org/I150229711"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100645589","display_name":"Jing Yang","orcid":"https://orcid.org/0000-0002-6009-864X"},"institutions":[{"id":"https://openalex.org/I150229711","display_name":"University of Electronic Science and Technology of China","ror":"https://ror.org/04qr3zq92","country_code":"CN","type":"education","lineage":["https://openalex.org/I150229711"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jing Yang","raw_affiliation_strings":["School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu, China","institution_ids":["https://openalex.org/I150229711"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":8.5292,"has_fulltext":true,"cited_by_count":225,"citation_normalized_percentile":{"value":0.983312,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"8","issue":null,"first_page":"147827","last_page":"147838"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9944999814033508,"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"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9921000003814697,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.7902784943580627},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.6587764620780945},{"id":"https://openalex.org/keywords/surface","display_name":"Surface (topology)","score":0.5940559506416321},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.593669056892395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5629995465278625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5607572793960571},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5425311923027039},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4504276216030121},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4488353133201599},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4376624822616577},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.36265307664871216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2995484471321106},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.27619093656539917},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2586570382118225},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.17576205730438232},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10163962841033936},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07419607043266296}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.7902784943580627},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.6587764620780945},{"id":"https://openalex.org/C2776799497","wikidata":"https://www.wikidata.org/wiki/Q484298","display_name":"Surface (topology)","level":2,"score":0.5940559506416321},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.593669056892395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5629995465278625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5607572793960571},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5425311923027039},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4504276216030121},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4488353133201599},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4376624822616577},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.36265307664871216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2995484471321106},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.27619093656539917},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2586570382118225},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.17576205730438232},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10163962841033936},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07419607043266296},{"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/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.2020.3015976","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3015976","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09165710.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:3ab3a6dd64c8405cb2776aa9759928bd","is_oa":true,"landing_page_url":"https://doaj.org/article/3ab3a6dd64c8405cb2776aa9759928bd","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 8, Pp 147827-147838 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2020.3015976","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3015976","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/8948470/09165710.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":[{"display_name":"Sustainable cities and communities","score":0.7400000095367432,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3048463148.pdf","grobid_xml":"https://content.openalex.org/works/W3048463148.grobid-xml"},"referenced_works_count":31,"referenced_works":["https://openalex.org/W1486649110","https://openalex.org/W1551702556","https://openalex.org/W1569843351","https://openalex.org/W1582102377","https://openalex.org/W1602233032","https://openalex.org/W1606326500","https://openalex.org/W1987005655","https://openalex.org/W2024244897","https://openalex.org/W2036604449","https://openalex.org/W2049802874","https://openalex.org/W2066515068","https://openalex.org/W2108074815","https://openalex.org/W2111613656","https://openalex.org/W2134059208","https://openalex.org/W2165049137","https://openalex.org/W2341115255","https://openalex.org/W2569482740","https://openalex.org/W2622276994","https://openalex.org/W2767791953","https://openalex.org/W2772756146","https://openalex.org/W2791724942","https://openalex.org/W2794938596","https://openalex.org/W2892165060","https://openalex.org/W2909662287","https://openalex.org/W2913740161","https://openalex.org/W2925299343","https://openalex.org/W2966130688","https://openalex.org/W2966349636","https://openalex.org/W2976952230","https://openalex.org/W3009955231","https://openalex.org/W6636434007"],"related_works":["https://openalex.org/W4223969905","https://openalex.org/W2363342665","https://openalex.org/W2379804627","https://openalex.org/W2170980056","https://openalex.org/W2990531685","https://openalex.org/W3088868185","https://openalex.org/W2359532380","https://openalex.org/W2886722595","https://openalex.org/W4310124294","https://openalex.org/W2373384475"],"abstract_inverted_index":{"Extensive":[0],"studies":[1],"have":[2,18],"been":[3],"conducted":[4],"on":[5,64,74,83,106],"the":[6,20,42,55,60,66,71,75,84,93,99,103,111,118,123,128,132,136,141,146,157,164,167],"Dijkstra":[7,51,159],"algorithm":[8],"owing":[9],"to":[10,40,58,140],"its":[11],"bright":[12],"prospect.":[13],"However,":[14],"few":[15],"of":[16,24,98,117,166],"them":[17],"studied":[19],"surface":[21,44,61,76,100,143,147,168],"path":[22,170,177],"planning":[23,178],"mobile":[25],"robots.":[26],"Currently,":[27],"some":[28],"application":[29],"fields":[30],"(e.g.,":[31],"wild":[32],"ground,":[33,35],"planet":[34],"and":[36,101,114,174],"game":[37],"scene)":[38],"need":[39],"solve":[41,102],"optimal":[43,104,129,148],"path.":[45,149],"This":[46],"paper":[47],"proposes":[48],"an":[49],"extended":[50],"algorithm.":[52],"We":[53],"utilize":[54],"Delaunay":[56],"triangulation":[57],"model":[59],"environment.":[62],"Based":[63],"keeping":[65],"triangle":[67,72,82],"side":[68],"length":[69],"unchanged,":[70],"mesh":[73],"is":[77],"equivalently":[78],"converted":[79],"into":[80],"a":[81],"two-dimensional":[85,94,112,137],"plane.":[86],"Through":[87],"this":[88,107,161],"transformation,":[89],"we":[90,120],"set":[91],"up":[92],"developable":[95,113],"passable":[96,115],"channel":[97],"route":[105,125],"channel.":[108],"Traversing":[109],"all":[110,127],"paths":[116],"surface,":[119],"can":[121],"get":[122],"shortest":[124],"among":[126],"paths.":[130],"Then":[131],"inverse":[133],"transformation":[134],"from":[135],"plane":[138],"coordinates":[139,144],"corresponding":[142],"obtains":[145],"The":[150],"simulation":[151],"results":[152],"show":[153],"that,":[154],"compared":[155],"with":[156],"traditional":[158],"algorithm,":[160],"method":[162],"improves":[163],"accuracy":[165],"optimization":[169],"in":[171],"single-robot":[172],"single-target":[173],"multi-robot":[175],"multi-target":[176],"tasks.":[179]},"counts_by_year":[{"year":2026,"cited_by_count":12},{"year":2025,"cited_by_count":52},{"year":2024,"cited_by_count":72},{"year":2023,"cited_by_count":38},{"year":2022,"cited_by_count":33},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}