论文标题

部分可观测时空混沌系统的无模型预测

Resilient Constrained Consensus over Complete Graphs via Feasibility Redundancy

论文作者

Zhu, Jingxuan, Lin, Yixuan, Velasquez, Alvaro, Liu, Ji

论文摘要

本文认为有弹性的高维约束共识问题,并研究了用于完整图的弹性分布式算法。对于带有单胎相交的凸的限制集,可行性冗余的足够条件和设定的规律性,可在存在拜占庭式药物的情况下达到所需的共识,这可以直接应用于多面形集合。还提供了可解决的可行性冗余的必要条件。

This paper considers a resilient high-dimensional constrained consensus problem and studies a resilient distributed algorithm for complete graphs. For convex constrained sets with a singleton intersection, a sufficient condition on feasibility redundancy and set regularity for reaching a desired consensus exponentially fast in the presence of Byzantine agents is derived, which can be directly applied to polyhedral sets. A necessary condition on feasibility redundancy for the resilient constrained consensus problem to be solvable is also provided.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源