{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264411,0.0009130295,0.0009590243,0.0006430804,0.0005333028,0.0006955721,0.001444078,0.0009280965,0.002557464],"category_scores_gemma":[0.006554828,0.0004857794,0.00103641,0.0008160201,0.0009412088,0.001873788,0.001490619,0.001404564,0.0007695361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007399448,"about_ca_system_score_gemma":0.001098971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002364592,"about_ca_topic_score_gemma":0.002531918,"domain_scores_codex":[0.9991761,0.0003166324,0.00003895943,0.0001653932,0.0002204341,0.00008238851],"domain_scores_gemma":[0.9977636,0.001641077,0.0001520594,0.0002029191,0.0001533185,0.00008705021],"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.0001072492,0.00006274481,0.0003288286,0.0001435817,0.00003161344,0.0001211389,0.0001152553,0.8556658,0.002105903,0.07402373,0.001940433,0.06535365],"study_design_scores_gemma":[0.00002507274,0.00004965242,0.00004740583,0.00001218443,0.000009672952,0.00004660767,0.000008524318,0.9483741,0.0004816828,0.04897744,0.001958367,0.000009266783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009410999,0.0004327918,0.9863434,0.0001537488,0.00004143587,0.00005188051,0.00004565685,0.00062508,0.002895066],"genre_scores_gemma":[0.2892783,0.0009450627,0.7055579,0.0001975287,0.00009407845,0.0003646743,0.000320929,0.0003360316,0.002905325],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002557464,"threshold_uncertainty_score":0.008555532,"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."}}