相关论文: Path-complete $p$-dominant switching linear system…
We present a homological characterisation of those chain complexes of modules over a Laurent polynomial ring in several indeterminates which are finitely dominated over the ground ring (that is, are a retract up to homotopy of a bounded…
In this article, a novel fast randomized subspace system identification method for estimating combined deterministic-stochastic LTI state-space models, is proposed. The algorithm is especially well-suited to identify high-order and…
We consider the problem of data-driven predictive control for an unknown discrete-time linear time-periodic (LTP) system of known period. Our proposed strategy generalizes both Data-enabled Predictive Control (DeePC) and Subspace Predictive…
Given a finite-dimensional time continuous control system and $\varepsilon>0$, we address the question of the existence of controls that maintain the corresponding state trajectories in the $\varepsilon$-neighborhood of any prescribed path…
The turnpike phenomenon stipulates that the solution of an optimal control problem in large time, remains essentially close to a steady-state of the dynamics, itself being the optimal solution of an associated static optimal control…
Random matrix theory of the transition strengths is applied to transport in the strongly localized regime. The crossover distribution function between the different ensembles is derived and used to predict quantitatively the {\sl universal}…
We study the algorithmic complexity of the problem of deciding whether a Linear Time Invariant dynamical system with rational coefficients has bounded trajectories. Despite its ubiquitous and elementary nature in Systems and Control, it…
Many applications -- including power systems, robotics, and economics -- involve a dynamical system interacting with a stochastic and hard-to-model environment. We adopt a reinforcement learning approach to control such systems.…
Despite its nonconvexity, policy optimization for the Linear Quadratic Regulator (LQR) admits a favorable structural property known as gradient dominance, which facilitates linear convergence of policy gradient methods to the globally…
Given a graph G equals (V,E), a subset S subset of V is a dominating set if every vertex in V minus S is adjacent to some vertex in S. The dominating set with the least cardinality, gamma, is called a gamma-set which is commonly known as a…
A trapping region is a compact set that is forward invariant with respect to the dynamics. Existence of a trapping region certifies boundedness of trajectories, and the size of the set provides an estimate of the ultimate bound. Prior work…
The computation of the domination-type parameters is a challenging problem in Cartesian product graphs. We present an algorithmic method to compute the $2$-domination number of the Cartesian product of a path with small order and any cycle,…
Given a graph G=(V, E), a vertex is said to ve-dominate an edge if it is either incident with the edge or adjacent to one of its endpoints. A set of vertices is a ve-dominating set if it ve-dominates every edge of the graph. We introduce…
We discuss the the notion of a partial dynamical symmetry (PDS), for which a prescribed symmetry is obeyed by only a subset of solvable eigenstates, while other eigenstates are strongly mixed. We present an explicit construction of…
Probabilistic Cell Decomposition (PCD) is a probabilistic path planning method combining the concepts of approximate cell decomposition with probabilistic sampling. It has been shown that the use of lazy evaluation techniques and supervised…
The probability distribution of the conductance at the mobility edge, $p_c(g)$, in different universality classes and dimensions is investigated numerically for a variety of random systems. It is shown that $p_c(g)$ is universal for systems…
This paper develops a systematic treatment of monotonicity-based pathwise dualities for Markov processes taking values in partially ordered sets. We show that every Markov process that takes values in a finite partially ordered set and…
Let $G=(V,E)$ be a graph and $p$ a positive integer. A subset $S\subseteq V$ is called a $p$-dominating set of $G$ if every vertex not in $S$ has at least $p$ neighbors in $S$. The $p$-domination number is the minimum cardinality of a…
Given a family of systems, identifying stabilizing switching signals in terms of infinite walks constructed by concatenating cycles on the underlying directed graph of a switched system that satisfy certain conditions, is a well-known…
We introduce the concept of a deterministic walk. Confining our attention to the finite state case, we establish hypotheses that ensure that the deterministic walk is transitive, and show that this property is in some sense robust. We also…