{"id":"W1981860295","doi":"10.1109/acc.2012.6315666","title":"Convergence analysis for a class of bounded distributed connectivity preserving consensus algorithms for unicycles","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Convergence (economics); Nonlinear system; Signal-flow graph; Limit (mathematics); Mathematics; Computer science; Control theory (sociology); Graph; Class (philosophy); Algorithm; Control (management); Theoretical computer science","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.001632788,0.0007475922,0.0007404697,0.0009644263,0.00059373,0.001008703,0.001213127,0.0008839209,0.001121946],"category_scores_gemma":[0.008862019,0.0002426966,0.000560383,0.0005279555,0.001220344,0.001049104,0.001348521,0.000906102,0.0001885504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008726681,"about_ca_system_score_gemma":0.0006610524,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001799785,"about_ca_topic_score_gemma":0.0005934561,"domain_scores_codex":[0.9991227,0.000254074,0.00005532822,0.0001768655,0.0003120378,0.00007895497],"domain_scores_gemma":[0.9966012,0.002102437,0.0003594783,0.0002048652,0.0006112996,0.0001206732],"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.0001116938,0.00004329325,0.0008968659,0.0002025131,0.00005389119,0.0001827332,0.0003635868,0.8643352,0.008296518,0.07702516,0.0008159456,0.04767245],"study_design_scores_gemma":[0.000006871226,0.00003901403,0.00008927072,0.00000731623,0.000004662336,0.0000292093,0.00002046129,0.9909577,0.000674587,0.007791857,0.0003742072,0.000004680262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04516984,0.0003735955,0.9510253,0.0001327098,0.00002393485,0.00005654857,0.00001908835,0.0001737213,0.003025296],"genre_scores_gemma":[0.9369828,0.0004667632,0.06054221,0.00006838343,0.00002332388,0.000190718,0.00007587518,0.00006771848,0.001582161],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001799785,"threshold_uncertainty_score":0.008635163,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05388315343600254,"score_gpt":0.3036440217658252,"score_spread":0.2497608683298226,"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."}}