arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.08027math.OCcs.SYeess.SYmath.DS
收藏

字符串稳定性的充分条件

Sufficient Conditions for String Stability

Iasson Karafyllis, Dionysis Theodosis, Markos Papageorgiou

AI总结:

为庆祝Jiang Zhong-Ping 60岁生日,本文针对互联系统中的字符串类系统,开发基于轨迹和Lyapunov的工具验证齐次双向字符串稳定性,并将结果应用于车辆队列巡航控制器设计。

摘要:

Jiang Zhong-Ping将其大部分工作投入到互联系统稳定性特性的研究中。在这篇短文中,我们通过研究一类特殊的互联系统家族——即所谓的字符串,来庆祝Jiang Zhong-Ping的60岁生日。我们开发了基于轨迹和基于Lyapunov的工具,这些工具可用于验证齐次双向字符串的字符串稳定性。所得结果被应用于车辆队列的巡航控制器设计问题。

英文摘要:

Zhong-Ping Jiang devoted a large part of his work to the study of the stability properties of interconnected systems. In this short paper we celebrate Zhong-Ping Jiang's 60th birthday by studying a special class of families of interconnected systems: the so-called strings. We develop trajectory-based and Lyapunov-based tools that allow the verification of string stability to homogeneous bidirectional strings. The obtained results are applied to the problem of cruise controller design for a string of vehicles.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑