{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295388,0.0002443822,0.0006758528,0.0001844862,0.0001762235,0.000112435,0.001027824,0.000128186,0.00001899539],"category_scores_gemma":[0.0007977135,0.0002252479,0.000459532,0.001022991,0.00009612736,0.000436647,0.0002321786,0.00006773476,0.000004055163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001131915,"about_ca_system_score_gemma":0.000110415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003755525,"about_ca_topic_score_gemma":0.0001487213,"domain_scores_codex":[0.9976478,0.0001645494,0.0006369721,0.0005030828,0.0003217408,0.000725826],"domain_scores_gemma":[0.9959497,0.001808242,0.0004365796,0.0009658208,0.0006034247,0.0002362228],"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.0004669983,0.002033082,0.204422,0.0008731713,0.009938068,0.000004735229,0.001300946,0.006431047,0.02127636,0.7307112,0.01503308,0.00750929],"study_design_scores_gemma":[0.001917766,0.00009384641,0.01713513,0.00001553716,0.000380322,0.000003439857,0.0001721759,0.9643195,0.009165035,0.001436879,0.005011683,0.0003486826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04552726,0.000186412,0.9504847,0.0005452247,0.0005238074,0.001271999,0.00112497,0.0001822266,0.000153412],"genre_scores_gemma":[0.9572572,0.000001848795,0.04205032,0.00004547727,0.00007152661,0.0002740925,0.0001350762,0.00001230455,0.0001521536],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9578885,"threshold_uncertainty_score":0.9185343,"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."}}