Optimality and Robustness in Multi-Robot Path Planning with Temporal Logic Constraints. (July 2013)

• Record Type: Journal Article
• Authors: Ulusoy, Alphan; Smith, Stephen L.; Ding, Xu Chu; Belta, Calin; Rus, Daniela
• Is Part Of: International journal of robotics research. Volume 32:Number 8(2013)
• Page Start: 889
• Page End: 911
• Publication Date: 2013-07
• Subjects: optimal path planning -- optimal multi-robot path planning -- temporal logic -- formal methods; Robots -- Periodicals; Robots, Industrial -- Periodicals; 629.89205
• DOI: 10.1177/0278364913487931
• Languages: English
• ISSNs: 0278-3649

Abstract

In this paper we present a method for automatic planning of optimal paths for a group of robots that satisfy a common high-level mission specification. The motion of each robot is modeled as a weighted transition system, and the mission is given as a linear temporal logic (LTL) formula over a set of propositions satisfied at the regions of the environment. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize a cost function that captures the maximum time between successive satisfactions of the optimizing proposition while guaranteeing that the formula is satisfied. When the robots can follow a given trajectory exactly, our method computes a set of optimal satisfying paths that minimize the cost function and satisfy the LTL formula. However, if the traveling times of the robots are uncertain, then the robots may not be able to follow a given trajectory exactly, possibly violating the LTL formula during deployment. We handle such cases by leveraging the communication capabilities of the robots to guarantee correctness during deployment and provide bounds on the deviation from the optimal values. We implement and experimentally evaluate our method for various persistent surveillance tasks in a road network environment.