On the public citation graph

Sufficient conditions for the convergence of a class of nonlinear distributed consensus algorithms

0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1109/cdc.2004.1429377openalex-snapshot
Stability of continuous-time distributed consensus algorithms
inferredcites →https://doi.org/10.1109/jproc.2006.887293openalex-snapshot
Consensus and Cooperation in Networked Multi-Agent Systems
inferredcites →https://doi.org/10.1109/tac.2004.834113openalex-snapshot
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
inferredcites →https://doi.org/10.1109/tac.2004.841888openalex-snapshot
Stability of multiagent systems with time-dependent communication links
inferredcites →https://doi.org/10.1109/tac.2005.846556openalex-snapshot
Consensus seeking in multiagent systems under dynamically changing interaction topologies
inferredcites →https://doi.org/10.1109/tac.2005.864190openalex-snapshot
Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory
inferredcites →https://doi.org/10.1109/tac.2007.895948openalex-snapshot
Flocking in Fixed and Switching Networks
inferredcites →https://doi.org/10.1109/tac.2010.2072570openalex-snapshot
A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems
inferredcites →https://doi.org/10.1109/tro.2007.900638openalex-snapshot
Distributed Coordination Control of Multiagent Systems While Preserving Connectedness
inferredcites →https://doi.org/10.1109/tro.2008.2002313openalex-snapshot
Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots
inferredcites →https://doi.org/10.1137/050626405openalex-snapshot
State Agreement for Continuous‐Time Coupled Nonlinear Systems
inferredcites →https://doi.org/10.3182/20050703-6-cz-1902.01554openalex-snapshot
ON THE STATE AGREEMENT PROBLEM FOR MULTIPLE NONLINEAR DYNAMICAL SYSTEMS

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-35713-9_20openalex-snapshot
Koopman Performance Analysis of Nonlinear Consensus Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-97586-3_2openalex-snapshot
Semi-global Leaderless Consensus of Circular Motion with Input Saturation
inferred← citeshttps://doi.org/10.1016/j.automatica.2011.02.051openalex-snapshot
Leader localization in multi-agent systems subject to failure: A graph-theoretic approach
inferred← citeshttps://doi.org/10.1016/j.automatica.2012.11.021openalex-snapshot
Consensus in switching networks with sectorial nonlinear couplings: Absolute stability approach
inferred← citeshttps://doi.org/10.1016/j.ins.2013.12.006openalex-snapshot
Consensus on compact Riemannian manifolds
inferred← citeshttps://doi.org/10.1016/j.jmaa.2012.11.018openalex-snapshot
Consensus on complete Riemannian manifolds in finite time
inferred← citeshttps://doi.org/10.1016/j.sysconle.2011.10.013openalex-snapshot
Iterative learning approaches to design finite-time consensus protocols for multi-agent systems
inferred← citeshttps://doi.org/10.1016/j.sysconle.2012.04.007openalex-snapshot
Tracking control over a finite interval for multi-agent systems with a time-varying reference trajectory
inferred← citeshttps://doi.org/10.1080/00051144.2018.1492688openalex-snapshot
An overview of the consensus problem in the control of multi-agent systems
inferred← citeshttps://doi.org/10.1080/00207179.2012.747735openalex-snapshot
Nonlinear consensus via continuous, sampled, and aperiodic updates
inferred← citeshttps://doi.org/10.1080/00207179.2017.1318331openalex-snapshot
Reach a nonlinear consensus for MAS via doubly stochastic quadratic operators
inferred← citeshttps://doi.org/10.1080/00207721.2013.798445openalex-snapshot
Robust iterative learning protocols for finite-time consensus of multi-agent systems with interval uncertain topologies
inferred← citeshttps://doi.org/10.1109/acc.2012.6314733openalex-snapshot
Undamped nonlinear consensus using integral Lyapunov functions
inferred← citeshttps://doi.org/10.1109/acc.2012.6315588openalex-snapshot
Cooperative control of multi-agent systems with limited angular field of view
inferred← citeshttps://doi.org/10.1109/acc.2012.6315666openalex-snapshot
Convergence analysis for a class of bounded distributed connectivity preserving consensus algorithms for unicycles
inferred← citeshttps://doi.org/10.1109/chicc.2015.7260764openalex-snapshot
Cluster consensus in networks of agents with weighted cooperative-competitive interactions via nonlinear protocols
inferred← citeshttps://doi.org/10.1109/tac.2012.2224251openalex-snapshot
Consensus Problems on Networks With Antagonistic Interactions
inferred← citeshttps://doi.org/10.1109/tac.2013.2251792openalex-snapshot
Connectivity Preservation in Nonholonomic Multi-Agent Systems: A Bounded Distributed Control Strategy
inferred← citeshttps://doi.org/10.1109/tac.2014.2309281openalex-snapshot
Distributed Control of Networked Dynamical Systems: Static Feedback, Integral Action and Consensus
inferred← citeshttps://doi.org/10.1109/tcns.2019.2940264openalex-snapshot
A Framework of Multiagent Systems Behavioral Control Under State-Dependent Network Protocols
inferred← citeshttps://doi.org/10.1109/tcyb.2014.2354519openalex-snapshot
Popov-Type Criterion for Consensus in Nonlinearly Coupled Networks
inferred← citeshttps://doi.org/10.1109/tsp.2013.2282912openalex-snapshot
Non-Linear Distributed Average Consensus Using Bounded Transmissions
inferred← citeshttps://doi.org/10.1109/tsp.2015.2408564openalex-snapshot
Robust Consensus in the Presence of Impulsive Channel Noise
inferred← citeshttps://doi.org/10.1137/19m1268252openalex-snapshot
Network Consensus in the Wasserstein Metric Space of Probability Measures
inferred← citeshttps://doi.org/10.1515/jaiscr-2018-0003openalex-snapshot
Nonlinear Convergence Algorithm: Structural Properties with Doubly Stochastic Quadratic Operators for Multi-Agent Systems
inferred← citeshttps://doi.org/10.23919/ecc.2013.6669764openalex-snapshot
Stability of continuous-time consensus algorithms for switching networks with bidirectional interaction
inferred← citeshttps://doi.org/10.31436/ijpcc.v2i1.30openalex-snapshot
Nonlinear Consensus for Multi-Agent Systems using Positive Intractions of Doubly Stochastic Quadratic Operators
inferred← citeshttps://doi.org/10.3182/20130204-3-fr-4031.00227openalex-snapshot
Average consensus in switching nonlinearly coupled networks with time-varying delays.
inferred← citeshttps://doi.org/10.3182/20130904-3-fr-2041.00205openalex-snapshot
The Circle Criterion for Synchronization in Nonlinearly Coupled Networks.
inferred← citeshttps://doi.org/10.3182/20130904-3-fr-2041.00207openalex-snapshot
The Popov Criterion For Consensus Between Delayed Agents
inferred← citeshttps://doi.org/10.3182/20140824-6-za-1003.00341openalex-snapshot
Distributed Nonlinear Consensus in the Space of Probability Measures
inferred← citeshttps://doi.org/10.3390/sym11121519openalex-snapshot
Nonlinear Consensus Protocol Modified from Doubly Stochastic Quadratic Operators in Networks of Dynamic Agents
inferred← citeshttps://doi.org/10.3390/sym12101692openalex-snapshot
A Fast Non-Linear Symmetry Approach for Guaranteed Consensus in Network of Multi-Agent Systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.