Desperate Times Call for Desperate Measures: Towards Risk-Adaptive Task Allocation

Multi-robot task allocation (MRTA) problems involve optimizing the allocation of robots to tasks. MRTA problems are known to be challenging when tasks require multiple robots and the team is composed of heterogeneous robots. These challenges are further exacerbated when we need to account for uncert...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Rudolph, Max, Chernova, Sonia, Ravichandar, Harish
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Rudolph, Max
Chernova, Sonia
Ravichandar, Harish
description Multi-robot task allocation (MRTA) problems involve optimizing the allocation of robots to tasks. MRTA problems are known to be challenging when tasks require multiple robots and the team is composed of heterogeneous robots. These challenges are further exacerbated when we need to account for uncertainties encountered in the real-world. In this work, we address coalition formation in heterogeneous multi-robot teams with uncertain capabilities. We specifically focus on tasks that require coalitions to collectively satisfy certain minimum requirements. Existing approaches to uncertainty-aware task allocation either maximize expected pay-off (risk-neutral approaches) or improve worst-case or near-worst-case outcomes (risk-averse approaches). Within the context of our problem, we demonstrate the inherent limitations of unilaterally ignoring or avoiding risk and show that these approaches can in fact reduce the probability of satisfying task requirements. Inspired by models that explain foraging behaviors in animals, we develop a risk-adaptive approach to task allocation. Our approach adaptively switches between risk-averse and risk-seeking behavior in order to maximize the probability of satisfying task requirements. Comprehensive numerical experiments conclusively demonstrate that our risk-adaptive approach outperforms risk-neutral and risk-averse approaches. We also demonstrate the effectiveness of our approach using a simulated multi-robot emergency response scenario.
doi_str_mv 10.48550/arxiv.2108.00346
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2108_00346</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2108_00346</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-2c6a6dba7c22efd0a3561121dfc5edb58763541ad342c2650f9f4c179dc2df9a3</originalsourceid><addsrcrecordid>eNpFz8tqwzAUBFBtuihpP6Cr6gfs6G27O-M-ISEQvDc30hWIKLGR3LT9-7ZpIatZDDNwCLnjrFS11mwJ6TOcSsFZXTImlbkm20fMEyaYkfbhgJl2ECP1Y6KXYo2Q3xPmB9qPH5BcptuQ90XrYJrD6WcIeU_bGEcLcxiPN-TKQ8x4-58L0j8_9d1rsdq8vHXtqgBTmUJYA8btoLJCoHcMpDacC-681eh2uq6M1IqDk0pYYTTzjVeWV42zwvkG5ILc_92eUcOUwgHS1_CLG844-Q3IcEpe</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Desperate Times Call for Desperate Measures: Towards Risk-Adaptive Task Allocation</title><source>arXiv.org</source><creator>Rudolph, Max ; Chernova, Sonia ; Ravichandar, Harish</creator><creatorcontrib>Rudolph, Max ; Chernova, Sonia ; Ravichandar, Harish</creatorcontrib><description>Multi-robot task allocation (MRTA) problems involve optimizing the allocation of robots to tasks. MRTA problems are known to be challenging when tasks require multiple robots and the team is composed of heterogeneous robots. These challenges are further exacerbated when we need to account for uncertainties encountered in the real-world. In this work, we address coalition formation in heterogeneous multi-robot teams with uncertain capabilities. We specifically focus on tasks that require coalitions to collectively satisfy certain minimum requirements. Existing approaches to uncertainty-aware task allocation either maximize expected pay-off (risk-neutral approaches) or improve worst-case or near-worst-case outcomes (risk-averse approaches). Within the context of our problem, we demonstrate the inherent limitations of unilaterally ignoring or avoiding risk and show that these approaches can in fact reduce the probability of satisfying task requirements. Inspired by models that explain foraging behaviors in animals, we develop a risk-adaptive approach to task allocation. Our approach adaptively switches between risk-averse and risk-seeking behavior in order to maximize the probability of satisfying task requirements. Comprehensive numerical experiments conclusively demonstrate that our risk-adaptive approach outperforms risk-neutral and risk-averse approaches. We also demonstrate the effectiveness of our approach using a simulated multi-robot emergency response scenario.</description><identifier>DOI: 10.48550/arxiv.2108.00346</identifier><language>eng</language><subject>Computer Science - Multiagent Systems ; Computer Science - Robotics</subject><creationdate>2021-07</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2108.00346$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2108.00346$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Rudolph, Max</creatorcontrib><creatorcontrib>Chernova, Sonia</creatorcontrib><creatorcontrib>Ravichandar, Harish</creatorcontrib><title>Desperate Times Call for Desperate Measures: Towards Risk-Adaptive Task Allocation</title><description>Multi-robot task allocation (MRTA) problems involve optimizing the allocation of robots to tasks. MRTA problems are known to be challenging when tasks require multiple robots and the team is composed of heterogeneous robots. These challenges are further exacerbated when we need to account for uncertainties encountered in the real-world. In this work, we address coalition formation in heterogeneous multi-robot teams with uncertain capabilities. We specifically focus on tasks that require coalitions to collectively satisfy certain minimum requirements. Existing approaches to uncertainty-aware task allocation either maximize expected pay-off (risk-neutral approaches) or improve worst-case or near-worst-case outcomes (risk-averse approaches). Within the context of our problem, we demonstrate the inherent limitations of unilaterally ignoring or avoiding risk and show that these approaches can in fact reduce the probability of satisfying task requirements. Inspired by models that explain foraging behaviors in animals, we develop a risk-adaptive approach to task allocation. Our approach adaptively switches between risk-averse and risk-seeking behavior in order to maximize the probability of satisfying task requirements. Comprehensive numerical experiments conclusively demonstrate that our risk-adaptive approach outperforms risk-neutral and risk-averse approaches. We also demonstrate the effectiveness of our approach using a simulated multi-robot emergency response scenario.</description><subject>Computer Science - Multiagent Systems</subject><subject>Computer Science - Robotics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpFz8tqwzAUBFBtuihpP6Cr6gfs6G27O-M-ISEQvDc30hWIKLGR3LT9-7ZpIatZDDNwCLnjrFS11mwJ6TOcSsFZXTImlbkm20fMEyaYkfbhgJl2ECP1Y6KXYo2Q3xPmB9qPH5BcptuQ90XrYJrD6WcIeU_bGEcLcxiPN-TKQ8x4-58L0j8_9d1rsdq8vHXtqgBTmUJYA8btoLJCoHcMpDacC-681eh2uq6M1IqDk0pYYTTzjVeWV42zwvkG5ILc_92eUcOUwgHS1_CLG844-Q3IcEpe</recordid><startdate>20210731</startdate><enddate>20210731</enddate><creator>Rudolph, Max</creator><creator>Chernova, Sonia</creator><creator>Ravichandar, Harish</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20210731</creationdate><title>Desperate Times Call for Desperate Measures: Towards Risk-Adaptive Task Allocation</title><author>Rudolph, Max ; Chernova, Sonia ; Ravichandar, Harish</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-2c6a6dba7c22efd0a3561121dfc5edb58763541ad342c2650f9f4c179dc2df9a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Computer Science - Multiagent Systems</topic><topic>Computer Science - Robotics</topic><toplevel>online_resources</toplevel><creatorcontrib>Rudolph, Max</creatorcontrib><creatorcontrib>Chernova, Sonia</creatorcontrib><creatorcontrib>Ravichandar, Harish</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Rudolph, Max</au><au>Chernova, Sonia</au><au>Ravichandar, Harish</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Desperate Times Call for Desperate Measures: Towards Risk-Adaptive Task Allocation</atitle><date>2021-07-31</date><risdate>2021</risdate><abstract>Multi-robot task allocation (MRTA) problems involve optimizing the allocation of robots to tasks. MRTA problems are known to be challenging when tasks require multiple robots and the team is composed of heterogeneous robots. These challenges are further exacerbated when we need to account for uncertainties encountered in the real-world. In this work, we address coalition formation in heterogeneous multi-robot teams with uncertain capabilities. We specifically focus on tasks that require coalitions to collectively satisfy certain minimum requirements. Existing approaches to uncertainty-aware task allocation either maximize expected pay-off (risk-neutral approaches) or improve worst-case or near-worst-case outcomes (risk-averse approaches). Within the context of our problem, we demonstrate the inherent limitations of unilaterally ignoring or avoiding risk and show that these approaches can in fact reduce the probability of satisfying task requirements. Inspired by models that explain foraging behaviors in animals, we develop a risk-adaptive approach to task allocation. Our approach adaptively switches between risk-averse and risk-seeking behavior in order to maximize the probability of satisfying task requirements. Comprehensive numerical experiments conclusively demonstrate that our risk-adaptive approach outperforms risk-neutral and risk-averse approaches. We also demonstrate the effectiveness of our approach using a simulated multi-robot emergency response scenario.</abstract><doi>10.48550/arxiv.2108.00346</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2108.00346
ispartof
issn
language eng
recordid cdi_arxiv_primary_2108_00346
source arXiv.org
subjects Computer Science - Multiagent Systems
Computer Science - Robotics
title Desperate Times Call for Desperate Measures: Towards Risk-Adaptive Task Allocation
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-19T00%3A38%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Desperate%20Times%20Call%20for%20Desperate%20Measures:%20Towards%20Risk-Adaptive%20Task%20Allocation&rft.au=Rudolph,%20Max&rft.date=2021-07-31&rft_id=info:doi/10.48550/arxiv.2108.00346&rft_dat=%3Carxiv_GOX%3E2108_00346%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true