{"id":"https://openalex.org/W2904803093","doi":"https://doi.org/10.1109/itsc.2018.8569989","title":"Optimal Path for a Car-like Robot to Reach a Given Straight Line","display_name":"Optimal Path for a Car-like Robot to Reach a Given Straight Line","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2904803093","doi":"https://doi.org/10.1109/itsc.2018.8569989","mag":"2904803093"},"language":"en","primary_location":{"id":"doi:10.1109/itsc.2018.8569989","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2018.8569989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 21st International Conference on Intelligent Transportation Systems (ITSC)","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/A5100408399","display_name":"Chao Chen","orcid":"https://orcid.org/0000-0003-2094-9734"},"institutions":[{"id":"https://openalex.org/I4210091388","display_name":"Mercedes-Benz Research and Development North America (United States)","ror":"https://ror.org/00b4ram58","country_code":"US","type":"company","lineage":["https://openalex.org/I1332474105","https://openalex.org/I4210091388"]},{"id":"https://openalex.org/I4210156906","display_name":"Daimler (United States)","ror":"https://ror.org/05angxc35","country_code":"US","type":"company","lineage":["https://openalex.org/I4210156906","https://openalex.org/I891521709"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chao Chen","raw_affiliation_strings":["Mercedes-Benz Research and Development North America, A Daimler Company, Sunnyvale, CA, USA"],"affiliations":[{"raw_affiliation_string":"Mercedes-Benz Research and Development North America, A Daimler Company, Sunnyvale, CA, USA","institution_ids":["https://openalex.org/I4210091388","https://openalex.org/I4210156906"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100408399"],"corresponding_institution_ids":["https://openalex.org/I4210091388","https://openalex.org/I4210156906"],"apc_list":null,"apc_paid":null,"fwci":0.1045,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.4768784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"2270","last_page":"2276"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9937000274658203,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7277874946594238},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.6110112071037292},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.603999137878418},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5970277786254883},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5760068297386169},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5339381098747253},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5310322046279907},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.525480329990387},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.5240195989608765},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.514344334602356},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4835781455039978},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.46063148975372314},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.4557400345802307},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4385106861591339},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4237593412399292},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3704564571380615},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.32633036375045776},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2909330725669861},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.28828489780426025},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1777605414390564},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.16304224729537964},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10606840252876282},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09040042757987976}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7277874946594238},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.6110112071037292},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.603999137878418},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5970277786254883},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5760068297386169},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5339381098747253},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5310322046279907},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.525480329990387},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.5240195989608765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.514344334602356},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4835781455039978},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.46063148975372314},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.4557400345802307},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4385106861591339},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4237593412399292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3704564571380615},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.32633036375045776},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2909330725669861},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.28828489780426025},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1777605414390564},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.16304224729537964},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10606840252876282},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09040042757987976},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itsc.2018.8569989","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc.2018.8569989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 21st International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7699999809265137,"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":14,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1424654272","https://openalex.org/W1553616171","https://openalex.org/W1971998222","https://openalex.org/W1983948265","https://openalex.org/W1995170319","https://openalex.org/W1996183429","https://openalex.org/W2000140632","https://openalex.org/W2096576273","https://openalex.org/W2128990851","https://openalex.org/W2145972539","https://openalex.org/W2163385431","https://openalex.org/W2313274380","https://openalex.org/W2611243847"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W2018146256","https://openalex.org/W2375775343","https://openalex.org/W2360981904","https://openalex.org/W2112429204","https://openalex.org/W2040572217","https://openalex.org/W2198982833","https://openalex.org/W4200172719","https://openalex.org/W2365712669","https://openalex.org/W1987046149"],"abstract_inverted_index":{"This":[0,51],"paper":[1],"presents":[2],"a":[3,12,16,21,35,45,66,83,89,93,137],"closed":[4],"form":[5],"solution":[6],"for":[7,11,73,77],"the":[8,25,42,49,106,115,122,127,139],"optimal":[9,128],"path":[10,53,70,108,129],"car":[13],"to":[14,68,86,92],"reach":[15],"given":[17,94],"straight":[18],"line":[19,37,91],"with":[20,41,59,105],"specified":[22],"direction,":[23],"i.e.,":[24],"shortest":[26,52,107],"distance":[27,101,140],"between":[28],"an":[29,111,132],"arbitrary":[30],"pose":[31,96],"(x,":[32],"y,\u03b80)":[33],"and":[34,79],"target":[36,116],"(":[38],"d,":[39],"\u03b8)":[40],"constraint":[43],"of":[44,48],"maximum":[46],"curvature":[47],"path.":[50],"metric":[54,102,124,141],"does":[55],"not":[56],"consider":[57],"collision":[58],"obstacles.":[60],"The":[61,100,118],"result":[62],"can":[63,142],"serve":[64],"as":[65],"heuristic":[67],"solve":[69],"planning":[71,147],"problems":[72],"autonomous":[74],"vehicles,":[75],"especially":[76],"parking":[78],"pull-out":[80],"scenarios,":[81],"where":[82],"vehicle":[84],"needs":[85],"drive":[87],"from":[88,110],"reference":[90],"final":[95],"or":[97],"vice":[98],"versa.":[99],"is":[103],"verified":[104],"obtained":[109],"exhaustive":[112],"sampling":[113],"along":[114],"line.":[117],"comparison":[119],"shows":[120],"that":[121],"explicit":[123],"function":[125],"provides":[126],"length":[130],"in":[131,145],"instant":[133],"time":[134],"frame.":[135],"As":[136],"result,":[138],"be":[143],"used":[144],"online":[146],"applications.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}