{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006704812,0.0004188237,0.000376374,0.0004683514,0.0003021091,0.0004884006,0.001047733,0.0002175719,0.00001942509],"category_scores_gemma":[0.00005179333,0.0003491618,0.00009098147,0.0003442586,0.0006618961,0.0005616352,0.0002819168,0.0004554213,0.000006253986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002507435,"about_ca_system_score_gemma":0.0006133427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007778253,"about_ca_topic_score_gemma":0.00002606192,"domain_scores_codex":[0.9973761,0.00001774509,0.0003729783,0.0009853067,0.0005808831,0.0006669374],"domain_scores_gemma":[0.9982026,0.0003921641,0.0002920211,0.0006461402,0.0002736964,0.0001934127],"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.000007616346,0.00001191489,0.0001675328,0.00002825791,0.000009926653,0.00001398123,0.0006334159,0.09389564,0.00001124348,0.02382976,0.000005876189,0.8813848],"study_design_scores_gemma":[0.0008199395,0.0004113979,0.0002278583,0.0008333652,0.00002380615,0.0002632214,0.000001904282,0.962719,0.0002002583,0.02345403,0.009888512,0.001156688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002248371,0.000214543,0.9964563,0.0003998233,0.0007853929,0.000778045,0.000006814464,0.0002064256,0.0011302],"genre_scores_gemma":[0.1305154,0.000009535139,0.8684775,0.0005628795,0.0002839414,0.00003256306,0.00001351722,0.00002693386,0.00007770177],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8802282,"threshold_uncertainty_score":0.999896,"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."}}