科研成果详情

题名Multi-robot task allocation-complexity and approximation
作者
发表日期2021
会议名称20th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2021
会议录名称Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
ISSN1548-8403
卷号1
页码133-141
会议日期May 3-7, 2021
会议地点Virtual, Online
摘要

Multi-robot task allocation is one of the most fundamental classes of problems in robotics and is crucial for various real-world robotic applications such as search, rescue and area exploration. We consider the Single-Task robots and Multi-Robot tasks Instantaneous Assignment (ST-MR-IA) setting where each task requires at least a certain number of robots and each robot can work on at most one task and incurs an operational cost for each task. Our aim is to consider a natural computational problem of allocating robots to complete the maximum number of tasks subject to budget constraints. We consider budget constraints of three different kinds: (1) total budget, (2) task budget, and (3) robot budget. We provide a detailed complexity analysis including results on approximations as well as polynomial-time algorithms for the general setting and important restricted settings.

关键词Complexity Matching Robot-task allocation
URL查看来源
语种英语English
Scopus入藏号2-s2.0-85111205467
引用统计
文献类型会议论文
条目标识符https://repository.uic.edu.cn/handle/39GCC9TT/9234
专题个人在本单位外知识产出
作者单位
1.UNSW Sydney,Sydney,Australia
2.University of Nebraska-Lincoln,Lincoln,United States
3.Hasso Plattner Institute,University of Potsdam,Potsdam,Germany
4.Hong Kong Polytechnic University,Hong Kong
推荐引用方式
GB/T 7714
Aziz, Haris,Chan, Hau,Cseh, Ágneset al. Multi-robot task allocation-complexity and approximation[C], 2021: 133-141.
条目包含的文件
条目无相关文件。
个性服务
查看访问统计
谷歌学术
谷歌学术中相似的文章
[Aziz, Haris]的文章
[Chan, Hau]的文章
[Cseh, Ágnes]的文章
百度学术
百度学术中相似的文章
[Aziz, Haris]的文章
[Chan, Hau]的文章
[Cseh, Ágnes]的文章
必应学术
必应学术中相似的文章
[Aziz, Haris]的文章
[Chan, Hau]的文章
[Cseh, Ágnes]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。