{"id":"W3090901509","doi":"","title":"BIT*: Sampling-based optimal planning via Batch Informed Trees","year":2014,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristic; Computer science; Sampling (signal processing); Bit (key); Mathematical optimization; Fast marching method; Tree (set theory); Work (physics); Algorithm; Artificial intelligence; Mathematics; Engineering; Computer vision","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007920193,0.0006095353,0.0007379287,0.0004499549,0.0004598237,0.0008987657,0.001404351,0.0006865201,0.005364652],"category_scores_gemma":[0.00253305,0.000426355,0.0005536415,0.0009388498,0.0006153684,0.001304578,0.001041089,0.001315474,0.000709138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007777302,"about_ca_system_score_gemma":0.001667937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009400477,"about_ca_topic_score_gemma":0.008972212,"domain_scores_codex":[0.9994889,0.0001587136,0.00002495,0.00007368053,0.0001990012,0.00005478439],"domain_scores_gemma":[0.9991186,0.0004941995,0.00006060867,0.0001392157,0.0001330914,0.00005432216],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003675388,0.00006604663,0.0004482181,0.0001028099,0.00003905893,0.0000708121,0.00007255388,0.7951277,0.00394055,0.02951388,0.004312665,0.1659382],"study_design_scores_gemma":[0.00001897403,0.00003568818,0.00004228468,0.000005695013,0.000004837477,0.00001374267,0.000006844601,0.9904419,0.001092084,0.006871067,0.0014614,0.000005414783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007253142,0.0001351942,0.9892116,0.0000862025,0.00003940587,0.00005790973,0.00008440525,0.0009998154,0.002132398],"genre_scores_gemma":[0.2613051,0.0002426436,0.7344788,0.00011697,0.00003237241,0.0002272638,0.0003597532,0.0002814649,0.002955676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009400477,"threshold_uncertainty_score":0.01869154,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03422038504846613,"score_gpt":0.2903183676406001,"score_spread":0.256097982592134,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}