To Örebro University

oru.seÖrebro University Publications
System disruptions
We are currently experiencing disruptions on the search portals due to high traffic. We are working to resolve the issue, you may temporarily encounter an error message.
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Online Sequential Task Assignment With Execution Uncertainties for Multiple Robot Manipulators
Örebro University, School of Science and Technology. (AASS)ORCID iD: 0000-0003-2474-7451
Örebro University, School of Science and Technology. (AASS)ORCID iD: 0000-0002-9652-7864
2021 (English)In: IEEE Robotics and Automation Letters, E-ISSN 2377-3766, Vol. 6, no 4, p. 6993-7000Article in journal (Refereed) Published
Abstract [en]

In order to let multiple robot manipulators cooperatively complete a sequence of tasks in a shared workspace under task execution uncertainty, this letter proposes a multi-robot task allocation framework for constantly assigning tasks to robots, while the interference among concurrent robot motions is account for. An online sequential task assignment method is presented, which decouples the time-extended problem into a sequence of synchronous and asynchronous instantaneous assignment sub-problems. This renders the approach capable of reacting to task execution uncertainties in real-time. A one-step-ahead simulation method is employed to reduce the idle time of robots and improve task completion efficiency. Each instantaneous assignment sub-problem is modeled as an optimal assignment problem with variable utility and solved by a branch-and-bound algorithm, with which multi-robot motion coordination is integrated. Experimental results conducted with three Franka-Emika Panda arms show that these can cooperatively complete all tasks without collision and little waiting time. Simulations with larger multi-robot systems show that the approach scales linearly with the number of robots.

Place, publisher, year, edition, pages
IEEE Press , 2021. Vol. 6, no 4, p. 6993-7000
Keywords [en]
Multi-robot systems, planning, scheduling and coordination, task and motion planning, collision avoidance
National Category
Robotics and automation
Identifiers
URN: urn:nbn:se:oru:diva-93290DOI: 10.1109/LRA.2021.3093874ISI: 000678343900041Scopus ID: 2-s2.0-85111724297OAI: oai:DiVA.org:oru-93290DiVA, id: diva2:1582043
Funder
Vinnova, 2018-04622Available from: 2021-07-28 Created: 2021-07-28 Last updated: 2025-02-09Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Zhang, ShiyuPecora, Federico

Search in DiVA

By author/editor
Zhang, ShiyuPecora, Federico
By organisation
School of Science and Technology
In the same journal
IEEE Robotics and Automation Letters
Robotics and automation

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 143 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf