In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
The agreement problem is studied whereby a group of mobile agents achieves convergence to a common point. A hierarchical cyclic pursuit scheme is introduced, and it is shown that ...
Stephen L. Smith, Mireille E. Broucke, Bruce A. Fr...
Repetitive processes are a distinct class of 2D systems (i.e. information propagation in two independent directions) of both systems theoretic and applications interest. They cann...
Bartlomiej Sulikowski, Krzysztof Galkowski, Eric R...
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in dif...
: The guarantee of feasibility given feasibility at initial time is an issue that has been overlooked by many of the recent papers on stochastic model predictive control. Effective...
Basil Kouvaritakis, Mark Cannon, Sasa V. Rakovic, ...