{"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":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.003204623,0.0001927305,0.0003114592,0.0004721135,0.0002245801,0.0009015346,0.007379165,0.0001080726,0.00005538311],"category_scores_gemma":[0.003529023,0.0001325972,0.0001813167,0.0008924152,0.0003269672,0.0010253,0.001586837,0.001649871,0.0002716206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003474655,"about_ca_system_score_gemma":0.002372894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002341535,"about_ca_topic_score_gemma":0.000003296774,"domain_scores_codex":[0.9931292,0.0003149721,0.0008719677,0.0002495531,0.004753298,0.0006809961],"domain_scores_gemma":[0.9932074,0.002544533,0.0002622014,0.0004317429,0.003059695,0.0004944039],"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.000386969,0.0001889769,0.001212838,0.00002998723,0.000557891,0.0008970554,0.00956296,0.9169806,0.001566622,0.02342556,0.02361042,0.02158018],"study_design_scores_gemma":[0.00147731,0.001017729,0.003694038,0.0001644344,0.00001355619,0.0007096446,0.0006461684,0.9852015,0.001985724,0.001087693,0.003751366,0.0002508407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01847269,0.0001640404,0.8207474,0.1545146,0.001213927,0.0003349486,0.000008918122,0.00008047342,0.004463035],"genre_scores_gemma":[0.5510128,0.0002455458,0.4446151,0.001887718,0.001564375,0.000005333034,0.00000682979,0.00003513086,0.0006272494],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.53254,"threshold_uncertainty_score":0.9979914,"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."}}