{"id":"W2026586100","doi":"10.1016/j.automatica.2011.03.014","title":"Solving a modified consensus problem of linear multi-agent systems","year":2011,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Consensus; Multi-agent system; Matrix (chemical analysis); State (computer science); Protocol (science); Mathematics; Linear system; Directed graph; State-transition matrix; Network topology; Mathematical optimization; Graph; Control theory (sociology); Laplacian matrix; Spanning tree; Computer science; Topology (electrical circuits); Symmetric matrix; Algorithm; Control (management); Discrete mathematics; 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.001269405,0.0007385236,0.00125464,0.0003530663,0.0004560419,0.0008513007,0.001389832,0.001901538,0.002519278],"category_scores_gemma":[0.004736877,0.0004129463,0.0005507494,0.0003989432,0.0006742988,0.001295977,0.001348134,0.001109273,0.0002460817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004935295,"about_ca_system_score_gemma":0.0007228988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002206618,"about_ca_topic_score_gemma":0.001463794,"domain_scores_codex":[0.9993393,0.0002552237,0.00003436424,0.000187669,0.0001157153,0.0000678494],"domain_scores_gemma":[0.9982359,0.001119724,0.0001659909,0.0001340961,0.0002557304,0.00008850628],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001455487,0.00006022494,0.0003099276,0.0001295334,0.00007036297,0.0001238517,0.00009058354,0.9577079,0.003733173,0.01107632,0.0007863822,0.02576626],"study_design_scores_gemma":[0.00002073185,0.0000381292,0.00004751346,0.000002194297,0.000006794292,0.000009027281,0.00001147475,0.995184,0.0003790582,0.004118592,0.0001788637,0.000003643923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07878952,0.0001814219,0.9168423,0.0003506428,0.0001046505,0.00007377326,0.00003159891,0.0001252692,0.003500753],"genre_scores_gemma":[0.8702445,0.000119162,0.1237046,0.0001094005,0.00009005736,0.0001475349,0.00008662119,0.00005885493,0.005439175],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002519278,"threshold_uncertainty_score":0.008427858,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06412674146181026,"score_gpt":0.2562315195572753,"score_spread":0.1921047780954651,"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."}}