메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
Hong-Kyong Kim (Gwangju Institute of Science and Technology) Younghun John (Gwangju Institute of Science and Technology) Hyo-Sung Ahn (Gwangju Institute of Science and Technology)
저널정보
제어로봇시스템학회 제어로봇시스템학회 국제학술대회 논문집 ICCAS 2018
발행연도
2018.10
수록면
1,164 - 1,169 (6page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
The multi-agent system is a hot topic in control systems theory. Consensus algorithm and gossip algorithm are two main examples of multi-agent systems control. Consensus algorithm converges from different initial values of agents to a certain value in a given graph. Gossip algorithm is similar to consensus but the graph is randomly selected each time. In this paper, we propose a new concept of a cluster graph where it is composed of three parts: one set of agents with fixed connections, another set of agents with randomly selected connections, and lastly fixed edges connecting the two former mentioned sets. The Laplacian matrix and randomly averaging matrix are key points of the system equation. There are three cases of connections between two groups. We use lemmas to solve asymptotic stable convergence of the system. This simulation shows the asymptotic stable of 3 bipartite graph connections in a few seconds.

목차

Abstract
1. INTRODUCTION
2. PRELIMINARIES AND PROBLEM FORMULATION
3. STABILITY ANALYSIS
4. CONVERGENCE VALUE
5. SIMULATION
6. CONCLUSION
7. ACKNOWLEDGMENT
REFERENCES

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2018-003-003539695