Optimal Multi-Robot Path Planning with Temporal Logic Constraints

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

2011-06-30

arxiv.org/abs/1107.0062v1

Computer Science

Robotics

Extended version of the IROS 2011 conference paper

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Optimal Multi-Robot 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 Optimal Multi-Robot Path Planning with Temporal Logic Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Multi-Robot Path Planning with Temporal Logic Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-480152