Using dynamic processing windows for robot group control

Alá Qadi, Steve Goddard, Jiangyang Huang, Shane M Farritor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper presents a method for determining the feasible processing window for a leader robot that controls a group of follower robots. A processing window is defined as the time interval from the instant the platform starts collecting data to the moment the robot leader finishes planning and communicates with follower robots. The method determines the minimum processing window after considering the different bounds affecting the control of the robot, such as of robot's processing power, robot sensors and the motion of the robots in the group. We present a derivation of the bounds that affect the processing window of the leader robot and an algorithm for determining the feasible window or adjusting the parameters that affect the processing window in case a feasible processing window cannot be achieved because of an overload condition. The application considered in this paper is a group of mobile robots that self deploy, retrieve, and reconfigure barrels to improve the safety of highway construction/maintenance workers.

Original languageEnglish (US)
Title of host publication2008 IEEE International Conference on Robotics and Automation, ICRA 2008
Pages3782-3789
Number of pages8
DOIs
StatePublished - Sep 18 2008
Event2008 IEEE International Conference on Robotics and Automation, ICRA 2008 - Pasadena, CA, United States
Duration: May 19 2008May 23 2008

Publication series

NameProceedings - IEEE International Conference on Robotics and Automation
ISSN (Print)1050-4729

Conference

Conference2008 IEEE International Conference on Robotics and Automation, ICRA 2008
CountryUnited States
CityPasadena, CA
Period5/19/085/23/08

Fingerprint

Robots
Processing
Mobile robots
Planning
Sensors

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Software
  • Artificial Intelligence
  • Electrical and Electronic Engineering

Cite this

Qadi, A., Goddard, S., Huang, J., & Farritor, S. M. (2008). Using dynamic processing windows for robot group control. In 2008 IEEE International Conference on Robotics and Automation, ICRA 2008 (pp. 3782-3789). [4543791] (Proceedings - IEEE International Conference on Robotics and Automation). https://doi.org/10.1109/ROBOT.2008.4543791

Using dynamic processing windows for robot group control. / Qadi, Alá; Goddard, Steve; Huang, Jiangyang; Farritor, Shane M.

2008 IEEE International Conference on Robotics and Automation, ICRA 2008. 2008. p. 3782-3789 4543791 (Proceedings - IEEE International Conference on Robotics and Automation).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Qadi, A, Goddard, S, Huang, J & Farritor, SM 2008, Using dynamic processing windows for robot group control. in 2008 IEEE International Conference on Robotics and Automation, ICRA 2008., 4543791, Proceedings - IEEE International Conference on Robotics and Automation, pp. 3782-3789, 2008 IEEE International Conference on Robotics and Automation, ICRA 2008, Pasadena, CA, United States, 5/19/08. https://doi.org/10.1109/ROBOT.2008.4543791
Qadi A, Goddard S, Huang J, Farritor SM. Using dynamic processing windows for robot group control. In 2008 IEEE International Conference on Robotics and Automation, ICRA 2008. 2008. p. 3782-3789. 4543791. (Proceedings - IEEE International Conference on Robotics and Automation). https://doi.org/10.1109/ROBOT.2008.4543791
Qadi, Alá ; Goddard, Steve ; Huang, Jiangyang ; Farritor, Shane M. / Using dynamic processing windows for robot group control. 2008 IEEE International Conference on Robotics and Automation, ICRA 2008. 2008. pp. 3782-3789 (Proceedings - IEEE International Conference on Robotics and Automation).
@inproceedings{c5a2a171e34e4399a6efe74566588d8a,
title = "Using dynamic processing windows for robot group control",
abstract = "This paper presents a method for determining the feasible processing window for a leader robot that controls a group of follower robots. A processing window is defined as the time interval from the instant the platform starts collecting data to the moment the robot leader finishes planning and communicates with follower robots. The method determines the minimum processing window after considering the different bounds affecting the control of the robot, such as of robot's processing power, robot sensors and the motion of the robots in the group. We present a derivation of the bounds that affect the processing window of the leader robot and an algorithm for determining the feasible window or adjusting the parameters that affect the processing window in case a feasible processing window cannot be achieved because of an overload condition. The application considered in this paper is a group of mobile robots that self deploy, retrieve, and reconfigure barrels to improve the safety of highway construction/maintenance workers.",
author = "Al{\'a} Qadi and Steve Goddard and Jiangyang Huang and Farritor, {Shane M}",
year = "2008",
month = "9",
day = "18",
doi = "10.1109/ROBOT.2008.4543791",
language = "English (US)",
isbn = "9781424416479",
series = "Proceedings - IEEE International Conference on Robotics and Automation",
pages = "3782--3789",
booktitle = "2008 IEEE International Conference on Robotics and Automation, ICRA 2008",

}

TY - GEN

T1 - Using dynamic processing windows for robot group control

AU - Qadi, Alá

AU - Goddard, Steve

AU - Huang, Jiangyang

AU - Farritor, Shane M

PY - 2008/9/18

Y1 - 2008/9/18

N2 - This paper presents a method for determining the feasible processing window for a leader robot that controls a group of follower robots. A processing window is defined as the time interval from the instant the platform starts collecting data to the moment the robot leader finishes planning and communicates with follower robots. The method determines the minimum processing window after considering the different bounds affecting the control of the robot, such as of robot's processing power, robot sensors and the motion of the robots in the group. We present a derivation of the bounds that affect the processing window of the leader robot and an algorithm for determining the feasible window or adjusting the parameters that affect the processing window in case a feasible processing window cannot be achieved because of an overload condition. The application considered in this paper is a group of mobile robots that self deploy, retrieve, and reconfigure barrels to improve the safety of highway construction/maintenance workers.

AB - This paper presents a method for determining the feasible processing window for a leader robot that controls a group of follower robots. A processing window is defined as the time interval from the instant the platform starts collecting data to the moment the robot leader finishes planning and communicates with follower robots. The method determines the minimum processing window after considering the different bounds affecting the control of the robot, such as of robot's processing power, robot sensors and the motion of the robots in the group. We present a derivation of the bounds that affect the processing window of the leader robot and an algorithm for determining the feasible window or adjusting the parameters that affect the processing window in case a feasible processing window cannot be achieved because of an overload condition. The application considered in this paper is a group of mobile robots that self deploy, retrieve, and reconfigure barrels to improve the safety of highway construction/maintenance workers.

UR - http://www.scopus.com/inward/record.url?scp=51649118148&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51649118148&partnerID=8YFLogxK

U2 - 10.1109/ROBOT.2008.4543791

DO - 10.1109/ROBOT.2008.4543791

M3 - Conference contribution

SN - 9781424416479

T3 - Proceedings - IEEE International Conference on Robotics and Automation

SP - 3782

EP - 3789

BT - 2008 IEEE International Conference on Robotics and Automation, ICRA 2008

ER -