What to Do When You Can't Do It All: Temporal Logic Planning with Soft Temporal Logic Constraints

by   Hazhar Rahmani, et al.

In this paper, we consider a temporal logic planning problem in which the objective is to find an infinite trajectory that satisfies an optimal selection from a set of soft specifications expressed in linear temporal logic (LTL) while nevertheless satisfying a hard specification expressed in LTL. Our previous work considered a similar problem in which linear dynamic logic for finite traces (LDLf), rather than LTL, was used to express the soft constraints. In that work, LDLf was used to impose constraints on finite prefixes of the infinite trajectory. By using LTL, one is able not only to impose constraints on the finite prefixes of the trajectory, but also to set `soft' goals across the entirety of the infinite trajectory. Our algorithm first constructs a product automaton, on which the planning problem is reduced to computing a lasso with minimum cost. Among all such lassos, it is desirable to compute a shortest one. Though we prove that computing such a shortest lasso is computationally hard, we also introduce an efficient greedy approach to synthesize short lassos nonetheless. We present two case studies describing an implementation of this approach, and report results of our experiment comparing our greedy algorithm with an optimal baseline.


page 1

page 2

page 3

page 4


T* : A Heuristic Search Based Algorithm for Motion Planning with Temporal Goals

Motion planning is the core problem to solve for developing any applicat...

Maximum Realizability for Linear Temporal Logic Specifications

Automatic synthesis from linear temporal logic (LTL) specifications is w...

Synthesis from Satisficing and Temporal Goals

Reactive synthesis from high-level specifications that combine hard cons...

Minimum-Violation Planning for Autonomous Systems: Theoretical and Practical Considerations

This paper considers the problem of computing an optimal trajectory for ...

VectorTSP: A Traveling Salesperson Problem with Racetrack-like acceleration constraints

We study a new version of the Euclidean TSP called VectorTSP (VTSP for s...

Probabilistic Planning with Prioritized Preferences over Temporal Logic Objectives

This paper studies temporal planning in probabilistic environments, mode...

Handling PDDL3.0 State Trajectory Constraints with Temporal Landmarks

Temporal landmarks have been proved to be a helpful mechanism to deal wi...

Please sign up or login with your details

Forgot password? Click here to reset