{"id":"https://openalex.org/W2739799739","doi":"https://doi.org/10.1109/icves.2017.7991892","title":"Deterministic path planning for non-holonomic vehicles including friction and steer rate limitations","display_name":"Deterministic path planning for non-holonomic vehicles including friction and steer rate limitations","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2739799739","doi":"https://doi.org/10.1109/icves.2017.7991892","mag":"2739799739"},"language":"en","primary_location":{"id":"doi:10.1109/icves.2017.7991892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icves.2017.7991892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Vehicular Electronics and Safety (ICVES)","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/A5058838505","display_name":"Mahdi Morsali","orcid":"https://orcid.org/0000-0003-0760-9815"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Mahdi Morsali","raw_affiliation_strings":["Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, SE, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, SE, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065461780","display_name":"Fatemeh Mohseni","orcid":"https://orcid.org/0000-0001-6118-9458"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Fatemeh Mohseni","raw_affiliation_strings":["Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, SE, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, SE, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070530122","display_name":"Erik Frisk","orcid":"https://orcid.org/0000-0001-7349-1937"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Erik Frisk","raw_affiliation_strings":["Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, SE, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Link\u00f6ping University, Link\u00f6ping, SE, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5058838505"],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09567119,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9965999722480774,"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/T10805","display_name":"Vehicle Dynamics and Control Systems","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/motion-planning","display_name":"Motion planning","score":0.6935461163520813},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6768014430999756},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.6717143058776855},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.611152172088623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.575230598449707},{"id":"https://openalex.org/keywords/holonomic","display_name":"Holonomic","score":0.5659515261650085},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5609937906265259},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5283238291740417},{"id":"https://openalex.org/keywords/holonomic-constraints","display_name":"Holonomic constraints","score":0.4932186007499695},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4815526306629181},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.48003140091896057},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4735412001609802},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.42242810130119324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33997419476509094},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20477455854415894},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.11526361107826233},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10515689849853516}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6935461163520813},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6768014430999756},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.6717143058776855},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.611152172088623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.575230598449707},{"id":"https://openalex.org/C2777964439","wikidata":"https://www.wikidata.org/wiki/Q5884201","display_name":"Holonomic","level":2,"score":0.5659515261650085},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5609937906265259},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5283238291740417},{"id":"https://openalex.org/C116721078","wikidata":"https://www.wikidata.org/wiki/Q1048005","display_name":"Holonomic constraints","level":2,"score":0.4932186007499695},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4815526306629181},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.48003140091896057},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4735412001609802},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.42242810130119324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33997419476509094},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20477455854415894},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.11526361107826233},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10515689849853516},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icves.2017.7991892","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icves.2017.7991892","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Vehicular Electronics and Safety (ICVES)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1717366851","https://openalex.org/W1986210666","https://openalex.org/W2048563056","https://openalex.org/W2062710279","https://openalex.org/W2081173707","https://openalex.org/W2125624882","https://openalex.org/W2126870145","https://openalex.org/W2147773288","https://openalex.org/W2151402824","https://openalex.org/W2164340816","https://openalex.org/W2526007611","https://openalex.org/W4210274491","https://openalex.org/W4242811155"],"related_works":["https://openalex.org/W2154502479","https://openalex.org/W2127776540","https://openalex.org/W2365582959","https://openalex.org/W2717412651","https://openalex.org/W2363850121","https://openalex.org/W2147349727","https://openalex.org/W2007583701","https://openalex.org/W2056060483","https://openalex.org/W876576717","https://openalex.org/W3114630707"],"abstract_inverted_index":{"Path":[0],"planning":[1],"algorithms":[2],"have":[3],"evolved":[4],"during":[5],"decades":[6],"to":[7,22,27,50,91,117,122,170],"become":[8],"computationally":[9],"less":[10],"expensive":[11],"and":[12,55,99,112,162],"optimal.":[13],"In":[14,115],"this":[15],"paper":[16],"a":[17,24,40,52,89,93,125],"deterministic":[18],"approach":[19],"is":[20,81,105,130,134,152],"used":[21],"find":[23,92],"path":[25,30],"near":[26,94],"the":[28,48,64,69,103,119,141,144,163,171],"shortest":[29],"using":[31,39,72],"motion":[32,35,77,109],"primitives.":[33,78],"The":[34,44,79,97,132,146],"primitives":[36],"are":[37],"constructed":[38],"non-holonomic":[41],"vehicle":[42],"model.":[43],"physical":[45],"model":[46],"enables":[47],"algorithm":[49,65,80,104,120,133],"use":[51],"friction":[53],"map":[54],"calculate":[56],"paths":[57],"with":[58,88,154],"lower":[59],"lateral":[60],"slip":[61],"forces.":[62],"Furthermore":[63],"takes":[66],"into":[67],"account":[68],"steer":[70,73],"rate":[71],"angles":[74],"assigned":[75],"for":[76],"an":[82],"A\"":[83],"based":[84],"search":[85,150,168],"method":[86,129,151,169],"along":[87],"heuristic":[90],"optimal":[95,123,155,172],"solution.":[96,173],"performance":[98],"calculation":[100],"time":[101],"of":[102,143,167],"tunable":[106],"by":[107],"adjusting":[108],"primitive":[110],"size":[111],"discretization":[113],"steps.":[114],"order":[116],"compare":[118],"output":[121],"solution":[124,156],"direct":[126],"multiple":[127],"shooting":[128],"used.":[131],"simulated":[135],"in":[136,157],"different":[137,159],"scenarios":[138,161],"that":[139],"shows":[140,165],"properties":[142],"algorithm.":[145],"results":[147],"attained":[148],"from":[149],"compared":[153],"two":[158],"test":[160],"comparison":[164],"consistency":[166]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}