Optimal path planning for surveillance with temporal-logic constraints
Authors:
Top Cited Papers
- 10 October 2011
- journal article
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 30 (14) , 1695-1708
Abstract
In this paper we present a method for automatically generating optimal robot paths satisfying high-level mission specifications. The motion of the robot in the environment is modeled as a weighted transition system. The mission is specified by an arbitrary linear temporal-logic (LTL) formula over propositions satisfied at the regions of a partitioned environment. The mission specification contains an optimizing proposition, which must be repeatedly satisfied. The cost function that we seek to minimize is the maximum time between satisfying instances of the optimizing proposition. For every environment model, and for every formula, our method computes a robot path that minimizes the cost function. The problem is motivated by applications in robotic monitoring and data-gathering. In this setting, the optimizing proposition is satisfied at all locations where data can be uploaded, and the LTL formula specifies a complex data-collection mission. Our method utilizes Büchi automata to produce an automaton (which can be thought of as a graph) whose runs satisfy the temporal-logic specification. We then present a graph algorithm that computes a run corresponding to the optimal robot path. We present an implementation for a robot performing data collection in a road-network platform.Keywords
This publication has 22 references indexed in Scilit:
- LQR-trees: Feedback Motion Planning via Sums-of-Squares VerificationThe International Journal of Robotics Research, 2010
- Fifty Years of Vehicle RoutingTransportation Science, 2009
- Temporal logic motion planning for dynamic robotsAutomatica, 2009
- Reachability and Control Synthesis for Piecewise-Affine Hybrid Systems on SimplicesIEEE Transactions on Automatic Control, 2006
- A control problem for affine dynamical systems on a full-dimensional polytopeAutomatica, 2004
- Fast LTL to Büchi Automata Translation2001
- Randomized Kinodynamic PlanningThe International Journal of Robotics Research, 2001
- The model checker SPINIEEE Transactions on Software Engineering, 1997
- Reasoning about Infinite ComputationsInformation and Computation, 1994
- Exact robot navigation using artificial potential functionsIEEE Transactions on Robotics and Automation, 1992