{"id":"W3004407706","doi":"10.1177/0278364919890396","title":"Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search","year":2020,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Heuristics; A priori and a posteriori; Motion planning; Domain (mathematical analysis); Path (computing); Asymptotically optimal algorithm; Random search; Approximation algorithm; Robotics","routes":{"ca_aff":true,"ca_fund":true,"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.0009306091,0.001224591,0.001327901,0.000720472,0.0006723269,0.001097937,0.001948293,0.001512627,0.004243805],"category_scores_gemma":[0.00456791,0.0007232815,0.0009933227,0.001134274,0.001187094,0.002414083,0.001805967,0.001649667,0.000965272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001122563,"about_ca_system_score_gemma":0.003105644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009496843,"about_ca_topic_score_gemma":0.01371462,"domain_scores_codex":[0.9993411,0.0001756829,0.00004272756,0.0001123486,0.0002395939,0.00008855291],"domain_scores_gemma":[0.9985992,0.0009059738,0.00009827028,0.0001799035,0.0001357643,0.00008089377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002791088,0.00007488713,0.0005969196,0.0002384338,0.00005139447,0.0001057527,0.0001518157,0.8122352,0.002596636,0.05471581,0.006052481,0.1229016],"study_design_scores_gemma":[0.00003856045,0.00007146364,0.00006713407,0.00001903556,0.00001874899,0.00003097495,0.00002199706,0.9695015,0.0008250662,0.02666948,0.002722,0.00001396206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01149523,0.0006206145,0.9802371,0.0002037214,0.00006281681,0.00009900537,0.0001658109,0.00159652,0.00551926],"genre_scores_gemma":[0.3212948,0.0008694853,0.6708235,0.0003417594,0.0000585591,0.0004009822,0.0007715452,0.0004890069,0.00495032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009496843,"threshold_uncertainty_score":0.01888311,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.125463022093777,"score_gpt":0.3919444532699686,"score_spread":0.2664814311761916,"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."}}