{"id":"W3103346840","doi":"","title":"Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs","year":2015,"lang":"en","type":"preprint","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":417,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Bit (key); Computer science; Sampling (signal processing); Random graph; Algorithm; Theoretical computer science; Artificial intelligence; Graph; 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.0007726917,0.0009022828,0.0008944425,0.0006187246,0.0005390003,0.0008393512,0.001550034,0.0009392,0.003429283],"category_scores_gemma":[0.003105013,0.0006309457,0.0007177793,0.001035806,0.001076076,0.001407578,0.001449791,0.001305965,0.0007198584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007629335,"about_ca_system_score_gemma":0.001863043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005498531,"about_ca_topic_score_gemma":0.008009171,"domain_scores_codex":[0.9995371,0.000155414,0.00002367154,0.00007210457,0.0001636487,0.00004802925],"domain_scores_gemma":[0.9989299,0.0006561092,0.00008956347,0.000167662,0.00009857206,0.00005812209],"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.0001959012,0.0000568227,0.0004460143,0.0001469315,0.00004562093,0.00008232728,0.0001062456,0.8262131,0.003426,0.04565706,0.005099102,0.1185249],"study_design_scores_gemma":[0.00002560855,0.0000394467,0.00003754988,0.000007148642,0.000007594038,0.00001970614,0.000008476853,0.9819947,0.0009213445,0.01526626,0.001663743,0.000008370341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008524379,0.0002082999,0.9877083,0.00009732505,0.00004019064,0.00005447889,0.0001047065,0.0009914374,0.002270856],"genre_scores_gemma":[0.2525398,0.0003677387,0.7427258,0.0001502039,0.0000350968,0.0003356341,0.0004990633,0.0003580474,0.002988448],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005498531,"threshold_uncertainty_score":0.01147211,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08597512149257881,"score_gpt":0.3449501781571991,"score_spread":0.2589750566646203,"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."}}