pith. sign in

arxiv: 1203.5683 · v1 · pith:B4NCC74Anew · submitted 2012-03-26 · 💻 cs.SY

Time-Constrained Temporal Logic Control of Multi-Affine Systems

classification 💻 cs.SY
keywords logictemporaltimealgorithmgivenmulti-affineproblemreachability
0
0 comments X
read the original abstract

In this paper, we consider the problem of controlling a dynamical system such that its trajectories satisfy a temporal logic property in a given amount of time. We focus on multi-affine systems and specifications given as syntactically co-safe linear temporal logic formulas over rectangular regions in the state space. The proposed algorithm is based on the estimation of time bounds for facet reachability problems and solving a time optimal reachability problem on the product between a weighted transition system and an automaton that enforces the satisfaction of the specification. A random optimization algorithm is used to iteratively improve the solution.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.