{"id":"https://openalex.org/W1814533834","doi":"https://doi.org/10.1109/icra.2015.7139620","title":"Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs","display_name":"Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1814533834","doi":"https://doi.org/10.1109/icra.2015.7139620","mag":"1814533834"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2015.7139620","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2015.7139620","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1405.5848","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jonathan D. Gammell","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":"Jonathan D. Gammell","raw_affiliation_strings":["Autonomous Space Robotics Lab at the University of Toronto, Ontario, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Autonomous Space Robotics Lab at the University of Toronto, Ontario, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Siddhartha S. Srinivasa","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Siddhartha S. Srinivasa","raw_affiliation_strings":["The Personal Robotics Lab at Carnegie Mellon University, Pittsburgh, Pennsylvania, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Personal Robotics Lab at Carnegie Mellon University, Pittsburgh, Pennsylvania, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","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":["Autonomous Space Robotics Lab at the University of Toronto, Ontario, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Autonomous Space Robotics Lab at the University of Toronto, Ontario, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.7344,"has_fulltext":false,"cited_by_count":392,"citation_normalized_percentile":{"value":0.98711963,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"3067","last_page":"3074"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9983999729156494,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9897000193595886,"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/scalability","display_name":"Scalability","score":0.5924999713897705},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5422000288963318},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5088000297546387},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44769999384880066},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.3443000018596649},{"id":"https://openalex.org/keywords/random-forest","display_name":"Random forest","score":0.3125},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.31139999628067017},{"id":"https://openalex.org/keywords/random-search","display_name":"Random search","score":0.2962999939918518}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5924999713897705},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5422000288963318},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5175999999046326},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5088000297546387},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44769999384880066},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4397999942302704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4124000072479248},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39070001244544983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37389999628067017},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.35100001096725464},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3443000018596649},{"id":"https://openalex.org/C169258074","wikidata":"https://www.wikidata.org/wiki/Q245748","display_name":"Random forest","level":2,"score":0.3125},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.31139999628067017},{"id":"https://openalex.org/C126661757","wikidata":"https://www.wikidata.org/wiki/Q4925641","display_name":"Random search","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C2988400853","wikidata":"https://www.wikidata.org/wiki/Q69883","display_name":"Local planning","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.2754000127315521},{"id":"https://openalex.org/C121194460","wikidata":"https://www.wikidata.org/wiki/Q856741","display_name":"Random walk","level":2,"score":0.2736999988555908},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2712000012397766},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.267300009727478},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2624000012874603},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.25609999895095825},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2015.7139620","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2015.7139620","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"},{"id":"pmh:oai:arXiv.org:1405.5848","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1405.5848","pdf_url":"https://arxiv.org/pdf/1405.5848","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:1405.5848","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1405.5848","pdf_url":"https://arxiv.org/pdf/1405.5848","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":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W630423399","https://openalex.org/W1509540129","https://openalex.org/W1578640434","https://openalex.org/W1589297171","https://openalex.org/W1967533244","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/W2023624803","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/W2088521668","https://openalex.org/W2098030884","https://openalex.org/W2101508786","https://openalex.org/W2110762409","https://openalex.org/W2113256452","https://openalex.org/W2124455817","https://openalex.org/W2128990851","https://openalex.org/W2141161225","https://openalex.org/W2141664020","https://openalex.org/W2142624263","https://openalex.org/W2143826757","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/W6608150121","https://openalex.org/W6671559892","https://openalex.org/W6681425221","https://openalex.org/W6770249431"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,34],"present":[4],"Batch":[5],"Informed":[6],"Trees":[7,60],"(BIT*),":[8],"a":[9,23],"planning":[10,18],"algorithm":[11],"based":[12],"on":[13],"unifying":[14],"graph-":[15],"and":[16],"sampling-based":[17,54],"techniques.":[19],"By":[20],"recognizing":[21],"that":[22],"set":[24],"of":[25,43,53],"samples":[26],"describes":[27],"an":[28],"implicit":[29],"random":[30],"geometric":[31],"graph":[32],"(RGG),":[33],"are":[35],"able":[36],"to":[37],"combine":[38],"the":[39,50],"efficient":[40],"ordered":[41],"nature":[42],"graph-based":[44],"techniques,":[45],"such":[46,56],"as":[47,57],"A*,":[48],"with":[49],"anytime":[51],"scalability":[52],"algorithms,":[55],"Rapidly-exploring":[58],"Random":[59],"(RRT).":[61]},"counts_by_year":[{"year":2026,"cited_by_count":19},{"year":2025,"cited_by_count":58},{"year":2024,"cited_by_count":48},{"year":2023,"cited_by_count":43},{"year":2022,"cited_by_count":46},{"year":2021,"cited_by_count":50},{"year":2020,"cited_by_count":40},{"year":2019,"cited_by_count":35},{"year":2018,"cited_by_count":20},{"year":2017,"cited_by_count":22},{"year":2016,"cited_by_count":11}],"updated_date":"2026-07-05T07:55:05.734416","created_date":"2016-06-24T00:00:00"}