{"id":"https://openalex.org/W2908047041","doi":"https://doi.org/10.1109/icarcv.2018.8581194","title":"Fast Robot Motion Planning with Collision Avoidance and Temporal Optimization","display_name":"Fast Robot Motion Planning with Collision Avoidance and Temporal Optimization","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2908047041","doi":"https://doi.org/10.1109/icarcv.2018.8581194","mag":"2908047041"},"language":"en","primary_location":{"id":"doi:10.1109/icarcv.2018.8581194","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icarcv.2018.8581194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 15th International Conference on Control, Automation, Robotics and Vision (ICARCV)","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/A5067794123","display_name":"Hsien-Chung Lin","orcid":"https://orcid.org/0000-0001-7562-9725"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hsien-Chung Lin","raw_affiliation_strings":["Department of Mechanical Engineering, University of California, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040156274","display_name":"Changliu Liu","orcid":"https://orcid.org/0000-0002-3767-5517"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Changliu Liu","raw_affiliation_strings":["Department of Mechanical Engineering, University of California, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064077634","display_name":"Masayoshi Tomizuka","orcid":"https://orcid.org/0000-0003-0206-6639"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Masayoshi Tomizuka","raw_affiliation_strings":["Department of Mechanical Engineering, University of California, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":0.318,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.64500027,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"29","last_page":"35"},"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9943000078201294,"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/T10142","display_name":"Formal Methods in Verification","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.7162796258926392},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6931284070014954},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"Collision avoidance","score":0.6753137111663818},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6527571082115173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6351543664932251},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.6033453941345215},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5866796374320984},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5826570987701416},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5195208191871643},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4972279369831085},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.46556758880615234},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44829443097114563},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.43536296486854553},{"id":"https://openalex.org/keywords/motion","display_name":"Motion (physics)","score":0.42913731932640076},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4275265038013458},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.27877458930015564},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23059439659118652},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21894341707229614},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.18794307112693787}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.7162796258926392},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6931284070014954},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.6753137111663818},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6527571082115173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6351543664932251},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6033453941345215},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5866796374320984},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5826570987701416},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5195208191871643},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4972279369831085},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.46556758880615234},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44829443097114563},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.43536296486854553},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.42913731932640076},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4275265038013458},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27877458930015564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23059439659118652},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21894341707229614},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.18794307112693787},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icarcv.2018.8581194","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icarcv.2018.8581194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 15th International Conference on Control, Automation, Robotics and Vision (ICARCV)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6800000071525574,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W61873113","https://openalex.org/W180478659","https://openalex.org/W1588241099","https://openalex.org/W2000359213","https://openalex.org/W2066237909","https://openalex.org/W2099893201","https://openalex.org/W2128990851","https://openalex.org/W2152421929","https://openalex.org/W2168285891","https://openalex.org/W2293883387","https://openalex.org/W2337407423","https://openalex.org/W2734615402","https://openalex.org/W2754918589","https://openalex.org/W2963214840","https://openalex.org/W4205183907"],"related_works":["https://openalex.org/W4381746183","https://openalex.org/W4206704743","https://openalex.org/W4313119266","https://openalex.org/W2164807043","https://openalex.org/W2019128690","https://openalex.org/W4231448069","https://openalex.org/W2128461291","https://openalex.org/W2355907103","https://openalex.org/W2270789747","https://openalex.org/W436931041"],"abstract_inverted_index":{"Considering":[0],"the":[1,28,37,42,56,86,91],"growing":[2],"demand":[3],"of":[4,48,80],"real-time":[5],"motion":[6,17],"planning":[7,39,52],"in":[8,50,61,68,90],"robot":[9,16],"applications,":[10],"this":[11],"paper":[12],"proposes":[13],"a":[14,65,76],"fast":[15],"planner":[18],"(FRMP)":[19],"to":[20,34,55,74],"plan":[21],"collision-free":[22],"and":[23,41,71],"time-optimal":[24],"trajectories,":[25],"which":[26,63],"applies":[27],"convex":[29],"feasible":[30],"set":[31],"algorithm":[32],"(CFS)":[33],"solve":[35],"both":[36],"trajectory":[38,51],"problem":[40],"temporal":[43,81],"optimization":[44,82],"problem.":[45],"The":[46,78],"performance":[47],"CFS":[49],"is":[53,83],"compared":[54],"sequential":[57],"quadratic":[58],"programming":[59],"(SQP)":[60],"simulation,":[62],"shows":[64],"significant":[66],"decrease":[67],"iteration":[69],"numbers":[70],"computation":[72],"time":[73,88],"converge":[75],"solution.":[77],"effectiveness":[79],"shown":[84],"on":[85,93],"operational":[87],"reduction":[89],"experiment":[92],"FANUC":[94],"LR":[95],"Mate":[96],"200iD/7L.":[97]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}