{"id":"https://openalex.org/W1509540129","doi":"https://doi.org/10.1109/icra.2015.7139776","title":"Toward asymptotically optimal motion planning for kinodynamic systems using a two-point boundary value problem solver","display_name":"Toward asymptotically optimal motion planning for kinodynamic systems using a two-point boundary value problem solver","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1509540129","doi":"https://doi.org/10.1109/icra.2015.7139776","mag":"1509540129"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2015.7139776","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2015.7139776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Robotics and Automation (ICRA)","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/A5011715672","display_name":"Christopher Xie","orcid":"https://orcid.org/0000-0002-1027-1010"},"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":true,"raw_author_name":"Christopher Xie","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Berkeley","[Dept. of Electrical Eng. and Computer Sci., University of California, Berkeley, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"[Dept. of Electrical Eng. and Computer Sci., University of California, Berkeley, USA]","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108617083","display_name":"Jur van den Berg","orcid":null},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jur van den Berg","raw_affiliation_strings":["School of Computing, University of Utah, Salt Lake City","[School of Computing, University of Utah, Salt Lake City, USA]"],"affiliations":[{"raw_affiliation_string":"School of Computing, University of Utah, Salt Lake City","institution_ids":["https://openalex.org/I223532165"]},{"raw_affiliation_string":"[School of Computing, University of Utah, Salt Lake City, USA]","institution_ids":["https://openalex.org/I223532165"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071959206","display_name":"Sachin Patil","orcid":"https://orcid.org/0000-0002-6247-2295"},"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":"Sachin Patil","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Berkeley","[Dept. of Electrical Eng. and Computer Sci., University of California, Berkeley, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"[Dept. of Electrical Eng. and Computer Sci., University of California, Berkeley, USA]","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049349154","display_name":"Pieter Abbeel","orcid":null},"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":"Pieter Abbeel","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Berkeley","[Dept. of Electrical Eng. and Computer Sci., University of California, Berkeley, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"[Dept. of Electrical Eng. and Computer Sci., University of California, Berkeley, USA]","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011715672"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":4.115,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.95909285,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"4187","last_page":"4194"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9925000071525574,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9865999817848206,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/solver","display_name":"Solver","score":0.7527955174446106},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6183034181594849},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5431356430053711},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.48091933131217957},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.47305813431739807},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4650883078575134},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.41774576902389526},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4108421802520752},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38605797290802},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.33583077788352966},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09062850475311279}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7527955174446106},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6183034181594849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5431356430053711},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.48091933131217957},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.47305813431739807},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4650883078575134},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.41774576902389526},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4108421802520752},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38605797290802},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.33583077788352966},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09062850475311279},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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":1,"locations":[{"id":"doi:10.1109/icra.2015.7139776","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2015.7139776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6200000047683716,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W231147053","https://openalex.org/W1424654272","https://openalex.org/W1605600765","https://openalex.org/W1869317905","https://openalex.org/W1971086298","https://openalex.org/W2000359213","https://openalex.org/W2046549071","https://openalex.org/W2048820947","https://openalex.org/W2049561732","https://openalex.org/W2054585537","https://openalex.org/W2071401582","https://openalex.org/W2104245950","https://openalex.org/W2117567237","https://openalex.org/W2132990760","https://openalex.org/W2140135625","https://openalex.org/W2161819990","https://openalex.org/W2162218551","https://openalex.org/W2293883387","https://openalex.org/W2296347904","https://openalex.org/W2296385533","https://openalex.org/W2465115459","https://openalex.org/W2611243847","https://openalex.org/W2952264980","https://openalex.org/W3029645440","https://openalex.org/W4293775970","https://openalex.org/W4301183172","https://openalex.org/W6609026366","https://openalex.org/W6636311209","https://openalex.org/W6639102425","https://openalex.org/W6677169258","https://openalex.org/W6679634330","https://openalex.org/W6680657880"],"related_works":["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","https://openalex.org/W1495847109"],"abstract_inverted_index":{"We":[0,118,132],"present":[1],"an":[2],"approach":[3],"for":[4,9,103,177],"asymptotically":[5],"optimal":[6,94,115,202],"motion":[7],"planning":[8,116,203],"kinodynamic":[10,29,66,105],"systems":[11,30,106],"with":[12,113,121,197],"arbitrary":[13,104],"nonlinear":[14],"dynamics":[15],"amid":[16],"obstacles.":[17],"Optimal":[18],"sampling-based":[19,201],"planners":[20],"like":[21],"RRT*,":[22],"FMT*,":[23],"and":[24,96,107],"BIT*":[25,120,194],"when":[26],"applied":[27],"to":[28,39,52,71,98,158,161],"require":[31],"solving":[32],"a":[33,122,186],"two-point":[34,73,101,123,187,210],"boundary":[35],"value":[36],"problem":[37,135],"(BVP)":[38],"perform":[40],"exact":[41],"connections":[42],"between":[43],"nodes":[44],"in":[45,92,190,200],"the":[46,55,72,86,134,141,151,156,164,167,171,191,198,207],"tree.":[47],"Two-point":[48],"BVPs":[49,102],"are":[50],"non-trivial":[51],"solve,":[53],"hence":[54],"prevalence":[56],"of":[57,65,79,88,136,143,155,166,173,193,209],"alternative":[58],"approaches":[59],"that":[60,126,184,204],"focus":[61],"on":[62],"specific":[63],"instances":[64],"systems,":[67],"use":[68,76,208],"approximate":[69],"solutions":[70],"BVP,":[74],"or":[75],"random":[77],"propagation":[78],"controls.":[80],"In":[81],"this":[82],"work,":[83],"we":[84,149],"explore":[85],"feasibility":[87],"exploiting":[89],"recent":[90],"advances":[91],"numerical":[93],"control":[95],"optimization":[97,157],"solve":[99],"these":[100],"how":[108],"they":[109],"can":[110],"be":[111],"integrated":[112],"existing":[114],"algorithms.":[117],"combine":[119],"BVP":[124,188,211],"solver":[125,189],"uses":[127],"sequential":[128],"quadratic":[129],"programming":[130],"(SQP).":[131],"consider":[133],"computing":[137],"minimum-time":[138],"trajectories.":[139],"Since":[140],"duration":[142,165],"trajectories":[144],"is":[145,195],"not":[146],"known":[147],"a-priori,":[148],"include":[150],"time-step":[152],"as":[153],"part":[154],"allow":[159],"SQP":[160],"optimize":[162],"over":[163],"trajectory":[168],"while":[169],"keeping":[170],"number":[172],"discrete":[174],"steps":[175],"fixed":[176],"every":[178],"connection":[179],"attempted.":[180],"Our":[181],"experiments":[182],"indicate":[183],"using":[185],"inner-loop":[192],"competitive":[196],"state-of-the-art":[199],"explicitly":[205],"avoids":[206],"solvers.":[212]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}