{"id":"https://openalex.org/W3004407706","doi":"https://doi.org/10.1177/0278364919890396","title":"Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search","display_name":"Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search","publication_year":2020,"publication_date":"2020-01-27","ids":{"openalex":"https://openalex.org/W3004407706","doi":"https://doi.org/10.1177/0278364919890396","mag":"3004407706"},"language":"en","primary_location":{"id":"doi:10.1177/0278364919890396","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364919890396","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1707.01888","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jonathan D Gammell","orcid":"https://orcid.org/0000-0002-1034-3889"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Jonathan D Gammell","raw_affiliation_strings":["University of Oxford, Oxford, UK"],"raw_orcid":"https://orcid.org/0000-0002-1034-3889","affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Timothy D Barfoot","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Timothy D Barfoot","raw_affiliation_strings":["University of Toronto, Toronto, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":null,"display_name":"Siddhartha S Srinivasa","orcid":null},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Siddhartha S Srinivasa","raw_affiliation_strings":["University of Washington, Seattle, WA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Washington, Seattle, WA, USA","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":6.51,"has_fulltext":false,"cited_by_count":191,"citation_normalized_percentile":{"value":0.97513024,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"39","issue":"5","first_page":"543","last_page":"567"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9271000027656555,"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":0.9271000027656555,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.03009999915957451,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.007400000002235174,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/heuristics","display_name":"Heuristics","score":0.7408000230789185},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.6385999917984009},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5552999973297119},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5246999859809875},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5220000147819519},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4706999957561493},{"id":"https://openalex.org/keywords/random-search","display_name":"Random search","score":0.43459999561309814},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4336000084877014},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.42579999566078186}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7408000230789185},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.6385999917984009},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5999000072479248},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5552999973297119},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5246999859809875},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5220000147819519},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4706999957561493},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45179998874664307},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.43459999561309814},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4336000084877014},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.42579999566078186},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.4203000068664551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41690000891685486},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3935999870300293},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.3928000032901764},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3928000032901764},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.3874000012874603},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.37529999017715454},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3725000023841858},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.3582000136375427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33730000257492065},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3273000121116638},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3239000141620636},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.31630000472068787},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.30000001192092896},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.2994999885559082},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2935999929904938},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.26010000705718994},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2549000084400177}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1177/0278364919890396","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364919890396","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1707.01888","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1707.01888","pdf_url":"https://arxiv.org/pdf/1707.01888","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1707.01888","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1707.01888","pdf_url":"https://arxiv.org/pdf/1707.01888","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321886","display_name":"Ontario Ministry of Research, Innovation and Science","ror":"https://ror.org/03zr1tg88"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W630423399","https://openalex.org/W1140243306","https://openalex.org/W1485487406","https://openalex.org/W1509388613","https://openalex.org/W1509540129","https://openalex.org/W1578640434","https://openalex.org/W1583541992","https://openalex.org/W1814533834","https://openalex.org/W1864112212","https://openalex.org/W1963969090","https://openalex.org/W1967981727","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1976930960","https://openalex.org/W1980516134","https://openalex.org/W1982809790","https://openalex.org/W2000359213","https://openalex.org/W2021118704","https://openalex.org/W2028945152","https://openalex.org/W2046637502","https://openalex.org/W2061759730","https://openalex.org/W2068911002","https://openalex.org/W2072596762","https://openalex.org/W2084501107","https://openalex.org/W2088521668","https://openalex.org/W2104171123","https://openalex.org/W2110762409","https://openalex.org/W2112271657","https://openalex.org/W2115257338","https://openalex.org/W2124455817","https://openalex.org/W2128990851","https://openalex.org/W2141664020","https://openalex.org/W2142624263","https://openalex.org/W2143826757","https://openalex.org/W2150500908","https://openalex.org/W2159722616","https://openalex.org/W2161298439","https://openalex.org/W2161414194","https://openalex.org/W2161819990","https://openalex.org/W2163739504","https://openalex.org/W2169528473","https://openalex.org/W2296385533","https://openalex.org/W2299136288","https://openalex.org/W2313978041","https://openalex.org/W2335799662","https://openalex.org/W2410119929","https://openalex.org/W2416313483","https://openalex.org/W2949117375","https://openalex.org/W2963130659","https://openalex.org/W2963222163","https://openalex.org/W3021132920","https://openalex.org/W4236470048"],"related_works":[],"abstract_inverted_index":{"Path":[0],"planning":[1,21,202,264],"in":[2,61,165,227,241],"robotics":[3],"often":[4],"requires":[5],"finding":[6],"high-quality":[7],"solutions":[8],"to":[9,56,113,128,137,186,210,249,256],"continuously":[10],"valued":[11],"and/or":[12],"high-dimensional":[13,263],"problems.":[14,265],"These":[15],"problems":[16,203],"are":[17],"challenging":[18],"and":[19,31,40,181,208,213,231,254],"most":[20],"algorithms":[22],"instead":[23],"solve":[24],"simplified":[25],"approximations.":[26],"Popular":[27],"approximations":[28],"include":[29],"graphs":[30,60],"random":[32,126,159],"samples,":[33],"as":[34,49,120,226,240],"used":[35],"by":[36,205,222],"informed":[37],"graph-based":[38,46],"searches":[39],"anytime":[41,194],"sampling-based":[42,117,195,259],"planners,":[43,118,260],"respectively.":[44],"Informed":[45,189],"searches,":[47],"such":[48,119],"A":[50,228],"*":[51,122,198,229,243],",":[52,123,230],"traditionally":[53,124],"use":[54,125],"heuristics":[55,209],"search":[57,70,149,214,219],"a":[58,96,109,141,176],"priori":[59],"order":[62,153],"of":[63,84,154,158],"potential":[64,223],"solution":[65,143,224],"quality.":[66],"This":[67,134,178],"makes":[68,147],"their":[69,74,148],"efficient,":[71],"but":[72,99,146,169],"leaves":[73],"performance":[75],"dependent":[76,150],"on":[77,151,262],"the":[78,82,85,130,152,162,215],"chosen":[79,86],"approximation.":[80,155],"If":[81],"resolution":[83,139],"approximation":[87,233],"is":[88,102,144,220,246],"too":[89,103],"low,":[90],"then":[91,105],"they":[92,106],"may":[93,107,170],"not":[94],"find":[95],"(suitable)":[97],"solution,":[98],"if":[100],"it":[101],"high,":[104],"take":[108],"prohibitively":[110,172],"long":[111],"time":[112],"do":[114],"so.":[115],"Anytime":[116],"RRT":[121,242],"sampling":[127,207],"approximate":[129,161,212],"problem":[131,163,216],"domain":[132,164],"incrementally.":[133],"allows":[135],"them":[136],"increase":[138],"until":[140],"suitable":[142],"found,":[145],"Arbitrary":[156],"sequences":[157],"samples":[160],"every":[166],"direction":[167],"simultaneously,":[168],"be":[171,250],"inefficient":[173],"at":[174],"containing":[175],"solution.":[177],"article":[179],"unifies":[180],"extends":[182],"these":[183],"two":[184],"approaches":[185],"develop":[187],"Batch":[188],"Trees":[190],"(BIT*),":[191],"an":[192],"informed,":[193],"planner.":[196],"BIT":[197],"solves":[199],"continuous":[200],"path":[201],"efficiently":[204],"using":[206],"alternately":[211],"domain.":[217],"Its":[218],"ordered":[221],"quality,":[225],"its":[232],"improves":[234],"indefinitely":[235],"with":[236],"additional":[237],"computational":[238],"time,":[239],".":[244],"It":[245],"shown":[247],"analytically":[248],"almost-surely":[251],"asymptotically":[252],"optimal":[253],"experimentally":[255],"outperform":[257],"existing":[258],"especially":[261]},"counts_by_year":[{"year":2026,"cited_by_count":13},{"year":2025,"cited_by_count":68},{"year":2024,"cited_by_count":42},{"year":2023,"cited_by_count":33},{"year":2022,"cited_by_count":18},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":7}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2020-02-07T00:00:00"}