Perturbing consensus for complexity: a finite-time discrete biased min-consensus under time-delay and asynchronism

DOI10.1016/j.automatica.2017.08.014zbMath1375.93013OpenAlexW2755565810MaRDI QIDQ1679889

Shuai Li, Yinyan Zhang

Publication date: 22 November 2017

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2017.08.014

zbMATH Keywords

time-delayconsensuscomplete coverageshortest path planningasynchronismmaze solvingmin-consensus

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Discrete-time control/observation systems (93C55) Automated systems (robots, etc.) in control theory (93C85) Decentralized systems (93A14)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Consensus of discrete-time multi-agent systems with transmission nonlinearity
• Average consensus on general strongly connected digraphs
• Consensus protocols for discrete-time multi-agent systems with time-varying delays
• Leader-follower consensus over numerosity-constrained random networks
• Distributed algorithms for reaching consensus on general functions
• Heuristic shortest path algorithms for transportation applications: state of the art
• Global consensus for discrete-time multi-agent systems with input saturation constraints
• Multiperiod Scheduling for Wireless Sensor Networks: A Distributed Consensus Approach
• Finite-Time Consensus Problems for Networks of Dynamic Agents
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays