Coordinated Traffic Scheduling for Communicating Mobile Robots

Anjan Ray, TM McGinnity, Laxmidhar Behera, SA Coleman, Mo Jamshidi

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

Abstract

In this paper, a multi-robot networking paradigm is presented. This provides a general framework for coordination among a group of robots. An experiment is conducted showingthe effectiveness of the developed network paradigm where a robot controls a group of robots. A coordinated traffic scheduling method is proposed for mobile robots. The aim is to build onboard knowledge for autonomous robots without ranging sensors (sonar or laser range finder) and/or cameras. In this work, more emphasis is given on the exploration of interactions between a pair of robots. The robots share their positions,orientations and safety information and the decision of a robot depends on interactions of the forward safe paths (FSPs) of these robots. The properties of intersection of two straight lines are used to classify different situations. The proposed method is discussed in details with various combinations of scenarios. Simulation results are presented to show the effectiveness of the proposed method.Anjan Kumar Ray ∗, Martin McGinnity ∗, Laxmidhar Behera †, Sonya Coleman ∗, Mo Jamshidi ‡
LanguageEnglish
Title of host publicationUnknown Host Publication
Place of PublicationNew York
Pages323-328
Number of pages6
DOIs
Publication statusPublished - 29 Jun 2011
Event6th Int Conference on Systems of Systems Engineering IEEE SOSE 2011 - Albuquerque New Mexico USA
Duration: 29 Jun 2011 → …
http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5966618

Conference

Conference6th Int Conference on Systems of Systems Engineering IEEE SOSE 2011
Period29/06/11 → …
Internet address

Fingerprint

Intelligent robots
Mobile robots
Scheduling
Robots
Range finders
Sonar
Cameras

Cite this

Ray, A., McGinnity, TM., Behera, L., Coleman, SA., & Jamshidi, M. (2011). Coordinated Traffic Scheduling for Communicating Mobile Robots. In Unknown Host Publication (pp. 323-328). New York. https://doi.org/10.1109/SYSOSE.2011.5966618
Ray, Anjan ; McGinnity, TM ; Behera, Laxmidhar ; Coleman, SA ; Jamshidi, Mo. / Coordinated Traffic Scheduling for Communicating Mobile Robots. Unknown Host Publication. New York, 2011. pp. 323-328
@inproceedings{97f5e697367b4d0ea394b1a10aea515b,
title = "Coordinated Traffic Scheduling for Communicating Mobile Robots",
abstract = "In this paper, a multi-robot networking paradigm is presented. This provides a general framework for coordination among a group of robots. An experiment is conducted showingthe effectiveness of the developed network paradigm where a robot controls a group of robots. A coordinated traffic scheduling method is proposed for mobile robots. The aim is to build onboard knowledge for autonomous robots without ranging sensors (sonar or laser range finder) and/or cameras. In this work, more emphasis is given on the exploration of interactions between a pair of robots. The robots share their positions,orientations and safety information and the decision of a robot depends on interactions of the forward safe paths (FSPs) of these robots. The properties of intersection of two straight lines are used to classify different situations. The proposed method is discussed in details with various combinations of scenarios. Simulation results are presented to show the effectiveness of the proposed method.Anjan Kumar Ray ∗, Martin McGinnity ∗, Laxmidhar Behera †, Sonya Coleman ∗, Mo Jamshidi ‡",
author = "Anjan Ray and TM McGinnity and Laxmidhar Behera and SA Coleman and Mo Jamshidi",
year = "2011",
month = "6",
day = "29",
doi = "10.1109/SYSOSE.2011.5966618",
language = "English",
isbn = "978-1-61284-783-2",
pages = "323--328",
booktitle = "Unknown Host Publication",

}

Ray, A, McGinnity, TM, Behera, L, Coleman, SA & Jamshidi, M 2011, Coordinated Traffic Scheduling for Communicating Mobile Robots. in Unknown Host Publication. New York, pp. 323-328, 6th Int Conference on Systems of Systems Engineering IEEE SOSE 2011, 29/06/11. https://doi.org/10.1109/SYSOSE.2011.5966618

Coordinated Traffic Scheduling for Communicating Mobile Robots. / Ray, Anjan; McGinnity, TM; Behera, Laxmidhar; Coleman, SA; Jamshidi, Mo.

Unknown Host Publication. New York, 2011. p. 323-328.

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

TY - GEN

T1 - Coordinated Traffic Scheduling for Communicating Mobile Robots

AU - Ray, Anjan

AU - McGinnity, TM

AU - Behera, Laxmidhar

AU - Coleman, SA

AU - Jamshidi, Mo

PY - 2011/6/29

Y1 - 2011/6/29

N2 - In this paper, a multi-robot networking paradigm is presented. This provides a general framework for coordination among a group of robots. An experiment is conducted showingthe effectiveness of the developed network paradigm where a robot controls a group of robots. A coordinated traffic scheduling method is proposed for mobile robots. The aim is to build onboard knowledge for autonomous robots without ranging sensors (sonar or laser range finder) and/or cameras. In this work, more emphasis is given on the exploration of interactions between a pair of robots. The robots share their positions,orientations and safety information and the decision of a robot depends on interactions of the forward safe paths (FSPs) of these robots. The properties of intersection of two straight lines are used to classify different situations. The proposed method is discussed in details with various combinations of scenarios. Simulation results are presented to show the effectiveness of the proposed method.Anjan Kumar Ray ∗, Martin McGinnity ∗, Laxmidhar Behera †, Sonya Coleman ∗, Mo Jamshidi ‡

AB - In this paper, a multi-robot networking paradigm is presented. This provides a general framework for coordination among a group of robots. An experiment is conducted showingthe effectiveness of the developed network paradigm where a robot controls a group of robots. A coordinated traffic scheduling method is proposed for mobile robots. The aim is to build onboard knowledge for autonomous robots without ranging sensors (sonar or laser range finder) and/or cameras. In this work, more emphasis is given on the exploration of interactions between a pair of robots. The robots share their positions,orientations and safety information and the decision of a robot depends on interactions of the forward safe paths (FSPs) of these robots. The properties of intersection of two straight lines are used to classify different situations. The proposed method is discussed in details with various combinations of scenarios. Simulation results are presented to show the effectiveness of the proposed method.Anjan Kumar Ray ∗, Martin McGinnity ∗, Laxmidhar Behera †, Sonya Coleman ∗, Mo Jamshidi ‡

U2 - 10.1109/SYSOSE.2011.5966618

DO - 10.1109/SYSOSE.2011.5966618

M3 - Conference contribution

SN - 978-1-61284-783-2

SP - 323

EP - 328

BT - Unknown Host Publication

CY - New York

ER -