Reasoning about infinite computations
Information and Computation
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Model checking
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Planning Algorithms
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Temporal logic motion planning for dynamic robots
Automatica (Journal of IFAC)
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Fifty Years of Vehicle Routing
Transportation Science
Specification and planning of UAV missions: a process algebra approach
ACC'09 Proceedings of the 2009 conference on American Control Conference
Receding horizon control for temporal logic specifications
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification
International Journal of Robotics Research
Discrete abstractions for robot motion planning and control in polygonal environments
IEEE Transactions on Robotics
Temporal-Logic-Based Reactive Mission and Motion Planning
IEEE Transactions on Robotics
A control problem for affine dynamical systems on a full-dimensional polytope
Automatica (Journal of IFAC)
Least-violating control strategy synthesis with safety rules
Proceedings of the 16th international conference on Hybrid systems: computation and control
LTL receding horizon control for finite deterministic systems
Automatica (Journal of IFAC)
Hi-index | 0.00 |
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.