Explainable Multi-Agent Systems Through Blockchain Technology

被引:23
作者
Calvaresi, Davide [1 ]
Mualla, Yazan [2 ]
Najjar, Amro [3 ]
Galland, Stephane [2 ]
Schumacher, Michael [1 ]
机构
[1] Univ Appl Sci & Arts Western Switzerland, Sierre, Switzerland
[2] Univ Bourgogne Franche Comte, CIAD, UTBM, F-90010 Belfort, France
[3] UMEA Univ, Umea, Sweden
来源
EXPLAINABLE, TRANSPARENT AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, EXTRAAMAS 2019 | 2019年 / 11763卷
关键词
MAS; Goal-based XAI; Explainability; UAV; Blockchain;
D O I
10.1007/978-3-030-30391-4_3
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Advances in Artificial Intelligence (AI) are contributing to a broad set of domains. In particular, Multi-Agent Systems (MAS) are increasingly approaching critical areas such as medicine, autonomous vehicles, criminal justice, and financial markets. Such a trend is producing a growing AI-Human society entanglement. Thus, several concerns are raised around user acceptance of AI agents. Trust issues, mainly due to their lack of explainability, are the most relevant. In recent decades, the priority has been pursuing the optimal performance at the expenses of the interpretability. It led to remarkable achievements in fields such as computer vision, natural language processing, and decision-making systems. However, the crucial questions driven by the social reluctance to accept AI-based decisions may lead to entirely new dynamics and technologies fostering explainability, authenticity, and user-centricity. This paper proposes a joint approach employing both blockchain technology (BCT) and explainability in the decision-making process of MAS. By doing so, current opaque decision-making processes can be made more transparent and secure and thereby trustworthy from the human user standpoint. Moreover, several case studies involving Unmanned Aerial Vehicles (UAV) are discussed. Finally, the paper discusses roles, balance, and trade-offs between explainability and BCT in trust-dependent systems.
引用
收藏
页码:41 / 58
页数:18
相关论文
共 48 条
[1]  
ACM US, 2017, PUBL POL COUNC STAT
[2]  
Ali M., 2016, P US ATC 16 2016 US, P181
[3]  
Anjomshoae S., 2019, AAM 19 P 18 INT C
[4]  
[Anonymous], 2002, Aesop's Fables
[5]  
[Anonymous], 1991, OXFORD ENGLISH DICT, V2nd
[6]  
Armbrust Michael, 2009, University of California, Berkeley, DOI DOI 10.1145/1721654.1721672
[7]  
Bajo J., 2018, LECT NOTES ARTIF INT, V10978, P110, DOI DOI 10.1007/978-3-319-94580-4_9
[8]  
Biran O., 2017, IJCAI 17 WORKSHOP EX, P8
[9]  
Buttazzo G.C., 2017, 2017 IEEEW INT C, P356, DOI [10.1145/3106426.3106518, DOI 10.1145/3106426.3106518]
[10]  
Buttazzo GC, 2011, HARD REAL-TIME COMPUTING SYSTEMS: PREDICTABLE SCHEDULING ALGORITHMS AND APPLICATIONS, THIRD EDITION, P1, DOI 10.1007/978-1-14614-0676-1