{"id":"W2964138387","doi":"","title":"Approximate linear programming for first-order MDPs","year":2005,"lang":"en","type":"article","venue":"","topic":"Elevator Systems and Control","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Markov decision process; Computer science; Linear programming; Bellman equation; Mathematical optimization; Algorithm; Set (abstract data type); Scheduling (production processes); Domain (mathematical analysis); Markov process; 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.002033672,0.001346709,0.001450755,0.0007381288,0.0005817628,0.001423974,0.001283392,0.001404722,0.005141055],"category_scores_gemma":[0.008865428,0.0008419221,0.001088831,0.0009461589,0.001217081,0.001568894,0.001484007,0.002698021,0.0006410326],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001955825,"about_ca_system_score_gemma":0.002208015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006988256,"about_ca_topic_score_gemma":0.008081386,"domain_scores_codex":[0.9989448,0.0004157465,0.0000402447,0.0001441862,0.0003157586,0.0001392124],"domain_scores_gemma":[0.9948377,0.004404764,0.0002361562,0.0001823445,0.000261522,0.00007759693],"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.00001875093,0.00001384793,0.00009883519,0.00005159356,0.00001355093,0.00001969433,0.00002919535,0.9590232,0.000195277,0.03098541,0.0003892246,0.009161313],"study_design_scores_gemma":[0.00000538491,0.000006355646,0.00001011397,0.00000445202,0.000002107386,0.000003857807,0.000003417521,0.9834573,0.0001037681,0.01612298,0.0002786659,0.000001686608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002809671,0.0001287972,0.9951381,0.0001154068,0.00001439198,0.00002382198,0.00003860978,0.0001914041,0.001539824],"genre_scores_gemma":[0.3346055,0.0005690624,0.6576868,0.00021431,0.00008837348,0.0006081897,0.0003043557,0.0002953048,0.005628077],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006988256,"threshold_uncertainty_score":0.0171985,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00835195303255513,"score_gpt":0.2103922993557825,"score_spread":0.2020403463232274,"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."}}