Daniel Fullmer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Daniel Fullmer has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- A. Stephen Morse
Yale University
3 shared publications - Fengjiao Liu
School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, GA, USA
1 shared publication Lili Wang
1 shared publication- Lili Wang
Southern University of Science and Technology
1 shared publication
Latest Publications
- 22 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (12) , 7164-7178
Distributed Feedback Control of Multichannel Linear Systems
In this paper it is established that any jointly controllable, jointly observable, multi-channel, discrete or continuous time linear system with a strongly connected neighbor communication graph can be exponentially stabilized with any pre-specified convergence rate using a time-invariant distributed linear control. As an illustration of how this finding can be used to deal with certain distributed tracking problems, a solution is given to a distributed set-point control problem for a continuous-time, multi-channel linear system in which each and every agent with access to the system is able to independently adjust its scalar-valued, controlled output to any desired set-point value. To better understand the constraints on controller design, the distributed control problem is recast as a classical decentralized control problem. Armed with the tools of decentralized control, including the notion of a “fixed spectrum”, it is possible to show quite surprisingly that if the only information each agent is allowed to share with its neighbors is its measured output, then distributed stabilization in some cases is impossible. Using well-known decentralized control concepts, lower bounds are derived on the dimensions of the shared sub-states of local controllers which, if satisfied, guarantee that there will be no fixed closed-loop system eigenvalues to contend with. The decentralized control perspective also enables one to assert definitively that without imposing a partitioning constraint, the closed-loop spectrum of any jointly controllable, jointly observable multi-channel linear system with a strongly connected neighbor graph, can be freely assigned with distributed feedback control. The paper then turns to the important and often overlooked design problem of dealing with the effects of transmission delays across a network. It is explained why in the face of finite delays, exponential stabilization at any prescribed convergence rate can still be achieved with distributed control, at least for discrete-time multi-channel linear systems.
- 22 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 68 (12) , 7164-7178
Distributed Feedback Control of Multichannel Linear Systems
In this paper it is established that any jointly controllable, jointly observable, multi-channel, discrete or continuous time linear system with a strongly connected neighbor communication graph can be exponentially stabilized with any pre-specified convergence rate using a time-invariant distributed linear control. As an illustration of how this finding can be used to deal with certain distributed tracking problems, a solution is given to a distributed set-point control problem for a continuous-time, multi-channel linear system in which each and every agent with access to the system is able to independently adjust its scalar-valued, controlled output to any desired set-point value. To better understand the constraints on controller design, the distributed control problem is recast as a classical decentralized control problem. Armed with the tools of decentralized control, including the notion of a “fixed spectrum”, it is possible to show quite surprisingly that if the only information each agent is allowed to share with its neighbors is its measured output, then distributed stabilization in some cases is impossible. Using well-known decentralized control concepts, lower bounds are derived on the dimensions of the shared sub-states of local controllers which, if satisfied, guarantee that there will be no fixed closed-loop system eigenvalues to contend with. The decentralized control perspective also enables one to assert definitively that without imposing a partitioning constraint, the closed-loop spectrum of any jointly controllable, jointly observable multi-channel linear system with a strongly connected neighbor graph, can be freely assigned with distributed feedback control. The paper then turns to the important and often overlooked design problem of dealing with the effects of transmission delays across a network. It is explained why in the face of finite delays, exponential stabilization at any prescribed convergence rate can still be achieved with distributed control, at least for discrete-time multi-channel linear systems.
- 31 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 63 (9) , 2833-2843
A Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions
A distributed algorithm is described for finding a common fixed point of a family of m > 1 nonlinear maps Mi : ℝ n → ℝ n assuming that each map is a paracontraction and that at least one such common fixed point exists. The common fixed point is simultaneously computed by m agents assuming each agent i knows only Mi, the current estimates of the fixed point generated by its neighbors, and nothing more. Each agent recursively updates its estimate of a fixed point by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a time-varying directed graph N(t). It is shown under suitably general conditions on N(t), that the algorithm causes all agent estimates to converge to the same common fixed point of the m nonlinear maps.
- 31 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 63 (9) , 2833-2843
A Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions
A distributed algorithm is described for finding a common fixed point of a family of m > 1 nonlinear maps Mi : ℝ n → ℝ n assuming that each map is a paracontraction and that at least one such common fixed point exists. The common fixed point is simultaneously computed by m agents assuming each agent i knows only Mi, the current estimates of the fixed point generated by its neighbors, and nothing more. Each agent recursively updates its estimate of a fixed point by utilizing the current estimates generated by each of its neighbors. Neighbor relations are characterized by a time-varying directed graph N(t). It is shown under suitably general conditions on N(t), that the algorithm causes all agent estimates to converge to the same common fixed point of the m nonlinear maps.
- 1 January 2016
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 49 (18) , 552-557
A Distributed Algorithm for Computing a Common Fixed Point of a Family of Paracontractions
- 1 January 2016
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 49 (18) , 552-557
A Distributed Algorithm for Computing a Common Fixed Point of a Family of Paracontractions