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

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
저널정보
제어로봇시스템학회 제어로봇시스템학회 국제학술대회 논문집 ICCAS 2018
발행연도
2018.10
수록면
856 - 861 (6page)

이용수

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

초록· 키워드

오류제보하기
This paper presents a secure market based task assignment algorithm for decentralized multi-agent system. In a decentralized algorithm, individual agents calculate their solution with imperfect information of environments. To achieve agreement in the system, the plan consensus solves local task assignment problems and reach a conflict-free solution through the plan exchange. The Consensus Based Bundle Algorithm(CBBA), which is well-known consensus based plan auction method, guarantees feasible and conflict-free solution. However, in the plan consensus protocol, each agent determines tasks only through bidding for each task like maximum bid consensus. It is vulnerable to malicious data to attack a consensus process or solution result. Therefore, providing security to the decentralized agent system is a major issue. The main contribution of this paper is an algorithm, termed partial-agreement consensus-based bundle algorithm, that proposed for two types of attacks, exaggerated score attack and changing score attack. Partial agreement of the agent with some of the mission plans resists attacks that are intended to degrade the overall plan. The security solution is a more robust task allocation algorithm with a partial agreement on the plans and task bidding data.

목차

Abstract
1. INTRODUCTION
2. PLAN CONSENSUS PROBLEM
3. ATTACK MODEL IN MULTI-AGENT PLAN CONSENSUS
4. PARTIAL AGREEMENT CONSENSUS BASED BUNDLE ALGORITHM
5. SIMULATION AND RESLUTS
REFERENCES

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

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

이 논문의 저자 정보

이 논문과 함께 이용한 논문

최근 본 자료

전체보기

댓글(0)

0

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