Related papers: Control Energy of Lattice Graphs
The literature on continuous-time stochastic optimal control seldom deals with the case of discrete state spaces. In this paper, we provide a general framework for the optimal control of continuous-time Markov chains on finite graphs. In…
We extend a previously studied lattice model of particles with infinite repulsions to the case of finite energy interactions. The phase diagram is studied using grand canonical Monte Carlo simulation. Simulations of dynamical phenomena are…
We consider the Chance Constrained Model Predictive Control problem for polynomial systems subject to disturbances. In this problem, we aim at finding optimal control input for given disturbed dynamical system to minimize a given cost…
Optimization problems over dynamic networks have been extensively studied and widely used in the past decades to formulate numerous real-world problems. However, (1) traditional optimization-based approaches do not scale to large networks,…
A common goal in the control of a large network is to minimize the number of driver nodes or control inputs. Yet, the physical determination of control signals and the properties of the resulting control trajectories remain widely…
We consider a dynamical system consisting of subsystems indexed by a lattice. Each subsystem has one conserved degree of freedom ("energy") the rest being uniformly hyperbolic. The subsystems are weakly coupled together so that the sum of…
In this paper we consider the problem of the optimal control of an ensemble of affine-control systems. After proving the well-posedness of the minimization problem under examination, we establish a $\Gamma$-convergence result that allows us…
Real-world network systems are inherently dynamic, with network topologies undergoing continuous changes over time. Previous works often focus on static networks or rely on complete prior knowledge of evolving topologies, whereas real-world…
This paper deals with the reconstruction of the desired demand in an optimal control problem, stated over a tree-shaped transportation network which is governed by a linear hyperbolic conservation law. As desired demands typically undergo…
We study the minimum energy null-controllability problem for differential equations with point-wise delays. For the equations of both neutral and retarded type we reduce the problem of finding the optimal control to a Volterra integral…
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…
A major application of the mathematical concept of graph in quantum mechanics is to model networks of electrical wires or electromagnetic wave-guides. In this paper, we address the dynamics of a particle trapped on such a network in…
The complexity of highly interconnected systems is rooted in the interwoven architecture defined by its connectivity structure. In this paper, we develop matrix energy of the underlying connectivity structure as a measure of topological…
This paper offers an integrative data-driven physics-inspired approach to model and control traffic congestion in a resilient and efficient manner. While existing physics-based approaches commonly assign density and flow traffic states by…
In the freeway network control (FNC) problem, the operation of a traffic network is optimized using only flow control. For special cases of the FNC problem, in particular the case when all merging flows are controlled, there exist tight…
In this report, we consider maximal solutions to the induced bounded-degree subgraph problem and relate it to issues concerning stream control in multiple-input multiple-output (MIMO) networks. We present a new distributed algorithm that…
In this paper a new framework has been applied to the design of controllers which encompasses nonlinearity, hysteresis and arbitrary density functions of forward models and inverse controllers. Using mixture density networks, the…
This work develops power control algorithms for energy efficiency (EE) maximization (measured in bit/Joule) in wireless networks. Unlike previous related works, minimum-rate constraints are imposed and the signal-to-interference-plus-noise…
Given a graph $G$, a subset $S$ of vertices of $G$ is an efficient dominating set ($EDS$) if $|N[v] \cap S|=1,$ for all $v\in V(G)$. A graph $G$ is efficiently dominatable if it possesses an $EDS$. The efficient domination number of G is…
The power-law behavior is ubiquitous in a majority of real-world networks, and it was shown to have a strong effect on various combinatorial, structural, and dynamical properties of graphs. For example, it has been shown that in real-life…