{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005812793,0.001330611,0.002292098,0.001282262,0.0009552731,0.002456293,0.001731502,0.001624718,0.001855181],"category_scores_gemma":[0.02946468,0.001012589,0.0009479956,0.002158975,0.002539392,0.005803297,0.002390429,0.002481259,0.0005558364],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002152659,"about_ca_system_score_gemma":0.002790428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006151648,"about_ca_topic_score_gemma":0.00523027,"domain_scores_codex":[0.9964088,0.001733093,0.0001900599,0.0005151027,0.0009359915,0.0002169783],"domain_scores_gemma":[0.9696315,0.02724242,0.0008242432,0.001116826,0.0009944186,0.0001905473],"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.0005322038,0.0001044176,0.001520556,0.0004176977,0.0001666643,0.00007762399,0.0002419979,0.6797283,0.002601318,0.1314436,0.00304909,0.1801165],"study_design_scores_gemma":[0.00003122201,0.00003184844,0.0002505091,0.0000194209,0.00001882313,0.00002717126,0.0000202771,0.9170555,0.0007567204,0.08114533,0.0006251053,0.00001796637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00643487,0.0008185574,0.9912263,0.0004636502,0.00003741967,0.00003945902,0.00004315768,0.0001248486,0.0008117468],"genre_scores_gemma":[0.5184326,0.003562988,0.4714895,0.0005072679,0.0004629785,0.0005362384,0.0003887487,0.0002406849,0.00437903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006151648,"threshold_uncertainty_score":0.03074133,"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."}}