Optimal multi-robot path planning with temporal logic constraints
Name
Rus_Optimal Multi-robot.pdf
Size
1 MB
Format
Adobe PDF
Checksum (MD5)
8c58066c44c07870fe503ceb939eb8c9
Author(s)
Ulusoy, Alphan
Smith, Stephen L.
Ding, Xu Chu
Belta, Calin
Rus, Daniela L.
Date Issued
December 2011
Journal
IEEE/RSJ International Conference on Intelligent Robots and Systems 2011 (IROS)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Ulusoy, Alphan et al. “Optimal Multi-robot Path Planning with Temporal Logic Constraints.” IEEE/RSJ International Conference on Intelligent Robots and Systems 2011 (IROS). 3087–3092.
Version
Author's final manuscript
Abstract
In this paper we present a method for automatically planning optimal paths for a group of robots that satisfy a common high level mission specification. Each robot's motion in the environment is modeled as a weighted transition system. The mission is given as a Linear Temporal Logic formula. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize the maximum time between satisfying instances of the optimizing proposition. Our method is guaranteed to compute an optimal set of robot paths. We utilize a timed automaton representation in order to capture the relative position of the robots in the environment. We then obtain a bisimulation of this timed automaton as a finite transition system that captures the joint behavior of the robots and apply our earlier algorithm for the single robot case to optimize the group motion. We present a simulation of a persistent monitoring task in a road network environment.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. School of Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/IROS.2011.6094884
