【24h】

Positive Consensus Problem: The Case of Complete Communication

机译:积极的共识问题:完全沟通的情况

获取原文

摘要

In this chapter the positive consensus problem for homogeneous multiagent systems is investigated, by assuming that agents are described by positive single-input and continuous-time systems, and that each agent communicates with all the other agents. Under certain conditions on the Laplacian of the communication graph, that arise only when the graph is complete, some of the main necessary conditions for the problem solvability derived in [17-19] do not hold, and this makes the problem solution more complex. In this chapter we investigate this specific problem, by providing either necessary or sufficient conditions for its solvability and by analysing some special cases.
机译:在本章中,通过假设代理由正单输入和连续时间系统描述了代理,并且每个代理商与所有其他代理商通信,研究了均匀多态系统的正共识问题。在通信图的Laplacian的某些条件下,仅在图表完成时出现的情况下,解决[17-19]的问题可解性的一些主要必要条件不持有,这使得问题解决方案更复杂。在本章中,我们通过为其可解性提供必要或充足的条件来调查该具体问题,并通过分析一些特殊情况。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号