Robust Multi-Robot Optimal Path Planning with Temporal Logic Constraints

Details Robust Multi-Robot Optimal Path Planning with Temporal Logic Constraints Robust Multi-Robot Optimal Path Planning with Temporal Logic Constraints

2012-02-06

arxiv.org/abs/1202.1307v1

Computer Science

Robotics

Extended version of the ICRA 2012 conference paper

Scientific paper

In this paper we present a method for automatically planning robust 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, and the mission is given as a Linear Temporal Logic (LTL) formula over a set of propositions satisfied by the regions of the environment. In addition, an optimizing proposition must repeatedly be satisfied. The goal is to minimize the maximum time between satisfying instances of the optimizing proposition while ensuring that the LTL formula is satisfied even with uncertainty in the robots' traveling times. We characterize a class of LTL formulas that are robust to robot timing errors, for which we generate optimal paths if no timing errors are present, and we present bounds on the deviation from the optimal values in the presence of errors. We implement and experimentally evaluate our method considering a persistent monitoring task in a road network environment.

Affiliated with

Also associated with

No associations

Rating

Robust Multi-Robot Optimal Path Planning with Temporal Logic Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robust Multi-Robot Optimal Path Planning with Temporal Logic Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robust Multi-Robot Optimal Path Planning with Temporal Logic Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578467