{"id":"W4380203506","doi":"10.1007/s10489-023-04603-7","title":"Linear programming-based solution methods for constrained partially observable Markov decision processes","year":2023,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Mathematical optimization; Markov decision process; Flexibility (engineering); Time horizon; Linear programming; Partially observable Markov decision process; Observable; Dynamic programming; Linear approximation; Markov chain; Markov process; Algorithm; Markov model; Mathematics; Nonlinear system","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":[],"consensus_categories":[],"category_scores_codex":[0.0004785682,0.0001423051,0.0001470985,0.0001148342,0.0001088175,0.00003264747,0.0001503179,0.00009050144,0.00004895826],"category_scores_gemma":[0.0001832393,0.0001484649,0.00004635609,0.001123321,0.00006530028,0.00007001331,0.00000639502,0.0000937287,0.00006067746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002816441,"about_ca_system_score_gemma":0.0001053919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003775456,"about_ca_topic_score_gemma":0.00005720195,"domain_scores_codex":[0.9989736,0.000007061586,0.0003865318,0.0002245698,0.0001141656,0.0002940917],"domain_scores_gemma":[0.9990489,0.0004674922,0.00003804118,0.0001907933,0.0001960876,0.00005866213],"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.00006121591,0.0000587541,0.00007427344,0.0004570803,0.00003213769,6.835776e-7,0.000296532,0.2179681,0.01694887,0.009359673,0.0006856335,0.754057],"study_design_scores_gemma":[0.0002982173,0.00007214624,0.0003647293,0.00006478499,0.00004033704,6.515196e-7,0.0003111332,0.6216919,0.2885805,0.005258308,0.08292683,0.0003904341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003702612,0.00003488657,0.9936431,0.00009948107,0.0002028865,0.0008392371,0.00002381809,0.001072279,0.0003816727],"genre_scores_gemma":[0.5227754,0.00002624384,0.4759375,0.00007414399,0.0000338675,0.0008723151,0.0002183859,0.00002781851,0.00003429785],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7536666,"threshold_uncertainty_score":0.6054223,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05473292348790335,"score_gpt":0.3509411642421593,"score_spread":0.2962082407542559,"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."}}