首页> 外文会议>IEEE Annual Conference on Decision and Control >A k-hop graph-based observer for large-scale networked systems
【24h】

A k-hop graph-based observer for large-scale networked systems

机译:基于K跳图形的大型网络系统观察者

获取原文

摘要

In this paper, we address the state estimation problem for multi-agent systems interacting in large scale networks. This research is motivated by the observation that in large-scale networks for many practical applications and domains, each agent only requires information concerning agents spatially close to its location, let's say topologically k-hop away. We propose a scalable framework where each agent is able to estimate in finite-time the state of its k-hop neighborhood by interacting only with the agents belonging to its 1-hop neighborhood.
机译:在本文中,我们解决了大规模网络中交互的多代理系统的状态估计问题。这项研究是通过观察到许多实际应用和域的大规模网络,每个代理只需要关于空间上靠近其位置的代理商的信息,让我们在拓扑上k-hop离开。我们提出了一种可扩展的框架,其中每个代理能够通过仅与属于其1跳社区的代理商进行交互来估计其K-Hop社区的状态。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号