{"id":"W96994324","doi":"10.1007/978-3-642-33558-7_70","title":"Constraint Programming for Path Planning with Uncertainty","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Probabilistic logic; Path (computing); Mathematical optimization; Heuristic; Computer science; Constraint programming; Constraint (computer-aided design); Motion planning; Graph; Search algorithm; Object (grammar); Incremental heuristic search; Algorithm; Theoretical computer science; Mathematics; Beam search; Artificial intelligence; Stochastic programming","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.001180653,0.002154245,0.00184394,0.00107521,0.0007943682,0.002520308,0.003090617,0.001571636,0.01462024],"category_scores_gemma":[0.003655547,0.001193316,0.001661587,0.004544481,0.001471017,0.00262971,0.001903591,0.004473669,0.003086747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002256933,"about_ca_system_score_gemma":0.001838148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009257967,"about_ca_topic_score_gemma":0.008503842,"domain_scores_codex":[0.9986198,0.0004266915,0.00008416577,0.0001985085,0.000593637,0.00007715019],"domain_scores_gemma":[0.998939,0.000714037,0.00004696645,0.000100183,0.0001682591,0.00003165347],"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.00004014823,0.00005844185,0.00009362023,0.001068476,0.0001010961,0.0001288937,0.0001519254,0.2345168,0.001191495,0.4816447,0.03230241,0.248702],"study_design_scores_gemma":[0.00002306133,0.00001823223,0.00007737198,0.0002933672,0.0000330419,0.0000831198,0.00004339666,0.3165959,0.0007133373,0.6190929,0.06298905,0.00003722605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006940053,0.006971756,0.9642482,0.0005757933,0.0002142348,0.00006976844,0.0003429482,0.0002475384,0.02663579],"genre_scores_gemma":[0.04360302,0.01394394,0.9162229,0.0003635696,0.0005749748,0.0006777353,0.001272942,0.0004901066,0.02285071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01462024,"threshold_uncertainty_score":0.0489096,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02066977381266606,"score_gpt":0.2528006425898026,"score_spread":0.2321308687771365,"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."}}