{"id":"https://openalex.org/W2556237820","doi":"https://doi.org/10.1109/allerton.2014.7028567","title":"Optimal kinodynamic motion planning in environments with unexpected obstacles","display_name":"Optimal kinodynamic motion planning in environments with unexpected obstacles","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W2556237820","doi":"https://doi.org/10.1109/allerton.2014.7028567","mag":"2556237820"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2014.7028567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"},"type":"conference-paper","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":null,"display_name":"Beth Boardman","orcid":null},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]},{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Beth Boardman","raw_affiliation_strings":["Los Alamos National Laboratory, Los Alamos, NM","Mechanical and Aerospace Engineering, University of California, San Diego, La Jolla, Ca"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Los Alamos National Laboratory, Los Alamos, NM","institution_ids":["https://openalex.org/I1343871089"]},{"raw_affiliation_string":"Mechanical and Aerospace Engineering, University of California, San Diego, La Jolla, Ca","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028953580","display_name":"Troy Harden","orcid":"https://orcid.org/0000-0002-7458-7794"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Troy Harden","raw_affiliation_strings":["Los Alamos National Laboratory, Los Alamos, NM"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Los Alamos National Laboratory, Los Alamos, NM","institution_ids":["https://openalex.org/I1343871089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024022921","display_name":"Sonia Mart\u0131\u0301nez","orcid":"https://orcid.org/0000-0001-6756-1484"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sonia Martinez","raw_affiliation_strings":["Mechanical and Aerospace Engineering, University of California, San Diego, La Jolla, Ca"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mechanical and Aerospace Engineering, University of California, San Diego, La Jolla, Ca","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1026","last_page":"1032"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9868999719619751,"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"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9861000180244446,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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.8098303079605103},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6920451521873474},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.6733026504516602},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5930461883544922},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5845687985420227},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4927683174610138},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49123305082321167},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.47643810510635376},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4552336037158966},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4549103379249573},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43824583292007446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3914909362792969},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.285419225692749},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19875627756118774}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8098303079605103},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6920451521873474},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6733026504516602},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5930461883544922},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5845687985420227},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4927683174610138},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49123305082321167},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.47643810510635376},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4552336037158966},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4549103379249573},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43824583292007446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3914909362792969},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.285419225692749},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19875627756118774},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2014.7028567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7699999809265137,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332369","display_name":"National Nuclear Security Administration","ror":"https://ror.org/03sk1we31"},{"id":"https://openalex.org/F4320338304","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1424654272","https://openalex.org/W1486957317","https://openalex.org/W1971086298","https://openalex.org/W2029373101","https://openalex.org/W2071401582","https://openalex.org/W2084501107","https://openalex.org/W2097096168","https://openalex.org/W2099593662","https://openalex.org/W2104186994","https://openalex.org/W2108643443","https://openalex.org/W2119559506","https://openalex.org/W2128990851","https://openalex.org/W2141664020","https://openalex.org/W2145089737","https://openalex.org/W2294319407","https://openalex.org/W2313274380","https://openalex.org/W2519453022","https://openalex.org/W2611243847","https://openalex.org/W2951748345","https://openalex.org/W2988885761","https://openalex.org/W6671678713","https://openalex.org/W6674408180","https://openalex.org/W6681425221","https://openalex.org/W6696955428","https://openalex.org/W6770249431"],"related_works":["https://openalex.org/W2281433634","https://openalex.org/W2394276631","https://openalex.org/W3216096898","https://openalex.org/W2143648480","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W1980828932","https://openalex.org/W2161428574","https://openalex.org/W2077416514","https://openalex.org/W2618632915"],"abstract_inverted_index":{"This":[0,149],"paper":[1],"presents":[2],"and":[3,172],"analyzes":[4],"a":[5,52,71,112,123,127,173,180,187],"new":[6,44,53,79],"algorithm,":[7,12],"the":[8,29,40,48,57,61,75,85,95,100,102,107,131,139],"Goal":[9],"Tree":[10],"(GT)":[11],"for":[13,154,166,186],"motion":[14],"planning":[15,155],"in":[16,70,157],"dynamic":[17],"environments":[18],"where":[19],"new,":[20],"unexpected":[21],"obstacles":[22],"appear":[23],"sporadically.":[24],"The":[25,78],"GT":[26,49,103,140],"builds":[27],"on":[28,105],"RRT*":[30,36],"algorithm":[31,141],"by":[32,68],"employing":[33],"an":[34,144],"initial":[35],"tree":[37,54,80,87],"rooted":[38,55],"at":[39,56],"goal.":[41,96],"When":[42],"finding":[43],"obstacle":[45],"information,":[46],"O,":[47],"quickly":[50],"constructs":[51],"current":[58],"location":[59],"of":[60,74,114,130],"robot,":[62],"x":[63],"<sub":[64],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[65],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">I'</sub>":[66],",":[67],"sampling":[69],"strict":[72,128],"subset":[73,129],"free":[76,132],"space.":[77],"then":[81],"reuses":[82],"branches":[83],"from":[84],"original":[86],"so":[88],"that":[89],"it":[90],"can":[91,135],"produce":[92,111,143],"paths":[93],"to":[94,98,110,142],"Compared":[97],"running":[99],"RRT*,":[101],"reduces,":[104],"average,":[106],"time":[108],"needed":[109],"path":[113],"equal":[115],"cost.":[116],"We":[117],"prove":[118],"that,":[119],"generically,":[120],"there":[121],"exists":[122],"region,":[124],"which":[125,134],"is":[126,151,164],"space,":[133],"be":[136],"used":[137],"with":[138,168,175],"asymptotically":[145],"globally":[146],"optimal":[147],"path.":[148],"region":[150,163],"theoretically":[152],"characterized":[153],"problems":[156],"d":[158],"dimensional":[159],"environments.":[160],"An":[161],"alternative":[162],"provided":[165],"robots":[167],"Dubins'":[169,188],"vehicle":[170,174,189],"dynamics":[171,177],"no":[176],"both":[178],"under":[179],"Euclidean":[181],"distance":[182],"cost":[183],"function.":[184],"Simulations":[185],"robot":[190],"verify":[191],"our":[192],"results.":[193]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}