An Arrovian View on the Multi-Robot Task Allocation Problem

被引:0
作者
Neves dos Reis, Wallace Pereira [1 ]
Bastos, Guilherme Sousa [2 ]
机构
[1] Fed Inst Educ Sci & Technol Rio de Janeiro, IFRJ Campus Volta Redonda, Volta Redonda, RJ, Brazil
[2] Univ Fed Itajuba, Inst Syst Engn & Informat Technol, Itajuba, MG, Brazil
来源
2017 18TH INTERNATIONAL CONFERENCE ON ADVANCED ROBOTICS (ICAR) | 2017年
关键词
Multi-Robot Task Allocation; Social Choice Theory; Arrow's Impossibility Theorem; SOCIAL-WELFARE; ALLIANCE;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper aims to analyze the Multi-Robot Task Allocation (MRTA) problem from the perspective of Social Choice Theory. More specifically taking into account the conditions of Arrow's Impossibility Theorem in a robot collective preference aggregation. The scalar utility comparison between two robots becomes impractical with an inexact estimate. As argued by Arrow, the cardinal utility comparison can be replaced by an ordinal comparison. The work also examines two different MRTA problems from this Arrovian view, while establishing Multi-Robot Social Choice and Multi-Robot Social Welfare functions.
引用
收藏
页码:290 / 295
页数:6
相关论文
共 29 条
  • [1] [Anonymous], 2003, THESIS
  • [2] [Anonymous], 2004, P AAAI SPRING S BRID
  • [3] [Anonymous], 2016, Handbook of Computational Social Choice
  • [4] [Anonymous], 2004, Handb. Util. Theor., DOI [DOI 10.1007/978-1-4020-7964-14, DOI 10.1007/978-1-4020-7964-1_4]
  • [5] Arrow K. J., 1963, Social Choice and Individual Values, V2nd
  • [6] A DIFFICULTY IN THE CONCEPT OF SOCIAL WELFARE
    Arrow, Kenneth J.
    [J]. JOURNAL OF POLITICAL ECONOMY, 1950, 58 (04) : 328 - 346
  • [7] CAO YU, 1995, IROS '95 - 1995 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS: HUMAN ROBOT INTERACTION AND COOPERATIVE ROBOTS, PROCEEDINGS, VOL 1, P226, DOI 10.1109/IROS.1995.525801
  • [8] Independence of irrelevant alternatives revisited
    Cato, Susumu
    [J]. THEORY AND DECISION, 2014, 76 (04) : 511 - 527
  • [9] Chevaleyre Y, 2007, LECT NOTES COMPUT SC, V4362, P51
  • [10] Chevaleyre Y, 2006, INFORM-J COMPUT INFO, V30, P3