Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Cesar O. Aguilar"'
Publikováno v:
Linear Algebra and its Applications. 588:210-223
The purpose of this paper is to highlight the role played by the anti-regular graph within the class of threshold graphs. Using the fact that every threshold graph contains a maximal anti-regular graph, we show that some known results, and new ones,
Publikováno v:
Linear Algebra and its Applications. 557:84-104
We study the eigenvalues of the unique connected anti-regular graph $A_n$. Using Chebyshev polynomials of the second kind, we obtain a trigonometric equation whose roots are the eigenvalues and perform elementary analysis to obtain an almost complete
Autor:
Bahman Gharesifard, Cesar O. Aguilar
Publikováno v:
Automatica. 80:25-31
In this paper, we consider the controllability problem for multi-agent networked control systems. The main results of the paper are new graph-theoretic necessary conditions for controllability involving almost equitable graph vertex partitions. We ge
Autor:
Cesar O. Aguilar
In this paper, we present a class of network topologies under which the Laplacian consensus dynamics exhibits undesirable controllability properties under a broadcast control signal. Specifically, the networks we characterize are uncontrollable for a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d429db7ac126d54a7979e460613f540
http://arxiv.org/abs/1911.06398
http://arxiv.org/abs/1911.06398
Autor:
Cesar O. Aguilar, Bahman Gharesifard
Publikováno v:
IEEE Transactions on Automatic Control. 60:1611-1623
In this paper, we consider the problem of obtaining graph-theoretic characterizations of controllability for the Laplacian-based leader-follower dynamics. Our developments rely on the notion of graph controllability classes, namely, the classes of es
Autor:
Cesar O. Aguilar, Bahman Gharesifard
Publikováno v:
Linear Algebra and its Applications. 471:575-586
Let G be a graph on n vertices with Laplacian matrix L and let b be a binary vector of length n. The pair ( L , b ) is controllable if the smallest L-invariant subspace containing b is of dimension n. The graph G is called essentially controllable if
Autor:
Cesar O. Aguilar, Arthur J. Krener
Publikováno v:
Journal of Optimization Theory and Applications. 160:527-552
In this paper, we present a numerical algorithm to compute high-order approximate solutions to Bellman’s dynamic programming equation that arises in the optimal stabilization of discrete-time nonlinear control systems. The method uses a patchy tech
Autor:
Cesar O. Aguilar, Bahman Gharesifard
Publikováno v:
ACC
The main contribution of this paper are two new general necessary conditions for controllability of multi-agent networked control systems involving almost equitable partitions, along with an extension of a well-known symmetry condition to weighted di
Autor:
Arthur J. Krener, Cesar O. Aguilar
Publikováno v:
International Journal of Robust and Nonlinear Control. 23:1046-1061
The solution to the nonlinear output regulation problem requires one to solve a first order PDE, known as the Francis-Byrnes-Isidori (FBI) equations. In this paper we propose a method to compute approximate solutions to the FBI equations when the zer
Autor:
Andrew D. Lewis, Cesar O. Aguilar
Publikováno v:
SIAM Journal on Control and Optimization. 50:1502-1517
The article of record as published may be found at: http://dx.doi.org/10.1137/100785892 In this paper we consider the local controllability problem for control-affine systems that are homogeneous with respect to a one-parameter family of dilations co