{"id":"W1996400016","doi":"10.1007/s12555-012-9315-x","title":"Fault-tolerant shortest connection topology design for formation control","year":2014,"lang":"en","type":"article","venue":"International Journal of Control Automation and Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Connection (principal bundle); Control reconfiguration; Topology (electrical circuits); Fault tolerance; Computer science; Shortest path problem; Distributed computing; Path (computing); Controller (irrigation); Network topology; Control (management); Engineering; Computer network; Theoretical computer science; Embedded system; 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.00234559,0.0001719928,0.0004611747,0.0003343078,0.0001089724,0.000522626,0.0005986464,0.0001138447,0.000003969731],"category_scores_gemma":[0.000567109,0.000144828,0.0001464633,0.00008222648,0.00003001008,0.001226967,0.00001756856,0.0001064575,0.000008070229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001449923,"about_ca_system_score_gemma":0.00006718929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002186899,"about_ca_topic_score_gemma":0.000004649412,"domain_scores_codex":[0.9973764,0.0005043399,0.001149096,0.0001903243,0.0005704255,0.0002094258],"domain_scores_gemma":[0.9959749,0.0009473212,0.001234061,0.0001708914,0.001569167,0.0001036854],"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.001644267,0.0004919377,0.002748141,0.0001960035,0.002156932,0.00005170792,0.001945595,0.3093823,0.02941677,0.507834,0.009906847,0.1342255],"study_design_scores_gemma":[0.007679654,0.000331686,0.001198106,0.00008992072,0.00004031777,0.0005359752,0.00007083514,0.9791285,0.0001111309,0.0008162983,0.009858162,0.0001394516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003726798,0.0002444702,0.9877805,0.003068642,0.004236954,0.0006999189,0.00002482971,0.00008295485,0.0001349159],"genre_scores_gemma":[0.9969853,0.000008336046,0.001791501,0.0004448374,0.0006432355,0.00006812095,0.000009453254,0.000009615018,0.0000395623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9932585,"threshold_uncertainty_score":0.5905916,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01904498330422304,"score_gpt":0.2649027729227014,"score_spread":0.2458577896184784,"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."}}