no code implementations • 14 May 2024 • Yuanqiu Mo, He Wang
Unlike the classical distributed consensus protocols enabling the group of agents as a whole to reach an agreement regarding a certain quantity of interest in a distributed fashion, the distributed biased min-consensus protocol (DBMC) has been proven to generate advanced complexity pertaining to solving the shortest path problem.
no code implementations • 5 Oct 2023 • Yuanqiu Mo, Wenwu Yu, Huazhou Hou, Soura Dasgupta
By converting such a perturbed protocol into a discrete time time-delay nonlinear system, we prove its exponential input-to-state stability under perturbations using our Razumikhin-type Lyapunov-based small gain theorem.