{"id":"https://openalex.org/W2003417836","doi":"https://doi.org/10.1163/156855306777951465","title":"A semi-optimal path generation scheme for a frame articulated steering-type vehicle","display_name":"A semi-optimal path generation scheme for a frame articulated steering-type vehicle","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2003417836","doi":"https://doi.org/10.1163/156855306777951465","mag":"2003417836"},"language":"en","primary_location":{"id":"doi:10.1163/156855306777951465","is_oa":false,"landing_page_url":"https://doi.org/10.1163/156855306777951465","pdf_url":null,"source":{"id":"https://openalex.org/S192584203","display_name":"Advanced Robotics","issn_l":"0169-1864","issn":["0169-1864","1568-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Robotics","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/A5057574408","display_name":"Yossawee Weerakamhaeng","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Weerakamhaeng Yossawee","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103627370","display_name":"Takashi Tsubouchi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Takashi Tsubouchi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112643075","display_name":"Masamitsu Kurisu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Masamitsu Kurisu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5015359930","display_name":"Shigeru Sarata","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shigeru Sarata","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5057574408"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6229,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.68331184,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"8","first_page":"867","last_page":"896"},"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.9987000226974487,"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6832174062728882},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6480916738510132},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5762064456939697},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.5559873580932617},{"id":"https://openalex.org/keywords/frame","display_name":"Frame (networking)","score":0.5407900810241699},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4884277880191803},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.47866401076316833},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42162394523620605},{"id":"https://openalex.org/keywords/loader","display_name":"Loader","score":0.4191238284111023},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.41805875301361084},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41270536184310913},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3977864980697632},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.38077807426452637},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33472663164138794},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.25382256507873535},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.20251032710075378},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17445462942123413},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1376819908618927},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.10259464383125305},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09614917635917664}],"concepts":[{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6832174062728882},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6480916738510132},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5762064456939697},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.5559873580932617},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.5407900810241699},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4884277880191803},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.47866401076316833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42162394523620605},{"id":"https://openalex.org/C2779041774","wikidata":"https://www.wikidata.org/wiki/Q650550","display_name":"Loader","level":2,"score":0.4191238284111023},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.41805875301361084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41270536184310913},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3977864980697632},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.38077807426452637},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33472663164138794},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.25382256507873535},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.20251032710075378},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17445462942123413},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1376819908618927},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.10259464383125305},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09614917635917664},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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.1163/156855306777951465","is_oa":false,"landing_page_url":"https://doi.org/10.1163/156855306777951465","pdf_url":null,"source":{"id":"https://openalex.org/S192584203","display_name":"Advanced Robotics","issn_l":"0169-1864","issn":["0169-1864","1568-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Robotics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"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":16,"referenced_works":["https://openalex.org/W16067380","https://openalex.org/W29052388","https://openalex.org/W272007376","https://openalex.org/W1903576784","https://openalex.org/W1971998222","https://openalex.org/W2096576273","https://openalex.org/W2116842611","https://openalex.org/W2123787681","https://openalex.org/W2126702161","https://openalex.org/W2130772530","https://openalex.org/W2148970883","https://openalex.org/W2155683259","https://openalex.org/W2163385431","https://openalex.org/W2258189122","https://openalex.org/W2313274380","https://openalex.org/W2605670153"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2125569607","https://openalex.org/W2084091668","https://openalex.org/W3204808601"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"wheel":[2],"loader":[3],"is":[4,11,36,96],"one":[5,163],"of":[6,25,44,65,82,103,114,119,124,130,164,174],"the":[7,100,111,117,122,128,131,141,148,159,165,172,181],"main":[8],"machines":[9],"that":[10],"used":[12],"in":[13,22,33,162],"various":[14],"applications.":[15],"The":[16,39],"present":[17],"authors":[18,40],"have":[19],"been":[20],"interested":[21],"autonomous":[23],"control":[24],"its":[26],"locomotion":[27],"and":[28,69,88,151],"navigation.":[29],"An":[30],"inevitable":[31],"step":[32],"achieving":[34],"this":[35,107],"path":[37,56,62,76,94,143,183],"planning.":[38,184],"choose":[41],"a":[42,46,54,60,75,83,89,155,176],"technique":[43],"designing":[45],"steering":[47],"method":[48],"for":[49,78,180],"car-like":[50],"vehicles":[51],"by":[52],"proposing":[53],"semi-optimal":[55],"generation":[57],"scheme":[58],"using":[59],"canonical":[61,178],"skeleton":[63,179],"consisting":[64],"three":[66],"line":[67],"segments":[68],"two":[70],"clotohid":[71],"pairs.":[72],"Taking":[73],"such":[74],"skeleton,":[77],"any":[79],"given":[80],"pair":[81],"locally":[84,90],"desired":[85,91,182],"initial":[86],"configuration":[87],"destination":[92],"configuration,":[93],"planning":[95],"equivalent":[97],"to":[98,110,147,170],"finding":[99],"suitable":[101],"values":[102,123],"parameters":[104,125],"which":[105],"characterize":[106],"skeleton.":[108],"Due":[109],"lower":[112],"number":[113,118],"constraints":[115],"than":[116],"parameters,":[120],"ascertaining":[121],"comes":[126],"from":[127],"optimizations":[129,166],"authors'":[132],"formulated":[133],"non-linear":[134],"programmings":[135],"with":[136],"equality":[137],"constraints.":[138],"In":[139],"addition,":[140],"realizable":[142],"must":[144],"be":[145],"subject":[146],"upper-bounded":[149],"curvature":[150,152],"derivative.":[153],"Adopting":[154],"genetic":[156],"algorithm":[157],"as":[158],"search":[160],"tool":[161],"makes":[167],"it":[168],"possible":[169],"allow":[171],"use":[173],"only":[175],"single":[177],"Keywords:":[185],"CLOTHOID":[186],"PAIRNON-HOLONOMIC":[187],"PATH":[188],"PLANNINGUPPER-BOUNDED":[189],"CURVATURE":[190,192],"AND":[191],"DERIVATIVE":[193],"PATHCONTINUOUS-CURVATURE":[194],"PATHFRAME":[195],"ARTICULATED":[196],"STEERING-TYPE":[197],"VEHICLE":[198]},"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},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}