弦拓扑网络的灵敏度函数折衷
Sensitivity Function Trade-offs for Networks with a String Topology
摘要:
我们提出了两个灵敏度函数的权衡,适用于一类网络与字符串拓扑结构。特别是,我们表明,一个下界的H-无穷范数和波德灵敏度关系保持整个家庭的灵敏度函数与增长的网络。我们确定的权衡是网络增长的直接结果,可以用来解释为什么即使使用动态反馈,长车队中也会出现监管不力的低频行为。
英文摘要:
We present two sensitivity function trade-offs that apply to a class of networks with a string topology. In particular we show that a lower bound on the H-infinity norm and a Bode sensitivity relation hold for an entire family of sensitivity functions associated with growing the network. The trade-offs we identify are a direct consequence of growing the network, and can be used to explain why poorly regulated low frequency behaviours emerge in long vehicle platoons even when using dynamic feedback.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。