{"id":"https://openalex.org/W2130357573","doi":"https://doi.org/10.1109/iros.2004.1389836","title":"A ]bounded-curvature shortest path generation method for car-like mobile robot using cubic spiral","display_name":"A ]bounded-curvature shortest path generation method for car-like mobile robot using cubic spiral","publication_year":2005,"publication_date":"2005-04-01","ids":{"openalex":"https://openalex.org/W2130357573","doi":"https://doi.org/10.1109/iros.2004.1389836","mag":"2130357573"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2004.1389836","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2004.1389836","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566)","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/A5003487758","display_name":"Tzu-Chen Liang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]},{"id":"https://openalex.org/I4210141710","display_name":"Institute of Statistical Science, Academia Sinica","ror":"https://ror.org/044gv5910","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210141710","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tzu-Chen Liang","raw_affiliation_strings":["Institute of Information Science, Academia Sinica, Taipei, Taiwan","Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information Science, Academia Sinica, Taipei, Taiwan","institution_ids":["https://openalex.org/I4210098366"]},{"raw_affiliation_string":"Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan","institution_ids":["https://openalex.org/I4210141710"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034523100","display_name":"Jing\u2010Sin Liu","orcid":"https://orcid.org/0000-0002-4935-8965"},"institutions":[{"id":"https://openalex.org/I4210098366","display_name":"Institute of Information Science, Academia Sinica","ror":"https://ror.org/00z83z196","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210098366","https://openalex.org/I84653119"]},{"id":"https://openalex.org/I4210141710","display_name":"Institute of Statistical Science, Academia Sinica","ror":"https://ror.org/044gv5910","country_code":"TW","type":"facility","lineage":["https://openalex.org/I4210141710","https://openalex.org/I84653119"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jing-Sin Liu","raw_affiliation_strings":["Institute of Information Science, Academia Sinica, Taipei, Taiwan","Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Information Science, Academia Sinica, Taipei, Taiwan","institution_ids":["https://openalex.org/I4210098366"]},{"raw_affiliation_string":"Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan","institution_ids":["https://openalex.org/I4210141710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2991,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.62753072,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"3","issue":null,"first_page":"2819","last_page":"2824"},"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.9984999895095825,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.983299970626831,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.6658976674079895},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5695844888687134},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5389474630355835},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5254004597663879},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5221893191337585},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4784833788871765},{"id":"https://openalex.org/keywords/line-segment","display_name":"Line segment","score":0.45316919684410095},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4483368694782257},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4155328869819641},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.39032286405563354},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.38911619782447815},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.351418673992157},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.30394262075424194},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.22182855010032654},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.15499001741409302},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15107816457748413},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14920639991760254},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08611837029457092},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06917133927345276}],"concepts":[{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.6658976674079895},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5695844888687134},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5389474630355835},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5254004597663879},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5221893191337585},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4784833788871765},{"id":"https://openalex.org/C182124507","wikidata":"https://www.wikidata.org/wiki/Q166154","display_name":"Line segment","level":2,"score":0.45316919684410095},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4483368694782257},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4155328869819641},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.39032286405563354},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.38911619782447815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.351418673992157},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.30394262075424194},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.22182855010032654},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.15499001741409302},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15107816457748413},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14920639991760254},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08611837029457092},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06917133927345276},{"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/iros.2004.1389836","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2004.1389836","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.677.7260","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.677.7260","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iis.sinica.edu.tw/papers/liu/1474-F.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1497807577","https://openalex.org/W1670000279","https://openalex.org/W1934130465","https://openalex.org/W1971998222","https://openalex.org/W1980644536","https://openalex.org/W2096576273","https://openalex.org/W2104920576","https://openalex.org/W2113755254","https://openalex.org/W2122063210","https://openalex.org/W2123787681","https://openalex.org/W2128644970","https://openalex.org/W2135027849","https://openalex.org/W2136445059","https://openalex.org/W2139639337","https://openalex.org/W2140079849","https://openalex.org/W2154432569","https://openalex.org/W2161859997","https://openalex.org/W2164026223","https://openalex.org/W2166034910","https://openalex.org/W2313274380","https://openalex.org/W4249823714","https://openalex.org/W6678121631","https://openalex.org/W6680818815","https://openalex.org/W6683967667"],"related_works":["https://openalex.org/W4200570312","https://openalex.org/W3128114094","https://openalex.org/W3119646977","https://openalex.org/W1539483014","https://openalex.org/W3181420625","https://openalex.org/W1965640390","https://openalex.org/W2071096634","https://openalex.org/W1980644536","https://openalex.org/W1934130465","https://openalex.org/W2128341036"],"abstract_inverted_index":{"A":[0,41],"trajectory":[1],"generation":[2,103,118],"method":[3,104],"for":[4,127],"car-like":[5,79],"mobile":[6,80,133],"robot":[7],"based":[8,105],"on":[9,106],"cubic":[10,26,107],"spirals":[11,108],"and":[12,33,37,75,137,141],"line":[13,39],"segments":[14,28],"is":[15,20,46,65,89,113,125],"presented.":[16],"The":[17,86,98,111],"generated":[18,60],"path":[19,57,61,72,102],"made":[21],"up":[22],"of":[23,25,53,55,59,78,100,119],"portion":[24],"spiral":[27],"with":[29,122,135],"zero":[30],"curvature":[31,36,124],"ends":[32],"upper":[34],"bounded":[35,123],"straight":[38],"segments.":[40],"numerically":[42],"efficient":[43,126],"process,":[44],"which":[45],"resorted":[47],"to":[48,67,132,148],"minimization":[49],"over":[50],"the":[51,94,117],"sum":[52],"length":[54],"each":[56],"segment":[58],"via":[62],"linear":[63],"programming,":[64],"presented":[66],"generate":[68],"a":[69],"Cartesian":[70],"shortest":[71],"linking":[73],"start":[74],"destination":[76],"configurations":[77],"robots":[81,134],"through":[82],"an":[83],"intermediate":[84,87],"configuration.":[85],"configuration":[88],"not":[90],"necessarily":[91],"selected":[92],"from":[93],"symmetric":[95],"means":[96],"circle.":[97],"merits":[99],"our":[101],"are:":[109],"(i)":[110],"implementation":[112],"straightforward":[114],"so":[115],"that":[116],"feasible":[120],"paths":[121],"real-time":[128],"applications.":[129],"(ii)":[130],"Applicable":[131],"forward":[136,143],"backward":[138],"driving":[139,144],"abilities":[140],"only":[142],"ability;":[145],"(iii)":[146],"Flexible":[147],"incorporate":[149],"other":[150],"constraints.":[151]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}