### 抜粋

In this paper, we deal with a consensus control problem for a group of high dimensional agents which are networked by digraphs. Assuming that the control input of each agent is constructed based on the weighted difference between its states and those of its neighbor agents, we aim to propose an algorithm on computing the weighting coefficients in the control input. The problem is reduced to designing Hurwitz polynomials with complex coefficients. Focusing on the case of three dimensional systems, we show that by using Hurwitz polynomials with complex coefficients, we obtain a necessary and sufficient condition for the consensus algorithm. The condition is a natural extension to second order consensus, and is reasonable and practical due to its comparatively less computation burden. Two numerical examples show effectiveness of the proposed condition and the consensus algorithm.

元の言語 | English |
---|---|

ホスト出版物のタイトル | Proceedings of the 36th Chinese Control Conference, CCC 2017 |

出版者 | IEEE Computer Society |

ページ | 8293-8298 |

ページ数 | 6 |

ISBN（電子版） | 9789881563934 |

DOI | |

出版物ステータス | Published - 2017 9 7 |

イベント | 36th Chinese Control Conference, CCC 2017 - Dalian, China 継続期間: 2017 7 26 → 2017 7 28 |

### Other

Other | 36th Chinese Control Conference, CCC 2017 |
---|---|

国 | China |

市 | Dalian |

期間 | 17/7/26 → 17/7/28 |

### ASJC Scopus subject areas

- Computer Science Applications
- Control and Systems Engineering
- Applied Mathematics
- Modelling and Simulation

## フィンガープリント An algebraic approach to designing consensus algorithm of networked high dimensional agents' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*Proceedings of the 36th Chinese Control Conference, CCC 2017*(pp. 8293-8298). [8028670] IEEE Computer Society. https://doi.org/10.23919/ChiCC.2017.8028670