{"id":"https://openalex.org/W2002548850","doi":"https://doi.org/10.1109/tro.2011.2160466","title":"A Sampling-Based Tree Planner for Systems With Complex Dynamics","display_name":"A Sampling-Based Tree Planner for Systems With Complex Dynamics","publication_year":2011,"publication_date":"2011-07-26","ids":{"openalex":"https://openalex.org/W2002548850","doi":"https://doi.org/10.1109/tro.2011.2160466","mag":"2002548850"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2011.2160466","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2011.2160466","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on 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/A5078911730","display_name":"Ioan A. \u015eucan","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ioan A. Sucan","raw_affiliation_strings":["Department of Computer Science, Rice University, Houston, TX, USA","Dept. of Comput. Sci., Rice Univ., Houston, TX, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Rice Univ., Houston, TX, USA#TAB#","institution_ids":["https://openalex.org/I74775410"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067205988","display_name":"Lydia E. Kavraki","orcid":"https://orcid.org/0000-0003-0699-8038"},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lydia E. Kavraki","raw_affiliation_strings":["Department of Computer Science, Rice University, Houston, TX, USA","Dept. of Comput. Sci., Rice Univ., Houston, TX, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]},{"raw_affiliation_string":"Dept. of Comput. Sci., Rice Univ., Houston, TX, USA#TAB#","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078911730"],"corresponding_institution_ids":["https://openalex.org/I74775410"],"apc_list":null,"apc_paid":null,"fwci":7.8477,"has_fulltext":false,"cited_by_count":151,"citation_normalized_percentile":{"value":0.97952662,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"28","issue":"1","first_page":"116","last_page":"131"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9930999875068665,"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/speedup","display_name":"Speedup","score":0.7472586035728455},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.7326893210411072},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6496517658233643},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.6334760189056396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5847260355949402},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.560871422290802},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.5569947957992554},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5472102761268616},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5066433548927307},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4588911831378937},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39013996720314026},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3779923617839813},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3568294048309326},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31875869631767273},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.29836535453796387},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.2814077138900757},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2546651363372803},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11819753050804138}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7472586035728455},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.7326893210411072},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6496517658233643},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.6334760189056396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5847260355949402},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.560871422290802},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.5569947957992554},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5472102761268616},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5066433548927307},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4588911831378937},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39013996720314026},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3779923617839813},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3568294048309326},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31875869631767273},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.29836535453796387},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2814077138900757},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2546651363372803},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11819753050804138},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tro.2011.2160466","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2011.2160466","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Robotics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.302.5232","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.302.5232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.kavrakilab.org/sites/default/files/kpiece_preprint-h.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.75,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":62,"referenced_works":["https://openalex.org/W101508493","https://openalex.org/W131069610","https://openalex.org/W143844323","https://openalex.org/W211162959","https://openalex.org/W1502517891","https://openalex.org/W1521785144","https://openalex.org/W1531168033","https://openalex.org/W1531225991","https://openalex.org/W1534588514","https://openalex.org/W1536373029","https://openalex.org/W1595414374","https://openalex.org/W1857520958","https://openalex.org/W1968254796","https://openalex.org/W1978301848","https://openalex.org/W2000359213","https://openalex.org/W2001804342","https://openalex.org/W2010125957","https://openalex.org/W2031310371","https://openalex.org/W2036016432","https://openalex.org/W2037907469","https://openalex.org/W2042106485","https://openalex.org/W2043292926","https://openalex.org/W2048820947","https://openalex.org/W2055699853","https://openalex.org/W2067754486","https://openalex.org/W2083669917","https://openalex.org/W2095782953","https://openalex.org/W2102792266","https://openalex.org/W2108643443","https://openalex.org/W2111043354","https://openalex.org/W2126115129","https://openalex.org/W2128651140","https://openalex.org/W2128990851","https://openalex.org/W2130678356","https://openalex.org/W2141664020","https://openalex.org/W2145882751","https://openalex.org/W2146316980","https://openalex.org/W2147213215","https://openalex.org/W2147497140","https://openalex.org/W2149016364","https://openalex.org/W2150772450","https://openalex.org/W2156123119","https://openalex.org/W2156459680","https://openalex.org/W2157543942","https://openalex.org/W2159722616","https://openalex.org/W2163862895","https://openalex.org/W2163913482","https://openalex.org/W2167340365","https://openalex.org/W2171205311","https://openalex.org/W2171266831","https://openalex.org/W2289741470","https://openalex.org/W2296356821","https://openalex.org/W2397499736","https://openalex.org/W2399501438","https://openalex.org/W2611243847","https://openalex.org/W2979473749","https://openalex.org/W4205846898","https://openalex.org/W4230684301","https://openalex.org/W4242811155","https://openalex.org/W6661479379","https://openalex.org/W6684933373","https://openalex.org/W6697528359"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2027972911","https://openalex.org/W2157978810","https://openalex.org/W2118356379","https://openalex.org/W2067790096"],"abstract_inverted_index":{"This":[0,157],"paper":[1],"presents":[2],"a":[3],"kinodynamic":[4],"motion":[5],"planner,":[6],"i.e.,":[7],"Kinodynamic":[8],"Motion":[9],"Planning":[10],"by":[11,167],"Interior-Exterior":[12],"Cell":[13],"Exploration":[14],"(KPIECE),":[15],"which":[16],"is":[17,30,37,42,72,126,153],"specifically":[18],"designed":[19],"for":[20],"systems":[21],"with":[22],"complex":[23],"dynamics,":[24],"where":[25],"integration":[26],"backward":[27],"in":[28],"time":[29],"not":[31],"possible,":[32],"and":[33,88,112,140],"speed":[34],"of":[35,48,62,69,77,80,84,96,134,170],"computation":[36],"important.":[38],"A":[39,148],"grid-based":[40],"discretization":[41,71],"used":[43],"to":[44,115,128,131,143],"estimate":[45],"the":[46,49,56,59,63,78,81,85,92,171],"coverage":[47,53],"state":[50,64,86],"space.":[51,65],"The":[52],"estimates":[54],"help":[55],"planner":[57],"detect":[58],"less-explored":[60],"areas":[61],"An":[66],"important":[67],"characteristic":[68],"this":[70,97],"that":[73,102],"it":[74],"keeps":[75],"track":[76],"boundary":[79],"explored":[82],"region":[83],"space":[87],"focuses":[89],"exploration":[90],"on":[91],"less":[93,146],"covered":[94],"parts":[95],"boundary.":[98],"Extensive":[99],"experiments":[100],"show":[101],"KPIECE":[103,125],"provides":[104,159],"significant":[105],"computational":[106],"gain":[107],"over":[108],"existing":[109,138],"state-of-the-art":[110],"methods":[111,139],"allows":[113],"us":[114],"solve":[116],"some":[117,123],"harder,":[118],"previously":[119],"unsolvable":[120],"problems.":[121],"For":[122],"problems,":[124],"shown":[127],"be":[129],"up":[130,142],"two":[132],"orders":[133],"magnitude":[135],"faster":[136],"than":[137,162],"use":[141],"40":[144],"times":[145],"memory.":[147],"shared":[149],"memory":[150],"parallel":[151,165],"implementation":[152,158,166],"presented":[154],"as":[155],"well.":[156],"better":[160],"speedup":[161],"an":[163],"embarrassingly":[164],"taking":[168],"advantage":[169],"evolving":[172],"multicore":[173],"technology.":[174]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":16},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":16},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}