Related papers: Combinatorics-Based Approaches to Controllability …
This paper focuses on the need for a rigorous theory of layered control architectures (LCAs) for complex engineered and natural systems, such as power systems, communication networks, autonomous robotics, bacteria, and human sensorimotor…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
There is a growing interest in data-driven control of nonlinear systems over the last years. In contrast to related works, this paper takes a step back and aims to solve the output matching problem, a problem closely related to the…
We discuss the use of methods coming from integrable systems to study problems of enumerative and algebraic combinatorics, and develop two examples: the enumeration of Alternating Sign Matrices and related combinatorial objects, and the…
This paper examines the controllability for quantum control systems with SU(1,1) dynamical symmetry, namely, the ability to use some electromagnetic field to redirect the quantum system toward a desired evolution. The problem is formalized…
This book is mainly an exposition of the author's works and his joint works with his former students on explicit representations of finite-dimensional simple Lie algebras, related partial differential equations, linear orthogonal algebraic…
The paper considers pseudo-differential boundary value control systems. The underlying operators form an algebra D with the help of which we are able to formulate typical boundary value control problems. The symbolic calculus gives tools to…
While many robotic tasks, like manipulation and locomotion, are fundamentally based in making and breaking contact with the environment, state-of-the-art control policies struggle to deal with the hybrid nature of multi-contact motion. Such…
In this work we define and analyze the bilinear models which replace the conventional linear operation used in many building blocks of machine learning (ML). The main idea is to devise the ML algorithms which are adapted to the objects they…
Via a non degenerate symmetric bilinear form we identify the coadjoint representation with a new representation and so we induce on the orbits a simplectic form. By considering Hamiltonian systems on the orbits we study some features of…
The paper continues the authors' study of the linearizability problem for nonlinear control systems. In the recent work [K. Sklyar, Systems Control Lett. 134 (2019), 104572], conditions on mappability of a nonlinear control system to a…
The current paper presents a new approach to multilinear dynamical systems analysis and control. The approach is based upon recent developments in tensor decompositions and a newly defined algebra of circulants. In particular, it is shown…
In control theory, researchers need to understand a system's local and global behaviors in relation to its initial conditions. When discussing observability, the main focus is on the ability to analyze the system using an output space…
In this paper, we propose an adaptive control law for completely unknown scalar linear systems based on Lie-bracket approximation methods. We investigate stability and convergence properties for the resulting Lie-bracket system, compare our…
Combinatorial Testing (CT) is a potentially powerful testing technique, whereas its failure revealing ability might be dramatically reduced if it fails to handle constraints in an adequate and efficient manner. To ensure the wider…
An overview and synthesis of results and criteria for open-loop controllability of Hamiltonian quantum systems obtained using Lie group and Lie algebra techniques is presented. Negative results for open-loop controllability of dissipative…
In this paper, we study compatible Leibniz algebras. We characterize compatible Leibniz algebras in terms of Maurer-Cartan elements of a suitable differential graded Lie algebra. We define a cohomology theory of compatible Leibniz algebras…
Combinatorial optimization problems are pervasive across science and industry. Modern deep learning tools are poised to solve these problems at unprecedented scales, but a unifying framework that incorporates insights from statistical…
We develop a new, intrinsic, computationally friendly approach to Lie coalgebras through graph coalgebras, which are new and likely to be of independent interest. Our graph coalgebraic approach has advantages both in finding relations…
We present new combinatorial objects, which we call grid-labelled graphs, and show how these can be used to represent the quantum states arising in a scenario which we refer to as the faulty emitter scenario: we have a machine designed to…