{"id":"https://openalex.org/W1869317905","doi":null,"title":"BIT*: Batch Informed Trees for Optimal Sampling-based Planning via Dynamic Programming on Implicit Random Geometric Graphs.","display_name":"BIT*: Batch Informed Trees for Optimal Sampling-based Planning via Dynamic Programming on Implicit Random Geometric Graphs.","alternate_titles":[],"publication_year":2014,"publication_date":"2014-05-22","ids":{"openalex":"https://openalex.org/W1869317905","mag":"1869317905"},"language":"en","primary_location":{"id":"mag:1869317905","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/1405.5848","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1869317905"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/abs/1405.5848","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035590505","display_name":"Jonathan D. Gammell","orcid":"https://orcid.org/0000-0002-1034-3889","observed_orcids":["https://orcid.org/0000-0002-1034-3889"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jonathan D. Gammell","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-1034-3889","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077719529","display_name":"Siddhartha S Srinivasa","orcid":"https://orcid.org/0000-0002-5091-106X","observed_orcids":["https://orcid.org/0000-0002-5091-106X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Siddhartha S Srinivasa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5004788089","display_name":"Timothy D. Barfoot","orcid":"https://orcid.org/0000-0003-3899-631X","observed_orcids":["https://orcid.org/0000-0003-3899-631X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Timothy D. Barfoot","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9990000128746033,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/bits","display_name":"bits","score":0.9399999976158142},{"id":"https://openalex.org/keywords/path-planning","display_name":"path planning","score":0.7110000252723694},{"id":"https://openalex.org/keywords/random-geometric-graphs","display_name":"random geometric graphs","score":0.8799999952316284},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.8479999899864197},{"id":"https://openalex.org/keywords/probabilistic-completeness","display_name":"probabilistic completeness","score":0.7960000038146973},{"id":"https://openalex.org/keywords/asymptotic-optimality","display_name":"asymptotic optimality","score":0.8149999976158142},{"id":"https://openalex.org/keywords/rrt","display_name":"RRT*","score":0.7300000190734863},{"id":"https://openalex.org/keywords/informed-rrt","display_name":"informed RRT*","score":0.8849999904632568}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5812634229660034},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4902961552143097},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4826119840145111},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.47571972012519836},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.4753265678882599},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4387708902359009},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.419108510017395},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.336716890335083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3337239623069763},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14704346656799316},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:1869317905","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/1405.5848","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.746.8503","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.746.8503","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1405.5848.pdf","raw_type":"text"}],"best_oa_location":{"id":"mag:1869317905","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/1405.5848","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W198732646","https://openalex.org/W1481356306","https://openalex.org/W1509540129","https://openalex.org/W1578640434","https://openalex.org/W1589297171","https://openalex.org/W1864112212","https://openalex.org/W1967533244","https://openalex.org/W1969483458","https://openalex.org/W1976930960","https://openalex.org/W1980516134","https://openalex.org/W1982809790","https://openalex.org/W2000648551","https://openalex.org/W2012430523","https://openalex.org/W2028945152","https://openalex.org/W2036016432","https://openalex.org/W2046637502","https://openalex.org/W2048820947","https://openalex.org/W2061759730","https://openalex.org/W2066918959","https://openalex.org/W2068911002","https://openalex.org/W2084234679","https://openalex.org/W2088521668","https://openalex.org/W2098030884","https://openalex.org/W2110762409","https://openalex.org/W2113256452","https://openalex.org/W2124455817","https://openalex.org/W2128990851","https://openalex.org/W2143826757","https://openalex.org/W2145089737","https://openalex.org/W2147226148","https://openalex.org/W2156706225","https://openalex.org/W2161298439","https://openalex.org/W2163178194","https://openalex.org/W2169528473","https://openalex.org/W2296385533","https://openalex.org/W2341171179","https://openalex.org/W2405526757"],"related_works":["https://openalex.org/W3103346840","https://openalex.org/W3004407706","https://openalex.org/W3090901509","https://openalex.org/W2792044650","https://openalex.org/W3132630709","https://openalex.org/W4396578977","https://openalex.org/W1147875304","https://openalex.org/W3006273879","https://openalex.org/W3133339979","https://openalex.org/W4396787906"],"abstract_inverted_index":{"Abstract":[0],"\u2014":[1],"Discrete":[2,17],"and":[3,84,109,133,148,170,191,209,219,234,237],"sampling-based":[4,34,89,134,165],"methods":[5,132],"have":[6],"tradi-tionally":[7],"been":[8],"popular":[9],"techniques":[10,18,35],"for":[11,98],"path":[12],"planning":[13,104,178],"in":[14,116,188,217],"contin-uous":[15],"spaces.":[16],"use":[19,36,53],"the":[20,31,45,54,102,128,138],"principles":[21],"of":[22,30,65,77,113,130,145],"dynamic":[23],"programming":[24],"to":[25,39,72,101,155,159,184],"solve":[26],"a":[27,41,63,74,99,111,117,125,189],"discretized":[28],"approximation":[29],"problem,":[32],"while":[33],"random":[37,68,146],"samples":[38,147],"perform":[40],"stochastic":[42,57],"search":[43,64,187],"on":[44,214],"continuous":[46,103],"state":[47],"space.":[48],"In":[49,120,194],"this":[50],"paper,":[51],"we":[52,196],"fact":[55],"that":[56,198,228,239],"planners":[58,78],"can":[59],"be":[60,242],"viewed":[61],"as":[62,143],"an":[66,86],"implicit":[67,114,139],"geometric":[69],"graph":[70],"(RGG)":[71],"propose":[73],"general":[75],"class":[76],"named":[79],"Bellman":[80],"Random":[81],"Trees":[82,93,212],"(BRT)":[83],"derive":[85],"anytime":[87],"optimal":[88,164,203,236],"algorithm,":[90],"Batch":[91],"Informed":[92,206],"(BIT*).":[94],"BIT":[95,151,180,199,229],"*":[96,152,181,200,208,230],"searches":[97],"solution":[100],"problem":[105],"by":[106],"efficiently":[107],"building":[108],"searching":[110],"series":[112],"RGGs":[115],"principled":[118,190],"manner.":[119,193],"doing":[121],"so,":[122],"it":[123,240],"strikes":[124],"balance":[126],"between":[127],"advantages":[129],"discrete":[131,176],"planners.":[135,166],"By":[136,167],"using":[137,168],"RGG":[140],"representation,":[141],"defined":[142],"set":[144],"successor":[149],"function,":[150],"is":[153,182,231],"able":[154,183],"scale":[156],"more":[157],"effectively":[158],"high":[160],"dimensions":[161],"than":[162],"other":[163],"heuristics":[169],"intelligently":[171],"reusing":[172],"existing":[173],"connections,":[174],"like":[175],"lifelong":[177],"algorithms,":[179],"focus":[185],"its":[186],"efficient":[192,244],"simulations,":[195],"show":[197],"consistently":[201],"outperforms":[202],"RRT":[204,207],"(RRT*),":[205],"Fast":[210],"Marching":[211],"(FMT*)":[213],"random-world":[215],"problems":[216],"R2":[218],"R8.":[220],"We":[221],"also":[222],"present":[223],"preliminary":[224],"theoretical":[225],"analysis":[226],"demonstrating":[227],"probabilistically":[232],"complete":[233],"asymptotically":[235],"conjecture":[238],"may":[241],"optimally":[243],"under":[245],"some":[246],"probabilistic":[247],"conditions.":[248],"I.":[249]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1869317905","counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
