Searcharxiv⌕ Search

arXiv · 2611.09283

Hierarchical Signal Temporal Logic Control of Continuous-Time Systems

Abstract

For linear continuous-time systems, we solve the signal temporal logic (STL) control problem by translating it from continuous to discrete time such that a solution to the discrete-time problem guarantees a solution to the original continuous-time one. We split control synthesis into three hierarchical tasks. First, we discretize the continuous-time STL formula into a discrete-time one by sampling the temporal behavior it specifies. We accordingly discretize the continuous-time system by constructing a discrete-time model such that the input-state trajectories of the continuous-time system can be characterized as piecewise polynomial interpolations of the input-state trajectories of the discrete-time model. Second, we exploit this characterization to formulate mixed-integer linear constraints on the discrete-time trajectories that allow for planning a trajectory whose piecewise polynomial interpolation satisfies the continuous-time STL formula. In fact, system discretization and trajectory planning are performed in such a manner that any feasible solution to these constraints gives a discrete-time trajectory that can be transformed into a continuous-time one guaranteed to satisfy the original STL formula. Third, we propose a step-by-step algorithm to construct the control input that realizes such continuous-time trajectory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Armin Pirastehzad, Bart Besselink. 2026-11-06. Hierarchical Signal Temporal Logic Control of Continuous-Time Systems. https://arxiv.org/abs/2611.09283

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Decentralized Estimation and Control for Leader-Follower Networked Systems with Asymmetric Information Structure

In this paper, the decentralized estimation and linear quadratic (LQ) control problem for a leader-follower networked system (LFNS) is studied from the perspective of asymmetric information. Specifically, for a leader-follower network, the follower agent will be affected by the leader agent, while the follower agent will not affect the leader agent. Hence, the information sets accessed by the control variables of the leader agent and the follower agent are asymmetric, which will bring essential difficulties in finding the optimal control strategy. To this end, the orthogonal decomposition method is adopted to achieve the main results. The main contributions of this paper can be summarized as follows: Firstly, the optimal iterative estimation is derived using the conditional independence property established in this paper. Secondly, the optimal decentralized control strategy is derived by decoupling the forward-backward stochastic difference equations (FBSDEs), based on the derived optimal iterative estimation. Thirdly, the necessary and sufficient conditions for the feedback stabilization of the LFNS in infinite-horizon are derived. Finally, the proposed theoretical results are applied to solve the decentralized control problem of a leader-follower autonomous underwater vehicle (LF-AUV) system. The optimal control inputs for the AUVs are provided, and simulation results verify the effectiveness of the obtained results.

math.OC↗

A Measure-Theoretic Formulation of Behavioral Systems

Ensemble control specifies probability laws on admissible trajectories, including their temporal dependence. Starting from an arbitrary closed behavior, we organize its laws into a framework that connects standard probability-measure geometry, occupation-measure control, and data-driven trajectory parametrization. Classical convexity and extreme-point properties describe the feasible laws, while classical Bellman duality governs additive control objectives. On compact state and input spaces, full-path constrained duality for continuous trajectory functions gives primal attainment and zero gap whenever feasible. For controllable linear time-invariant systems, the noise-free Fundamental Lemma yields an equivalent law-level Hankel factorization, with a canonical pseudoinverse lift. The factorization transfers trajectory-law constraints exactly to coefficient space and connects them to covariance control. Explicit noisy-Hankel bounds quantify subspace approximation for second-moment-bounded laws under known rank and Gaussian output measurement noise. Numerical studies include a nonlinear reset problem whose nonadjacent correlation constraint requires temporal memory, covariance-constrained optimization, and noisy-data policy evaluation. Known transition kernels provide a further structural perspective through history-conditional consistency.

math.OC↗

Optimal Oracle Complexity for Weakly Convex Optimization

We study the oracle complexity of finding $ε$-stationary points of $ρ$-weakly convex and $G$-Lipschitz functions, where stationarity is measured by the gradient of the Moreau envelope. We consider an exact first-order oracle that returns both the function value and the full subdifferential at every query point. In the principal parameter regime, we prove that every first-order algorithm, including randomized algorithms, requires $Ω(\tfrac{ρG^2Δ}{ε^4})$ oracle queries to succeed with any fixed positive probability, where $f(0)-\inf f\leΔ$. This lower bound matches the best known deterministic and stochastic first-order upper bounds, up to universal constants, and establishes the optimal randomized first-order oracle complexity. The result separates smooth nonconvex and weakly convex optimization: the additional $ε^{-2}$ factor is intrinsic to nonsmooth geometry rather than stochastic oracle noise.

math.OC↗