Multirobot task allocation with real-time path planning

Bradley Woosley, Prithviraj Dasgupta

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

11 Citations (Scopus)

Abstract

We consider the multi-robot task allocation (MRTA) problem in an initially unknown environment. The objective of the MRTA problem is to find a schedule or sequence of tasks that should be performed by a set of robots so that the cost or energy expended by the robots is minimized. Existing solutions for the MRTA problem mainly concentrate on finding an efficient task allocation among robots, without directly incorporating changes to tasks' costs originating from changes in robots' paths due to dynamically detected obstacles while moving between tasks. Dynamically updating path costs is an important aspect as changing path costs can alter the task sequence for robots that corresponds to the minimum cost. In this paper, we attempt to address this problem by developing an algorithm called MRTA-RTPP (MRTA with Real-time Path Planning) by integrating a greedy MRTA algorithm for task planning with a Field D*-based path planning algorithm. Our technique is capable of handling dynamic changes in a robot's path costs due to static as well as mobile obstacles and computes a new task schedule if the original schedule is no longer optimal due to the robots' replanned paths. We have verified our proposed technique on physical Corobot robots that perform surveillance-like tasks by visiting a set of locations. Our experimental results show that that our MRTA technique is able to handle dynamic path changes while reducing the cost of the schedule to the robots.

Original languageEnglish (US)
Title of host publicationFLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference
Pages574-579
Number of pages6
StatePublished - Dec 13 2013
Event26th International Florida Artificial Intelligence Research Society Conference, FLAIRS 2013 - St. Pete Beach, FL, United States
Duration: May 22 2013May 24 2013

Publication series

NameFLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference

Conference

Conference26th International Florida Artificial Intelligence Research Society Conference, FLAIRS 2013
CountryUnited States
CitySt. Pete Beach, FL
Period5/22/135/24/13

Fingerprint

Motion planning
Robots
Costs

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Woosley, B., & Dasgupta, P. (2013). Multirobot task allocation with real-time path planning. In FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference (pp. 574-579). (FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference).

Multirobot task allocation with real-time path planning. / Woosley, Bradley; Dasgupta, Prithviraj.

FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference. 2013. p. 574-579 (FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference).

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

Woosley, B & Dasgupta, P 2013, Multirobot task allocation with real-time path planning. in FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference. FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference, pp. 574-579, 26th International Florida Artificial Intelligence Research Society Conference, FLAIRS 2013, St. Pete Beach, FL, United States, 5/22/13.
Woosley B, Dasgupta P. Multirobot task allocation with real-time path planning. In FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference. 2013. p. 574-579. (FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference).
Woosley, Bradley ; Dasgupta, Prithviraj. / Multirobot task allocation with real-time path planning. FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference. 2013. pp. 574-579 (FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference).
@inproceedings{36971772e28b4552920780ef6106ed5c,
title = "Multirobot task allocation with real-time path planning",
abstract = "We consider the multi-robot task allocation (MRTA) problem in an initially unknown environment. The objective of the MRTA problem is to find a schedule or sequence of tasks that should be performed by a set of robots so that the cost or energy expended by the robots is minimized. Existing solutions for the MRTA problem mainly concentrate on finding an efficient task allocation among robots, without directly incorporating changes to tasks' costs originating from changes in robots' paths due to dynamically detected obstacles while moving between tasks. Dynamically updating path costs is an important aspect as changing path costs can alter the task sequence for robots that corresponds to the minimum cost. In this paper, we attempt to address this problem by developing an algorithm called MRTA-RTPP (MRTA with Real-time Path Planning) by integrating a greedy MRTA algorithm for task planning with a Field D*-based path planning algorithm. Our technique is capable of handling dynamic changes in a robot's path costs due to static as well as mobile obstacles and computes a new task schedule if the original schedule is no longer optimal due to the robots' replanned paths. We have verified our proposed technique on physical Corobot robots that perform surveillance-like tasks by visiting a set of locations. Our experimental results show that that our MRTA technique is able to handle dynamic path changes while reducing the cost of the schedule to the robots.",
author = "Bradley Woosley and Prithviraj Dasgupta",
year = "2013",
month = "12",
day = "13",
language = "English (US)",
isbn = "9781577356059",
series = "FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference",
pages = "574--579",
booktitle = "FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference",

}

TY - GEN

T1 - Multirobot task allocation with real-time path planning

AU - Woosley, Bradley

AU - Dasgupta, Prithviraj

PY - 2013/12/13

Y1 - 2013/12/13

N2 - We consider the multi-robot task allocation (MRTA) problem in an initially unknown environment. The objective of the MRTA problem is to find a schedule or sequence of tasks that should be performed by a set of robots so that the cost or energy expended by the robots is minimized. Existing solutions for the MRTA problem mainly concentrate on finding an efficient task allocation among robots, without directly incorporating changes to tasks' costs originating from changes in robots' paths due to dynamically detected obstacles while moving between tasks. Dynamically updating path costs is an important aspect as changing path costs can alter the task sequence for robots that corresponds to the minimum cost. In this paper, we attempt to address this problem by developing an algorithm called MRTA-RTPP (MRTA with Real-time Path Planning) by integrating a greedy MRTA algorithm for task planning with a Field D*-based path planning algorithm. Our technique is capable of handling dynamic changes in a robot's path costs due to static as well as mobile obstacles and computes a new task schedule if the original schedule is no longer optimal due to the robots' replanned paths. We have verified our proposed technique on physical Corobot robots that perform surveillance-like tasks by visiting a set of locations. Our experimental results show that that our MRTA technique is able to handle dynamic path changes while reducing the cost of the schedule to the robots.

AB - We consider the multi-robot task allocation (MRTA) problem in an initially unknown environment. The objective of the MRTA problem is to find a schedule or sequence of tasks that should be performed by a set of robots so that the cost or energy expended by the robots is minimized. Existing solutions for the MRTA problem mainly concentrate on finding an efficient task allocation among robots, without directly incorporating changes to tasks' costs originating from changes in robots' paths due to dynamically detected obstacles while moving between tasks. Dynamically updating path costs is an important aspect as changing path costs can alter the task sequence for robots that corresponds to the minimum cost. In this paper, we attempt to address this problem by developing an algorithm called MRTA-RTPP (MRTA with Real-time Path Planning) by integrating a greedy MRTA algorithm for task planning with a Field D*-based path planning algorithm. Our technique is capable of handling dynamic changes in a robot's path costs due to static as well as mobile obstacles and computes a new task schedule if the original schedule is no longer optimal due to the robots' replanned paths. We have verified our proposed technique on physical Corobot robots that perform surveillance-like tasks by visiting a set of locations. Our experimental results show that that our MRTA technique is able to handle dynamic path changes while reducing the cost of the schedule to the robots.

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

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

M3 - Conference contribution

AN - SCOPUS:84889853891

SN - 9781577356059

T3 - FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference

SP - 574

EP - 579

BT - FLAIRS 2013 - Proceedings of the 26th International Florida Artificial Intelligence Research Society Conference

ER -