{"id":"https://openalex.org/W4414432989","doi":"https://doi.org/10.1109/case58245.2025.11164160","title":"An Efficient and Unified Method for Extracting the Shortest Path from the Dubins Set","display_name":"An Efficient and Unified Method for Extracting the Shortest Path from the Dubins Set","publication_year":2025,"publication_date":"2025-08-17","ids":{"openalex":"https://openalex.org/W4414432989","doi":"https://doi.org/10.1109/case58245.2025.11164160"},"language":"en","primary_location":{"id":"doi:10.1109/case58245.2025.11164160","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case58245.2025.11164160","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 21st International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101220652","display_name":"Xuanhao Huang","orcid":"https://orcid.org/0000-0002-4801-2815"},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuanhao Huang","raw_affiliation_strings":["Xi’an Jiaotong University,State Key Laboratory for Manufacturing Systems Engineering, School of Automation Science and Engineering, Faculty of Electronic and Information Engineering,Xi’an,China,710049"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi’an Jiaotong University,State Key Laboratory for Manufacturing Systems Engineering, School of Automation Science and Engineering, Faculty of Electronic and Information Engineering,Xi’an,China,710049","institution_ids":["https://openalex.org/I87445476"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043647130","display_name":"Chao-Bo Yan","orcid":"https://orcid.org/0000-0002-6396-0610"},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chao-Bo Yan","raw_affiliation_strings":["Xi’an Jiaotong University,State Key Laboratory for Manufacturing Systems Engineering, School of Automation Science and Engineering, Faculty of Electronic and Information Engineering,Xi’an,China,710049"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi’an Jiaotong University,State Key Laboratory for Manufacturing Systems Engineering, School of Automation Science and Engineering, Faculty of Electronic and Information Engineering,Xi’an,China,710049","institution_ids":["https://openalex.org/I87445476"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I87445476"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29619935,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"976","last_page":"981"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9580000042915344,"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.9580000042915344,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9301000237464905,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.6947000026702881},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5960999727249146},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5814999938011169},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5676000118255615},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.45010000467300415},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41690000891685486},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.40529999136924744},{"id":"https://openalex.org/keywords/orientation","display_name":"Orientation (vector space)","score":0.3874000012874603}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6947000026702881},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5960999727249146},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5814999938011169},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5676000118255615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5242000222206116},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4876999855041504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45179998874664307},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.45010000467300415},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42080000042915344},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41690000891685486},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.40529999136924744},{"id":"https://openalex.org/C16345878","wikidata":"https://www.wikidata.org/wiki/Q107472979","display_name":"Orientation (vector space)","level":2,"score":0.3874000012874603},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.35989999771118164},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.358599990606308},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3434999883174896},{"id":"https://openalex.org/C40149104","wikidata":"https://www.wikidata.org/wiki/Q5620977","display_name":"Factory (object-oriented programming)","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.26170000433921814},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.25589999556541443},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case58245.2025.11164160","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case58245.2025.11164160","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 21st International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Path":[0],"planning":[1],"is":[2],"crucial":[3],"for":[4,27,34],"the":[5,37,52,56,61,72,92,103,107,114,123],"efficient":[6,32],"operation":[7],"of":[8,94,116,142],"Autonomous":[9],"Mobile":[10],"Robots":[11],"(AMRs)":[12],"in":[13,91,140],"factory":[14],"environments.":[15],"Many":[16],"existing":[17,138],"algorithms":[18],"rely":[19],"on":[20,71],"Dubins":[21,39,57],"paths,":[22],"which":[23],"have":[24],"been":[25],"adapted":[26],"various":[28],"applications.":[29],"However,":[30],"an":[31],"method":[33,125],"directly":[35],"determining":[36],"shortest":[38,53],"path":[40,54],"remains":[41],"underdeveloped.":[42],"This":[43,99],"paper":[44],"presents":[45],"a":[46,89,121],"comprehensive":[47],"approach":[48,135],"to":[49,97,109],"efficiently":[50],"identify":[51],"within":[55,81],"set.":[58],"We":[59],"classify":[60],"initial":[62],"and":[63,105,112],"final":[64],"configurations":[65],"into":[66],"six":[67],"equivalency":[68],"groups":[69],"based":[70],"quadrants":[73],"formed":[74],"by":[75],"their":[76],"orientation":[77],"angle":[78],"pairs.":[79],"Paths":[80],"each":[82],"group":[83],"exhibit":[84],"shared":[85],"topological":[86],"properties,":[87],"enabling":[88],"reduction":[90],"number":[93],"candidate":[95],"cases":[96],"analyze.":[98],"pre-classification":[100],"step":[101],"simplifies":[102],"problem":[104],"eliminates":[106],"need":[108],"explicitly":[110],"compute":[111],"compare":[113],"lengths":[115],"all":[117],"possible":[118],"paths.":[119],"As":[120],"result,":[122],"proposed":[124],"significantly":[126],"lowers":[127],"computational":[128,143],"complexity.":[129],"Extensive":[130],"experiments":[131],"confirm":[132],"that":[133],"our":[134],"consistently":[136],"outperforms":[137],"methods":[139],"terms":[141],"efficiency.":[144]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}