{"id":"W2582646431","doi":"10.1016/j.automatica.2016.12.025","title":"Sensor selection for Kalman filtering of linear dynamical systems: Complexity, limitations and greedy algorithms","year":2017,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":162,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Intel Corporation","keywords":"Submodular set function; Greedy algorithm; A priori and a posteriori; Kalman filter; Mathematical optimization; Algorithm; Covariance; Linear dynamical system; Greedy randomized adaptive search procedure; Dynamical systems theory; Selection (genetic algorithm); Set (abstract data type); TRACE (psycholinguistics); Computer science; Mathematics; Linear system; Machine learning; Artificial intelligence","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.0001992587,0.0001159106,0.0002233616,0.0000698592,0.0005793254,0.0003023162,0.0003476002,0.00006997031,0.000002276468],"category_scores_gemma":[0.0001629082,0.0001118871,0.00005839679,0.000093991,0.0001228828,0.0003149695,0.0001442238,0.00007837979,0.000005747001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002474964,"about_ca_system_score_gemma":0.00002028975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007861242,"about_ca_topic_score_gemma":0.00002369272,"domain_scores_codex":[0.9990378,0.0000378567,0.0003000327,0.0002516978,0.0001670181,0.0002056138],"domain_scores_gemma":[0.998886,0.0001978925,0.0002354899,0.0004195526,0.0001730102,0.00008808986],"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.00008244337,0.0009283998,0.002006443,0.001653798,0.0007840612,0.00002745568,0.002506864,0.01868964,0.007462087,0.5278208,0.004980518,0.4330575],"study_design_scores_gemma":[0.0003301185,0.0001446118,0.005533337,0.00004715116,0.00001548956,0.00004516467,0.0000421854,0.9911362,0.0002092187,0.001623872,0.0007502669,0.0001223818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01856445,0.00002216697,0.9794444,0.0004838715,0.0004395123,0.0003178561,0.00003541231,0.0002079947,0.0004842834],"genre_scores_gemma":[0.7195403,0.000007704104,0.2801458,0.00001663945,0.00009798509,0.00002960068,0.000009022668,0.00001016149,0.0001427348],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9724466,"threshold_uncertainty_score":0.4562624,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07720441144447505,"score_gpt":0.301143626455096,"score_spread":0.2239392150106209,"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."}}