{"id":"https://openalex.org/W2948538490","doi":"https://doi.org/10.1109/tase.2019.2916855","title":"Curvature-Bounded Lengthening and Shortening for Restricted Vehicle Path Planning","display_name":"Curvature-Bounded Lengthening and Shortening for Restricted Vehicle Path Planning","publication_year":2019,"publication_date":"2019-06-04","ids":{"openalex":"https://openalex.org/W2948538490","doi":"https://doi.org/10.1109/tase.2019.2916855","mag":"2948538490"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2019.2916855","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2019.2916855","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-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/A5026898193","display_name":"Weiran Yao","orcid":"https://orcid.org/0000-0002-6570-3888"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]},{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA","CN"],"is_corresponding":true,"raw_author_name":"Weiran Yao","raw_affiliation_strings":["Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Canada","School of Astronautics, Harbin Institute of Technology, Harbin, China"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Industrial Engineering, University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"School of Astronautics, Harbin Institute of Technology, Harbin, China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103097806","display_name":"Naiming Qi","orcid":"https://orcid.org/0000-0001-5602-3197"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Naiming Qi","raw_affiliation_strings":["School of Astronautics, Harbin Institute of Technology, Harbin, China"],"affiliations":[{"raw_affiliation_string":"School of Astronautics, Harbin Institute of Technology, Harbin, China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069505545","display_name":"Chengfei Yue","orcid":"https://orcid.org/0000-0002-0058-2878"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Chengfei Yue","raw_affiliation_strings":["Department of Electrical and Computer Engineering, National University of Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006829950","display_name":"Neng Wan","orcid":"https://orcid.org/0000-0003-1876-7149"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Neng Wan","raw_affiliation_strings":["Department of Mechanical Science and Engineering, University of Illinois at Urbana\u2013Champaign, Urbana, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Science and Engineering, University of Illinois at Urbana\u2013Champaign, Urbana, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5026898193"],"corresponding_institution_ids":["https://openalex.org/I185261750","https://openalex.org/I204983213"],"apc_list":null,"apc_paid":null,"fwci":0.8098,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.76720709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"17","issue":"1","first_page":"15","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9794999957084656,"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/T11106","display_name":"Data Management and Algorithms","score":0.9696999788284302,"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/motion-planning","display_name":"Motion planning","score":0.8099910616874695},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.7044048309326172},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6435201168060303},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.6392402648925781},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6384822726249695},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5862027406692505},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5781739950180054},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.5556271076202393},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.5416591167449951},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.5387583374977112},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5124321579933167},{"id":"https://openalex.org/keywords/arc-length","display_name":"Arc length","score":0.472383975982666},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.45864373445510864},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4516555070877075},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4511531591415405},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4480743706226349},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4342890977859497},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41839009523391724},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.4095171093940735},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.20070204138755798},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.19671586155891418},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1466558277606964},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1393509805202484},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13619452714920044},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.10584235191345215},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09198188781738281},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06721600890159607}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8099910616874695},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.7044048309326172},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6435201168060303},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.6392402648925781},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6384822726249695},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5862027406692505},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5781739950180054},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.5556271076202393},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.5416591167449951},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.5387583374977112},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5124321579933167},{"id":"https://openalex.org/C22251595","wikidata":"https://www.wikidata.org/wiki/Q670036","display_name":"Arc length","level":3,"score":0.472383975982666},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.45864373445510864},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4516555070877075},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4511531591415405},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4480743706226349},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4342890977859497},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41839009523391724},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4095171093940735},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.20070204138755798},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.19671586155891418},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1466558277606964},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1393509805202484},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13619452714920044},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.10584235191345215},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09198188781738281},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06721600890159607},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.0},{"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.1109/tase.2019.2916855","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2019.2916855","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7400000095367432,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G5928902747","display_name":null,"funder_award_id":"U1737207","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G7705646744","display_name":null,"funder_award_id":"11672093","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W1519400727","https://openalex.org/W1875781102","https://openalex.org/W1899339450","https://openalex.org/W1970071808","https://openalex.org/W1971998222","https://openalex.org/W1979426683","https://openalex.org/W1989065580","https://openalex.org/W1992049804","https://openalex.org/W1992787855","https://openalex.org/W2025426491","https://openalex.org/W2029780844","https://openalex.org/W2030632579","https://openalex.org/W2037034267","https://openalex.org/W2043003284","https://openalex.org/W2044348504","https://openalex.org/W2046456604","https://openalex.org/W2058786336","https://openalex.org/W2059854541","https://openalex.org/W2064045620","https://openalex.org/W2109127419","https://openalex.org/W2111118329","https://openalex.org/W2113755254","https://openalex.org/W2132503805","https://openalex.org/W2134638269","https://openalex.org/W2144966261","https://openalex.org/W2148761022","https://openalex.org/W2150330813","https://openalex.org/W2152702644","https://openalex.org/W2157853714","https://openalex.org/W2166451702","https://openalex.org/W2168440188","https://openalex.org/W2213465260","https://openalex.org/W2213988073","https://openalex.org/W2294538342","https://openalex.org/W2294803915","https://openalex.org/W2313274380","https://openalex.org/W2485064764","https://openalex.org/W2521497242","https://openalex.org/W2545315352","https://openalex.org/W2568519526","https://openalex.org/W2580509961","https://openalex.org/W2611912446","https://openalex.org/W2755291502","https://openalex.org/W2899975947","https://openalex.org/W2911442729","https://openalex.org/W2943157449","https://openalex.org/W2963670615"],"related_works":["https://openalex.org/W2315143898","https://openalex.org/W1675650024","https://openalex.org/W2098154640","https://openalex.org/W2116465486","https://openalex.org/W2277626332","https://openalex.org/W2776102956","https://openalex.org/W4281401204","https://openalex.org/W2741593378","https://openalex.org/W2948538490","https://openalex.org/W2172237755"],"abstract_inverted_index":{"In":[0],"this":[1,45],"paper,":[2],"the":[3,76,81,100,125,129,143],"traditional":[4],"shortest":[5],"path":[6,15,21,56,145],"planning":[7,16,146],"problem":[8,147],"for":[9],"vehicle":[10],"is":[11,72],"advanced":[12],"to":[13,19,28,43,65],"length-targeted":[14,144],"problem,":[17],"i.e.,":[18],"plan":[20,66],"with":[22,68,118,152],"its":[23],"length":[24,102],"being":[25],"as":[26,32],"close":[27],"a":[29,60,73],"specified":[30],"value":[31],"possible.":[33],"Lengthening":[34],"and":[35,62,107,111,128,137],"shortening":[36,138],"of":[37,53,75,124],"given":[38],"initial":[39],"paths":[40,67,83,117],"are":[41],"used":[42],"solve":[44,142],"problem.":[46],"Based":[47],"on":[48],"an":[49],"operation":[50],"set":[51],"consisting":[52],"three":[54],"basic":[55],"homotopies,":[57],"we":[58],"build":[59],"comprehensive":[61],"systematic":[63],"framework":[64,97],"target":[69],"length,":[70],"which":[71],"generalization":[74],"existing":[77],"related":[78],"studies.":[79],"Thereby,":[80],"expected":[82,116],"can":[84,98,113,140],"be":[85],"independently":[86],"searched":[87],"through":[88],"such":[89],"deformation":[90],"processes":[91],"within":[92],"topological":[93,120],"classes.":[94],"The":[95],"proposed":[96],"produce":[99],"largest":[101],"coverage":[103],"in":[104,122,148],"different":[105,109],"scenarios":[106],"under":[108],"conditions,":[110],"it":[112],"also":[114],"generate":[115],"arbitrary":[119],"classification":[121],"terms":[123],"curvature":[126],"constraint":[127],"obstacle":[130],"constraint.":[131],"Examples":[132],"show":[133],"that":[134],"our":[135],"lengthening":[136],"method":[139],"effectively":[141],"environment":[149],"without":[150],"or":[151],"obstacles.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}