Related papers: Reducing complexity of tail-biting trellises
Trellises provide a graphical representation for the row space of a matrix. The product construction of Kschischang and Sorokine builds minimal conventional trellises from matrices in minimal span form. Koetter and Vardy showed that minimal…
The concept of a local infimum for an optimal control problem is introduced. This definition extends that of an optimal process. For a~local infimum we prove an existence theorem and derive necessary conditions that resemble some family of…
It is proved that network realizability of controllers can be enforced without conservatism using convex constraints on the closed loop transfer function. Once a network realizable closed loop transfer matrix has been found, a corresponding…
We say that a control system is locally controllable if the attainable set from any state $x$ contains an open neighborhood of $x$, while it is controllable if the attainable set from any state is the entire state manifold. We show in this…
In this note, we consider the problem of choosing which nodes of a linear dynamical system should be actuated so that the state transfer from the system's initial condition to a given final state is possible. Assuming a standard complexity…
We investigate the theory of finite observables, i.e., resolutions of the finite-dimensional identity by means of positive operators, that have a physical interpretation in terms of measurement schemes. We focus on extremal and rank-one…
In this paper we present a satisfiability-preserving reduction from MITL interpreted over finitely-variable continuous behaviors to Constraint LTL over clocks, a variant of CLTL that is decidable, and for which an SMT-based bounded…
We introduce the concept of a control contraction metric, extending contraction analysis to constructive nonlinear control design. We derive sufficient conditions for exponential stabilizability of all trajectories of a nonlinear control…
An alternative formulation for the controllability problem of single input linear positive systems is presented. Driven by many industrial applications, this formulations focuses on the case where the region of interest is only a subset of…
We suggest a robust nearest-neighbor approach to classifying high-dimensional data. The method enhances sensitivity by employing a threshold and truncates to a sequence of zeros and ones in order to reduce the deleterious impact of…
In this paper, we study small-time local controllability of real analytic control-affine systems under small perturbations of their vector fields. Consider a real analytic control system $\mathcal{X}$ which is small-time locally…
Evaluating conjunctive queries and solving constraint satisfaction problems are fundamental problems in database theory and artificial intelligence, respectively. These problems are NP-hard, so that several research efforts have been made…
We consider an exit-time minimum problem with a running cost, $l\geq 0$ and unbounded controls. The occurrence of points where $l=0$ can be regarded as a transversality loss. Furthermore, since controls range over unbounded sets, the family…
Structural controllability has been proposed as an analytical framework for making predictions regarding the control of complex networks across myriad disciplines in the physical and life sciences (Liu et al., Nature:473(7346):167-173,…
The characterisation of termination using well-founded monotone algebras has been a milestone on the way to automated termination techniques, of which we have seen an extensive development over the past years. Both the semantic…
In this article, we introduce a notion of reducibility for partial functions on the natural numbers, which we call subTuring reducibility. One important aspect is that the subTuring degrees correspond to the structure of the realizability…
We consider networks of finite-state machines having local transitions conditioned by the current state of other automata. In this paper, we depict a reduction procedure tailored for a given reachability property of the form ``from global…
This chapter provides a hands-on tutorial on the important technique known as self-reducibility. Through a series of "Challenge Problems" that are theorems that the reader will---after being given definitions and tools---try to prove, the…
In this Note, we review the main existing results, methods, and some key open problems on the controllability of nonlinear hyperbolic and parabolic equations. Especially, we describe our recent universal approach to solve the local…
The study of network structural controllability focuses on the minimum number of driver nodes needed to control a whole network. Despite intensive studies on this topic, most of them consider static networks only. It is well-known, however,…