{"id":"W2128371572","doi":"10.65109/yget7348","title":"Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs","year":2009,"lang":"en","type":"preprint","venue":"","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Partially observable Markov decision process; Computer science; Backup; Pruning; Heuristics; Mathematical optimization; Heuristic; Computation; Markov decision process; Bounded function; Markov process; Algorithm; Artificial intelligence; Markov chain; Machine learning; Mathematics; Markov model","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.001073505,0.0005758944,0.0005437541,0.0003864751,0.0003296732,0.0009501033,0.002482903,0.0003589476,0.00004854825],"category_scores_gemma":[0.0006084233,0.000594937,0.000319371,0.0002465507,0.0000424419,0.0003254674,0.001705885,0.0007292157,0.00005275925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004022907,"about_ca_system_score_gemma":0.0005312963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003971763,"about_ca_topic_score_gemma":0.000007989752,"domain_scores_codex":[0.9964677,0.00009941914,0.0008271506,0.001093391,0.0007107423,0.0008016155],"domain_scores_gemma":[0.9966046,0.0008885105,0.0005684485,0.001501965,0.0002393359,0.0001970935],"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.00001440466,0.00006486859,0.0001533692,0.0002692461,0.00005817042,0.00001461451,0.000199018,0.977072,0.0001371923,0.01474718,0.001985409,0.005284506],"study_design_scores_gemma":[0.0006756178,0.000550002,0.00007015347,0.0003492493,0.00004669177,0.000002878252,0.00002705759,0.991608,0.001577894,0.002165022,0.002239647,0.0006878217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005586554,0.00007117758,0.9887437,0.000589151,0.001266657,0.001592791,0.000004600843,0.001119759,0.00605357],"genre_scores_gemma":[0.2593442,0.00001418365,0.7385204,0.0008120839,0.000244926,0.0001506521,0.0001168134,0.00005210875,0.0007445632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2587856,"threshold_uncertainty_score":0.9996502,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.028466300042394,"score_gpt":0.2755053467250883,"score_spread":0.2470390466826942,"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."}}