{"id":"W2034114456","doi":"10.1016/j.automatica.2008.04.016","title":"Optimal consensus algorithms for cooperative team of agents subject to partial information","year":2008,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Robustness (evolution); Computer science; Adaptability; Multi-agent system; Minification; Fault tolerance; Information exchange; Consensus algorithm; Mathematical optimization; Control (management); Control theory (sociology); Distributed computing; Algorithm; Mathematics; Artificial intelligence; Economics","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.0002849573,0.0001482315,0.0002967147,0.0001088373,0.0001374931,0.00006746555,0.0004877652,0.00005975011,0.000009245622],"category_scores_gemma":[0.0003734355,0.0001357673,0.00008258242,0.0003087505,0.00005363327,0.0004030381,0.00009988084,0.00005005664,0.0001745511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005669843,"about_ca_system_score_gemma":0.0001670273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002797655,"about_ca_topic_score_gemma":0.0000016019,"domain_scores_codex":[0.9985258,0.00007382029,0.0005730024,0.0001889515,0.000335712,0.0003027399],"domain_scores_gemma":[0.9987373,0.0002124384,0.0001987269,0.0004065431,0.0003140957,0.0001309402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006954113,0.002368387,0.002849738,0.0011221,0.001910062,0.0001414871,0.110775,0.135777,0.01298152,0.1161294,0.4953682,0.1198817],"study_design_scores_gemma":[0.001334305,0.0003049899,0.002235275,0.00003803171,0.00001167499,0.00003394085,0.0001103998,0.9821831,0.006429475,0.00002212621,0.007111374,0.000185283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1157695,0.000008066584,0.8810453,0.0004712867,0.0003708425,0.001182485,0.0001395399,0.0002158351,0.0007971489],"genre_scores_gemma":[0.8959508,6.865939e-7,0.1035377,0.0001953361,0.0000380824,0.0001657219,0.00002531721,0.000006351536,0.00007999378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8464061,"threshold_uncertainty_score":0.553643,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03212601730101935,"score_gpt":0.2806417325183135,"score_spread":0.2485157152172942,"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."}}