首页> 外文学位 >Robust Distributed Control of Networked Systems with Linear Programming Objectives.
【24h】

Robust Distributed Control of Networked Systems with Linear Programming Objectives.

机译:具有线性编程目标的网络系统的鲁棒分布式控制。

获取原文
获取原文并翻译 | 示例

摘要

The pervasiveness of networked systems in modern engineering problems has stimulated the recent research activity in distributed control. Under this paradigm, individual agents, having access to partial information and subject to real-world disturbances, locally interact to achieve a common goal. Here, we consider network objectives formulated as a linear program where the individual agents' states correspond to components of the decision vector in the optimization problem. To this end, the first contribution we make is the development of a robust distributed continuous-time dynamics to solve linear programs. We systematically argue that the robustness properties we establish for this dynamics are as strong as can be expected for linear programming algorithms. The next contribution we make is the design of a distributed event-triggered communication protocol for the aforementioned algorithm. We establish various state-based rules for agents to determine when they should broadcast their state, allowing us to relax the need for continual information flow between agents.;Turning our attention to a specific network control problem for which our algorithm can be applied, we consider distributed bargaining in exchange networks. In this scenario, agents autonomously form coalitions of size two (called a match) and agree on how to split a payoff between them. We emphasize fair and stable bargaining outcomes, whereby matched agents benefit equally from the collaboration and cannot improve their allocation by unilaterally deviating from the outcome. We synthesize distributed algorithms that converge to such outcomes. Finally, we focus on cooperation-inducing mechanisms to ensure that agents in a bargaining outcome effectively realize the payoff they were promised. As an illustrative example, we study how to allocate the leader role in unmanned aerial vehicle (UAV) formation pairs. We show how agents can strategically decide when to switch from leading to following in the formation to ensure that the other UAV cooperates.;Throughout the thesis, we emphasize the development of provably correct algorithms, making use of tools from the controls systems community such as Lyapunov analysis and the Invariance Principle. Simulations in distributed optimal control, multi-agent task assignment, channel access control in wireless communication networks, and UAV formations illustrate our results.
机译:网络系统在现代工程问题中的普遍性刺激了分布式控制领域的最新研究活动。在这种范式下,有权访问部分信息并受到现实世界干扰的各个代理人在本地进行交互以实现共同的目标。在这里,我们考虑将网络目标公式化为线性程序,其中各个主体的状态对应于优化问题中决策向量的组成部分。为此,我们做出的第一个贡献是开发了强大的分布式连续时间动力学来解决线性程序。我们系统地论证,为此动力学建立的鲁棒性与线性编程算法所期望的一样强。我们做出的下一个贡献是针对上述算法设计分布式事件触发的通信协议。我们为代理建立了各种基于状态的规则,以确定代理何时应广播其状态,从而使我们可以放宽代理之间持续不断的信息流的需求。;将注意力转移到可以应用我们的算法的特定网络控制问题上,考虑在交换网络中进行分布式讨价还价。在这种情况下,业务代表自动组成规模为2的联盟(称为“比赛”),并商定如何在他们之间分配收益。我们强调公平和稳定的讨价还价结果,即匹配的特工从合作中平等受益,并且不能通过单方面偏离结果来改善分配。我们综合了收敛到这种结果的分布式算法。最后,我们关注于诱导合作的机制,以确保在讨价还价结果中的代理有效地实现了他们所承诺的回报。作为说明性示例,我们研究如何在无人飞行器(UAV)编队对中分配领导角色。我们展示了代理商如何从战略上决定何时从领先者转移到后续者,以确保其他无人机协作。在整个论文中,我们着重强调了可证明正确算法的开发,利用了来自控制系统社区的工具,例如李雅普诺夫分析和不变性原理。分布式最优控制,多主体任务分配,无线通信网络中的信道访问控制以及UAV编队中的仿真说明了我们的结果。

著录项

  • 作者

    Richert, Dean.;

  • 作者单位

    University of California, San Diego.;

  • 授予单位 University of California, San Diego.;
  • 学科 Engineering Mechanical.;Engineering System Science.
  • 学位 Ph.D.
  • 年度 2014
  • 页码 178 p.
  • 总页数 178
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号