Multi-robot scheduling and path-planning for non-overlapping operator attention

Sebastián Zanlongo, Franklin Abodo, Philip Long, Taskin Padir, Leonardo Bobadilla

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)

Abstract

There is a growing need for robots to perform complex tasks autonomously. However, there remain certain tasks that cannot - or should not - be completely automated. While these tasks may require one or several operators, we can oftentimes schedule when an operator should assist. We build on our previous work to present a methodology for allocating operator attention across multiple robots while attempting to minimize the execution time of the robots involved. In this paper, we: 1) Analyze of the complexity of this problem, 2) Provide a scalable methodology for designing robot policies so that few operators can oversee many robots, 3) Describe a methodology for designing both policies and robot trajectories to permit operators to assist many robots, and 4) Present simulation and hardware experiments demonstrating our methodologies.

Original languageEnglish
Title of host publicationProceedings - 2nd IEEE International Conference on Robotic Computing, IRC 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages87-94
Number of pages8
ISBN (Electronic)9781538646519
DOIs
Publication statusPublished - 2 Apr 2018
Externally publishedYes
Event2nd IEEE International Conference on Robotic Computing, IRC 2018 - Laguna Hills, United States
Duration: 31 Jan 20182 Feb 2018

Publication series

NameProceedings - 2nd IEEE International Conference on Robotic Computing, IRC 2018
Volume2018-January

Conference

Conference2nd IEEE International Conference on Robotic Computing, IRC 2018
Country/TerritoryUnited States
CityLaguna Hills
Period31/01/182/02/18

Keywords

  • Coordination
  • Robotics
  • Scheduling
  • Shared control
  • Teleoperation

Fingerprint

Dive into the research topics of 'Multi-robot scheduling and path-planning for non-overlapping operator attention'. Together they form a unique fingerprint.

Cite this