The consensus problem of a linear discrete-time multi- agent system with directed communication topologies was investigated. A protocol was designed to solve consensus with an improved convergence speed achieved by de...The consensus problem of a linear discrete-time multi- agent system with directed communication topologies was investigated. A protocol was designed to solve consensus with an improved convergence speed achieved by designing protocol gains. The clo6ed-loop multi.agent system converged to an expected type of consensus function, which was divided into four types： zero, non- zero constant vector, bounded trajectories, and ramp trajectories. An algorithm was further provided to construct the protocol gains, which were determined in terms of a classical pole placement algorithm and a modified algebraic Riccati equation. Finally, an example to illustrate the effectiveness of theoretical results was presented.展开更多
基金Natural Science Foundation of Shandong Province,China(No.ZR2010FZ001)
文摘The consensus problem of a linear discrete-time multi- agent system with directed communication topologies was investigated. A protocol was designed to solve consensus with an improved convergence speed achieved by designing protocol gains. The clo6ed-loop multi.agent system converged to an expected type of consensus function, which was divided into four types： zero, non- zero constant vector, bounded trajectories, and ramp trajectories. An algorithm was further provided to construct the protocol gains, which were determined in terms of a classical pole placement algorithm and a modified algebraic Riccati equation. Finally, an example to illustrate the effectiveness of theoretical results was presented.
