Papers
Topics
Authors
Recent
2000 character limit reached

The distributed biased min-consensus protocol revisited: pre-specified finite time control strategies and small-gain based analysis (2405.08599v1)

Published 14 May 2024 in eess.SY, cs.SY, and math.OC

Abstract: 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. As such a protocol is commonly incorporated as the first step of a hierarchical architecture in real applications, e.g., robots path planning, management of dispersed computing services, an impedance limiting the application potential of DBMC lies in, the lack of results regarding to its convergence within a user-assigned time. In this paper, we first propose two control strategies ensuring the state error of DBMC decrease exactly to zero or a desired level manipulated by the user, respectively. To compensate the high feedback gains incurred by these two control strategies, this paper further investigates the nominal DBMC itself. By leveraging small gain based stability tools, this paper also proves the global exponential input-to-state stability of DBMC, outperforming its current stability results. Simulations have been provided to validate the efficacy of our theoretical result.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (29)
  1. D. Yao, H. Li, and Y. Shi, “Event-based average consensus of disturbed mass via fully distributed sliding mode control,” IEEE Transactions on Automatic Control, 2023.
  2. V. Yadav and M. Salapaka, “Distributed protocol for determining when averaging consensus is readied,” in 45th Annual Allerton Conference on Communication, Control, and Computing, 2007, pp. 715–720.
  3. J. Cortés, “Distributed algorithms for reaching consensus on general functions,” Automatica, vol. 44, no. 3, pp. 726–737, 2008.
  4. Y. Zhang and S. Li, “Distributed biased min-consensus with applications to shortest path planning,” IEEE Transactions on Automatic Control, vol. 62, no. 10, pp. 5429–5436, Oct 2017.
  5. R. Bellman, “On a routing problem,” Quarterly of applied mathematics, vol. 16, no. 1, pp. 87–90, 1958.
  6. E. W. Dijkstra, “A note on two problems in connexion with graphs,” in Edsger Wybe Dijkstra: His Life, Work, and Legacy, 2022, pp. 287–290.
  7. X. Shi, Y. Xu, and H. Sun, “A biased min-consensus-based approach for optimal power transaction in multi-energy-router systems,” IEEE Transactions on Sustainable Energy, vol. 11, no. 1, pp. 217–228, 2018.
  8. Y. Zhang and S. Li, “Perturbing consensus for complexity: A finite-time discrete biased min-consensus under time-delay and asynchronism,” Automatica, vol. 85, pp. 441–447, 2017.
  9. P. Yao, R. Zhao, and Q. Zhu, “A hierarchical architecture using biased min-consensus for usv path planning,” IEEE Transactions on Vehicular Technology, vol. 69, no. 9, pp. 9518–9527, 2020.
  10. X. Shi, Y. Xu, Q. Guo, H. Sun, and W. Gu, “A distributed ev navigation strategy considering the interaction between power system and traffic network,” IEEE Transactions on Smart Grid, vol. 11, no. 4, pp. 3545–3557, 2020.
  11. Y. Mo, S. Dasgupta, and J. Beal, “Robustness of the Adaptive Bellman-Ford Algorithm: Global stability and ultimate bounds,” IEEE Transactions on Automatic Control, pp. 4121–4136, 2019.
  12. Y. Mo, S. Dasgupta, and J. Beal, “Stability and resilience of distributed information spreading in aggregate computing,” IEEE Transactions on Automatic Control, vol. 68, no. 1, pp. 454–461, 2022.
  13. Y. Mo and L. Yu, “A Lyapunov analysis of the continuous-time adaptive bellman–ford algorithm,” Systems & Control Letters, vol. 157, p. 105045, 2021.
  14. A. Paulos, S. Dasgupta, J. Beal, Y. Mo, K. Hoang, L. J. Bryan, P. Pal, R. Schantz, J. Schewe, R. Sitaraman et al., “A framework for self-adaptive dispersal of computing services,” in 2019 IEEE 4th International Workshops on Foundations and Applications of Self* Systems (FAS* W).   IEEE, 2019, pp. 98–103.
  15. Y. Song, H. Ye, and F. L. Lewis, “Prescribed-time control and its latest developments,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2023.
  16. B. Ning, Q.-L. Han, Z. Zuo, L. Ding, Q. Lu, and X. Ge, “Fixed-time and prescribed-time consensus control of multiagent systems and its applications: A survey of recent trends and methodologies,” IEEE Transactions on Industrial Informatics, vol. 19, no. 2, pp. 1121–1135, 2022.
  17. Y. Wang and Y. Song, “Leader-following control of high-order multi-agent systems under directed graphs: Pre-specified finite time approach,” Automatica, vol. 87, pp. 113–120, 2018.
  18. P. Krishnamurthy, F. Khorrami, and M. Krstic, “A dynamic high-gain design for prescribed-time regulation of nonlinear systems,” Automatica, vol. 115, p. 108860, 2020.
  19. Y. Wang, Y. Song, D. J. Hill, and M. Krstic, “Prescribed-time consensus and containment control of networked multiagent systems,” IEEE transactions on cybernetics, vol. 49, no. 4, pp. 1138–1147, 2018.
  20. Y. Cao, J. Cao, and Y. Song, “Practical prescribed time tracking control over infinite time interval involving mismatched uncertainties and non-vanishing disturbances,” Automatica, vol. 136, p. 110050, 2022.
  21. B. Ning, Q.-L. Han, and Z. Zuo, “Practical fixed-time consensus for integrator-type multi-agent systems: A time base generator approach,” Automatica, vol. 105, pp. 406–414, 2019.
  22. R. Geiselhart and F. R. Wirth, “Relaxed iss small-gain theorems for discrete-time systems,” SIAM Journal on Control and Optimization, vol. 54, no. 2, pp. 423–449, 2016.
  23. S. N. Dashkovskiy, B. S. Rüffer, and F. R. Wirth, “Small gain theorems for large scale systems and construction of iss lyapunov functions,” SIAM Journal on Control and Optimization, vol. 48, no. 6, pp. 4089–4118, 2010.
  24. B. S. Rüffer, “Monotone inequalities, dynamical systems, and paths in the positive orthant of euclidean n-space,” Positivity, vol. 14, pp. 257–283, 2010.
  25. H. K. Khalil, “Nonlinear systems,” Upper Saddle River, 2002.
  26. P. Morasso, V. Sanguineti, and G. Spada, “A computational theory of targeting movements based on force fields and topology representing networks,” Neurocomputing, vol. 15, no. 3-4, pp. 411–434, 1997.
  27. R. Geiselhart and F. Wirth, “Numerical construction of liss lyapunov functions under a small-gain condition,” Mathematics of Control, Signals, and Systems, vol. 24, pp. 3–32, 2012.
  28. Y. Zhang and S. Li, “Second-order min-consensus on switching topology,” Automatica, vol. 96, pp. 293–297, 2018.
  29. B. Singh, A. Sen, and S. R. Sahoo, “Min-consensus for heterogeneous higher-order integrators under switching digraph,” IEEE Control Systems Letters, vol. 4, no. 3, pp. 560–565, 2020.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now

Whiteboard

Paper to Video (Beta)

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Authors (2)

  1. Yuanqiu Mo
  2. He Wang

Collections

Sign up for free to add this paper to one or more collections.

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up