{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004479032,0.0002113201,0.0002323294,0.0001865396,0.0001628187,0.0002184394,0.001050589,0.00009662237,0.00002234084],"category_scores_gemma":[0.0001871639,0.0001812886,0.00007111383,0.0003731709,0.00004683992,0.0004205767,0.0001730413,0.0001790177,0.0002082942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004332738,"about_ca_system_score_gemma":0.0001243715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004851669,"about_ca_topic_score_gemma":0.000002584507,"domain_scores_codex":[0.998335,0.00005228587,0.0003102412,0.0004055218,0.0003903215,0.0005066391],"domain_scores_gemma":[0.9984083,0.0005626254,0.0001063634,0.0006716563,0.00006638353,0.0001846698],"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.00001367364,0.00007494958,0.007779922,0.00002592878,0.0000273974,0.00002450719,0.001046531,0.9175833,0.0005261641,0.004148782,0.002851209,0.06589767],"study_design_scores_gemma":[0.0004885735,0.0001585046,0.009157416,0.00004189732,0.000003991529,0.00001575933,0.00001549713,0.9848289,0.001035753,0.0002255738,0.003754492,0.0002735847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005909036,0.00001584166,0.9862649,0.0005979422,0.0004421455,0.00009883866,7.546095e-7,0.0006727189,0.005997754],"genre_scores_gemma":[0.2604784,2.126443e-7,0.7383414,0.0008088972,0.000101578,0.00001022648,0.000006924352,0.00001128623,0.0002411222],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2545693,"threshold_uncertainty_score":0.7392733,"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."}}