TY - GEN
T1 - On time-optimal behavior scheduling of robotic swarms for achieving multiple goals
AU - Nagavalli, Sasanka
AU - Chakraborty, Nilanjan
AU - Sycara, Katia
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/1
Y1 - 2017/7/1
N2 - Robotic swarms are multi-robot systems whose global behaviors emerge from local interactions between individual robots. Each robot obeys a local control law that can be activated depending on an operator's choice of global swarm behavior. Real missions occur in uncontrolled environments with dynamically arising objectives and require combinations of behaviors. Given a library of swarm behaviors, a supervisory operator commanding the swarm must choose a sequence of behaviors to execute and their execution durations in order to accomplish a particular task during a mission composed of many tasks. In this paper, we address the following problem: given a library of swarm behaviors, the swarm initial state, the final goal and an unordered set of intermediate goals the operator wants to achieve, the objective is to identify a behavior schedule comprised of selected behaviors and associated time intervals of application of the behavior so that the total time to reach the final goal is minimized. Our contributions are as follows: (a) formalization of the problem of behavior scheduling to achieve multiple unordered goals with a robotic swarm, (b) an algorithm that produces a behavior schedule to achieve all intermediate goals and the final goal in minimum time such that the behavior durations are locally optimal and given which the goal sequence has bounded suboptimality and (c) application of this algorithm to configuration control of robot swarms.
AB - Robotic swarms are multi-robot systems whose global behaviors emerge from local interactions between individual robots. Each robot obeys a local control law that can be activated depending on an operator's choice of global swarm behavior. Real missions occur in uncontrolled environments with dynamically arising objectives and require combinations of behaviors. Given a library of swarm behaviors, a supervisory operator commanding the swarm must choose a sequence of behaviors to execute and their execution durations in order to accomplish a particular task during a mission composed of many tasks. In this paper, we address the following problem: given a library of swarm behaviors, the swarm initial state, the final goal and an unordered set of intermediate goals the operator wants to achieve, the objective is to identify a behavior schedule comprised of selected behaviors and associated time intervals of application of the behavior so that the total time to reach the final goal is minimized. Our contributions are as follows: (a) formalization of the problem of behavior scheduling to achieve multiple unordered goals with a robotic swarm, (b) an algorithm that produces a behavior schedule to achieve all intermediate goals and the final goal in minimum time such that the behavior durations are locally optimal and given which the goal sequence has bounded suboptimality and (c) application of this algorithm to configuration control of robot swarms.
UR - https://www.scopus.com/pages/publications/85044970431
U2 - 10.1109/COASE.2017.8256323
DO - 10.1109/COASE.2017.8256323
M3 - Conference contribution
AN - SCOPUS:85044970431
T3 - IEEE International Conference on Automation Science and Engineering
SP - 1546
EP - 1553
BT - 2017 13th IEEE Conference on Automation Science and Engineering, CASE 2017
PB - IEEE Computer Society
T2 - 13th IEEE Conference on Automation Science and Engineering, CASE 2017
Y2 - 20 August 2017 through 23 August 2017
ER -