首页> 外文会议>Annual allerton conference on communication control, and computing;Allerton conference on communication control, and computing;Allerton 2009 >Dynamic Self-organization and Clustering in Distributed Networked Systems for Performance Improvement
【24h】

Dynamic Self-organization and Clustering in Distributed Networked Systems for Performance Improvement

机译:分布式网络系统中的动态自组织和聚类以提高性能

获取原文
获取外文期刊封面目录资料

摘要

We consider two closely related dynamic self-organization problems in networked control systems. Both are forms of dynamic clustering of nodes. The structure of networked control systems is often abstracted using graph theory. In this abstraction, the nodes of the graph represent the agents and the edges between them represent the relation(s) or the possibility of communication between the corresponding agents. The topology of the communication network supporting a networked control system has critical consequences for its performance. The first problem we address is the development of a distributed self-organization algorithm, resulting into a dynamic two level hierarchy of leader and regular agents, which substantially improves the convergence speed of distributed algorithms utilized by the networked control system. For the second problem, we consider the collaborative control of a group of autonomous mobile agents (e.g. vehicles, robots) supported by a mobile wireless network, consisting of many ground and a few aerial nodes. The agents collaborate to achieve a common goal or objective, like to move in a particular area and cover it, while avoiding obstacles and collisions. Building upon our earlier work on deterministic, randomized and hybrid distributed coordination algorithms we consider the communication needs of the agents, and in particular the connectivity of their communication network as they move. We develop distributed algorithms that automatically select some agents and move them appropriately so as to maintain certain degree of desired connectivity among the moving agents. We characterize the trade-off between the gain from maintaining a certain degree of connectivity vs. the combined cost of communications and the associated dynamic re-positioning of agents. We also describe classes of efficient communication topologies and in particular their similarity to dynamic small world topologies and extensions.
机译:我们考虑网络控制系统中两个紧密相关的动态自组织问题。两者都是节点动态集群的形式。网络控制系统的结构通常使用图论来抽象。在这种抽象中,图的节点表示代理,而它们之间的边则表示相应代理之间的一种或多种关系或通信的可能性。支持网络控制系统的通信网络的拓扑结构对其性能至关重要。我们要解决的第一个问题是开发一种分布式自组织算法,从而导致动态的领导者和常规代理两级层次结构,从而大大提高了网络控制系统所使用的分布式算法的收敛速度。对于第二个问题,我们考虑由一组移动无线网络支持的一组自治移动代理(例如车辆,机器人)的协作控制,该移动无线网络由许多地面节点和一些空中节点组成。代理商协同工作以达成共同的目标或目的,例如在特定区域内移动并覆盖该区域,同时避免障碍和碰撞。在我们关于确定性,随机和混合分布式协调算法的早期工作的基础上,我们考虑了代理的通信需求,尤其是它们移动时通信网络的连通性。我们开发了分布式算法,该算法可自动选择一些代理并适当地移动它们,以在移动的代理之间保持一定程度的所需连接性。我们描述了在保持一定程度的连通性所获得的收益与通信总成本以及相关联的业务代表动态重新定位之间的权衡。我们还将描述有效的通信拓扑的类别,尤其是它们与动态小世界拓扑和扩展的相似性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号