On the public citation graph
Perturbing consensus for complexity: A finite-time discrete biased min-consensus under time-delay and asynchronism
0 signed · 46 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/j.asoc.2008.01.002openalex-snapshot
Solving shortest path problem using particle swarm optimization
inferredcites →https://doi.org/10.1016/j.automatica.2007.07.022openalex-snapshot
Distributed algorithms for reaching consensus on general functions
inferredcites →https://doi.org/10.1016/j.automatica.2008.02.017openalex-snapshot
Consensus protocols for discrete-time multi-agent systems with time-varying delays
inferredcites →https://doi.org/10.1016/j.automatica.2012.05.058openalex-snapshot
Leader–follower consensus over numerosity-constrained random networks
inferredcites →https://doi.org/10.1016/j.automatica.2012.08.003openalex-snapshot
Average consensus on general strongly connected digraphs
inferredcites →https://doi.org/10.1016/j.automatica.2013.02.021openalex-snapshot
Consensus of discrete-time multi-agent systems with transmission nonlinearity
inferredcites →https://doi.org/10.1016/j.automatica.2013.11.008openalex-snapshot
Global consensus for discrete-time multi-agent systems with input saturation constraints
inferredcites →https://doi.org/10.1016/j.cor.2005.03.027openalex-snapshot
Heuristic shortest path algorithms for transportation applications: State of the art
inferredcites →https://doi.org/10.1016/j.knosys.2016.08.027openalex-snapshot
Shortest path computation using pulse-coupled neural networks with restricted autowave
inferredcites →https://doi.org/10.1016/j.neucom.2013.02.023openalex-snapshot
Leader-following consensus of discrete-time multi-agent systems with observer-based protocols
inferredcites →https://doi.org/10.1016/j.patcog.2008.11.020openalex-snapshot
Human identification by quantifying similarity and dissimilarity in electrocardiogram phase space
inferredcites →https://doi.org/10.1016/j.robot.2013.09.004openalex-snapshot
A survey on coverage path planning for robotics
inferredcites →https://doi.org/10.1109/acc.2005.1470243openalex-snapshot
Information consensus of asynchronous discrete-time multi-agent systems
inferredcites →https://doi.org/10.1109/hicss.2015.321openalex-snapshot
Finite-Time Approximate Consensus and Its Application to Distributed Frequency Regulation in Islanded AC Microgrids
inferredcites →https://doi.org/10.1109/lsp.2013.2247756openalex-snapshot
Network Size Estimation Using Distributed Orthogonalization
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.2010.2041610openalex-snapshot
Finite-Time Consensus Problems for Networks of Dynamic Agents
inferredcites →https://doi.org/10.1109/tevc.2002.804323openalex-snapshot
A genetic algorithm for shortest path routing problem and the sizing of populations
inferredcites →https://doi.org/10.1109/tii.2012.2210430openalex-snapshot
Stationary Consensus of Asynchronous Discrete-Time Second-Order Multi-Agent Systems Under Switching Topology
inferredcites →https://doi.org/10.1109/tim.2010.2101312openalex-snapshot
Pneumatic Sensor: A Complete Coverage Improvement Approach for Robotic Cleaners
inferredcites →https://doi.org/10.1109/tmech.2013.2252076openalex-snapshot
An $\bm{O(n\log n)}$ Shortest Path Algorithm Based on Delaunay Triangulation
inferredcites →https://doi.org/10.1109/tnnls.2013.2271454openalex-snapshot
Goal Representation Heuristic Dynamic Programming on Maze Navigation
inferredcites →https://doi.org/10.1109/tsmcb.2003.811769openalex-snapshot
A Neural Network Approach to Complete Coverage Path Planning
inferredcites →https://doi.org/10.1109/tsp.2015.2394507openalex-snapshot
Multiperiod Scheduling for Wireless Sensor Networks: A Distributed Consensus Approach
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-04239-4_12openalex-snapshot
Min-Max Consensus Algorithm for Multi-agent Systems Subject to Privacy-Preserving Problem
inferred← citeshttps://doi.org/10.1007/978-981-15-3231-3_3openalex-snapshot
High-Order Discrete-Time Consensus
inferred← citeshttps://doi.org/10.1007/978-981-96-2200-9_32openalex-snapshot
A Distributed Bi-objective Shortest Path Algorithm with Pruning Techniques
inferred← citeshttps://doi.org/10.1007/s11063-021-10536-4openalex-snapshot
Research on Robot Motion Planning Based on RRT Algorithm with Nonholonomic Constraints
inferred← citeshttps://doi.org/10.1016/j.asoc.2019.105880openalex-snapshot
A recurrent neural network applied to optimal motion control of mobile robots with physical constraints
inferred← citeshttps://doi.org/10.1016/j.automatica.2025.112111openalex-snapshot
Razumikhin-type ISS Lyapunov function and small gain theorem for discrete time time-delay systems with application to a biased min-consensus protocol
inferred← citeshttps://doi.org/10.1049/cth2.70180openalex-snapshot
An Overview of the Distributed Biased Min‐Consensus Protocol: Recent Trends and Methodologies
inferred← citeshttps://doi.org/10.1088/1755-1315/424/1/012004openalex-snapshot
A distributed EV charging strategy in an integrated energy system
inferred← citeshttps://doi.org/10.1109/access.2021.3058121openalex-snapshot
Addressing Real-Time Demands for Robotic Path Planning Systems: A Routing Protocol Approach
inferred← citeshttps://doi.org/10.1109/access.2025.3539374openalex-snapshot
Neural Dynamics for Computing and Automation: A Survey
inferred← citeshttps://doi.org/10.1109/icus50048.2020.9274969openalex-snapshot
Near-Optimal Consensus of Multi-Dimensional Double-Integrator Multi-Agent Systems
inferred← citeshttps://doi.org/10.1109/lcsys.2026.3697256openalex-snapshot
Finite-Time Optimal Policy Identification for the Stochastic Shortest Path Problem
inferred← citeshttps://doi.org/10.1109/tac.2025.3581845openalex-snapshot
The Distributed Biased Min-Consensus Protocol Revisited: Prespecified Finite Time Control Strategies and Small-Gain-Based Analysis
inferred← citeshttps://doi.org/10.1109/tcns.2023.3314549openalex-snapshot
A Small-Gain Analysis for an All-Pairs Shortest-Path Algorithm: Global Exponential Input-to-State Stability
inferred← citeshttps://doi.org/10.1109/tcyb.2022.3169660openalex-snapshot
Finite-Level Quantized Min-Consensus Control Based on Encoding-Decoding
inferred← citeshttps://doi.org/10.1109/tpwrs.2022.3142256openalex-snapshot
Collaborative EV Routing and Charging Scheduling With Power Distribution and Traffic Networks Interaction
inferred← citeshttps://doi.org/10.1109/tsg.2020.2965568openalex-snapshot
A Distributed EV Navigation Strategy Considering the Interaction Between Power System and Traffic Network
inferred← citeshttps://doi.org/10.1109/tsmc.2018.2882558openalex-snapshot
Consensus of High-Order Discrete-Time Multiagent Systems With Switching Topology
inferred← citeshttps://doi.org/10.1109/tste.2018.2889643openalex-snapshot
A Biased Min-Consensus-Based Approach for Optimal Power Transaction in Multi-Energy-Router Systems
inferred← citeshttps://doi.org/10.3390/sym17060936openalex-snapshot
Survey of Neurodynamic Methods for Control and Computation in 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.