Distributed filtering and control of complex networks and systems

来源 :信息与电子工程前沿(英文) | 被引量 : 0次 | 上传用户:cs8613416
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
In the last two decades, research on distributed filtering and control (FAC) has burgeoned into large-scale complex networks and systems. A dis-tributed networked system, typically composed of a number of cost-effective dynamical nodes (agents) with limited sensing, computing, and communication capabilities, is gaining considerable popularity due to its low power consumption, simple installation, high performance, and strong reliability, as compared with the centralized setting. As a result, various network- induced FAC systems, techniques, and algorithms have emerged, including node registration and control, network consensus and synchronization, multi-sensor data clustering/fusion, network topological design and analysis, and the like. In addition, it is important to have an insightful understanding of the way net-works and systems behave and evolve from the FAC perspectives. This is often critical with respect to many important problems, such as managing a limited number of sensors for the best field-of-view coverage, tackling the intrinsic interactions and unknown cor-relations among dynamical nodes, trade-offs between performance and constraints, or achieving automation in noisy environments, just to name a few.
其他文献
This paper presents the design of a new event-triggered Kalman consensus filter (ET-KCF) algorithm for use over a wireless sensor network (WSN). This algorithm
Special curves in the Minkowski space such as Minkowski Pythagorean hodograph curves play an important role in computer-aided geometric design, and their usages
Service composition is an effective method of combining existing atomic services into a value-added service based on cost and quality of service (QoS). To meet