{"id":"W1986210666","doi":"10.1109/iros.2010.5650614","title":"Extending rapidly-exploring random trees for asymptotically optimal anytime motion planning","year":2010,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Extension (predicate logic); State (computer science); Asymptotically optimal algorithm; Mathematical optimization; Computer science; Action (physics); Motion planning; Tree (set theory); Algorithm; Mathematics; Artificial intelligence; Robot; Combinatorics","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.001016777,0.0002313667,0.0002926681,0.00020854,0.0003039348,0.0003257396,0.0008509711,0.0001135955,0.00002229532],"category_scores_gemma":[0.0004200733,0.0002070057,0.0001278261,0.000259542,0.00005029247,0.001124528,0.0001823151,0.0003301844,0.00004743692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002719228,"about_ca_system_score_gemma":0.00004977675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006908318,"about_ca_topic_score_gemma":6.460604e-7,"domain_scores_codex":[0.9980686,0.00004571573,0.0003626247,0.0005938148,0.0003325857,0.0005967087],"domain_scores_gemma":[0.9984012,0.0006567976,0.000103633,0.0005330959,0.0001051293,0.0002001257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002846136,0.0004668703,0.007316436,0.0001038312,0.0002602036,0.0002172944,0.006083654,0.2853457,0.1123121,0.1503037,0.002518006,0.4347876],"study_design_scores_gemma":[0.001794827,0.0001258933,0.00542063,0.00004172683,0.00001313557,0.00006199236,0.00004548482,0.9854872,0.005486365,0.0006499538,0.000547328,0.0003254469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03568518,0.00002653996,0.959691,0.0004193657,0.001698531,0.0003148519,0.000001863813,0.0006379877,0.001524646],"genre_scores_gemma":[0.2743957,0.000001481114,0.7248401,0.0000768258,0.0003183061,0.00007914931,0.000005300727,0.00001931943,0.0002637999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7001415,"threshold_uncertainty_score":0.8441448,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04447851612308683,"score_gpt":0.2830100876012684,"score_spread":0.2385315714781815,"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."}}