发表刊物：Systems & Control Letters
摘要：The shortest path problem, one of the most classical graph problems, has been addressed in many different ways suitable for various settings in the fields of computer science and artificial intelligence. In this paper, we revisit a distributed control solution, namely the continuous-time adaptive Bellman–Ford algorithm, to the shortest path problem. While previous work only concerned its global asymptotic stability, we not only prove its global asymptotic stability by formulating a Lyapunov function, but characterize the initial conditions under which the algorithm will converge exponentially, and show that the algorithm is globally ultimately bounded under persistent bounded perturbations based on the proposed Lyapunov function.
第一作者：莫远秋
论文类型：期刊论文
通讯作者：余兰林
是否译文：否
发表时间：2021-10-13
收录刊物：SCI