The eccentricity e(v) of a vertex v in a strongly connected digraph G is the maximum distance from v. The eccentricity sequence of a digraph is the list of eccentricities of its v...
The present paper is devoted to the study of average consensus problems for undirected networks of dynamic agents having communication delays. By focusing on agents with integrato...
This paper addresses a collective motion problem for a multi-agent system composed of nonholonomic vehicles. The aim of the vehicles is to achieve circular motion around a virtual...
Nicola Ceccarelli, Mauro Di Marco, Andrea Garulli,...
In this paper, we study the property of generic uniform observability for structured bilinear systems. More precisely, to check whether or not a structured bilinear system generic...
This paper consists of two parts. The first part is the development of a datadriven Kalman filter for a non-uniformly sampled multirate (NUSM) system, including identification of ...