{"id":"W1494905438","doi":"10.1007/978-3-540-85128-8_6","title":"Constructive Path Planning for Natural Phenomena Modeling","year":2008,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Motion planning; Constructive; Randomness; Computer science; Artificial intelligence; Path (computing); Robotics; Any-angle path planning; Roulette; Mathematical optimization; Shortest path problem; Theoretical computer science; Graph; Process (computing); Algorithm; Robot; Mathematics","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.0006130849,0.0012121,0.0009081063,0.0008610004,0.0006315832,0.001722797,0.002301938,0.001039908,0.009488232],"category_scores_gemma":[0.001820878,0.0007285282,0.001069872,0.001811294,0.001980989,0.002125297,0.001246272,0.002664343,0.002260769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001352232,"about_ca_system_score_gemma":0.001390047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004983958,"about_ca_topic_score_gemma":0.006891775,"domain_scores_codex":[0.9995404,0.0001510669,0.0000247574,0.00006990558,0.0001936802,0.00002022379],"domain_scores_gemma":[0.9993541,0.0004360164,0.00002384864,0.00008070132,0.00008536212,0.00001997995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009964278,0.00001966863,0.0000689803,0.0003550348,0.00002585659,0.00007461089,0.0001588358,0.1327973,0.0006774652,0.7335336,0.0119209,0.1203578],"study_design_scores_gemma":[0.000006795877,0.00001009673,0.00003473579,0.00008599584,0.00001640627,0.00006249956,0.00004045204,0.2551282,0.0006418891,0.6972584,0.04669998,0.0000145576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006353054,0.002110364,0.9774861,0.0003006393,0.0001077454,0.00003945507,0.0001416998,0.0004325149,0.01874617],"genre_scores_gemma":[0.05460318,0.004494414,0.9238228,0.0001584722,0.0001675582,0.0002367956,0.0005289429,0.0003207779,0.01566693],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009488232,"threshold_uncertainty_score":0.03174126,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1438278063012357,"score_gpt":0.3556633046860498,"score_spread":0.2118354983848142,"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."}}