Summers, Tyler H.
Permanent URI for this collectionhttps://hdl.handle.net/10735.1/6600
Tyler Summers is an Assistant Professor in the Department of Electrical and Computer Engineering. He also serves as the Principal Investigator of the Control Optimization and Networks Lab. In 2017 he was awarded a $350,000 grant from the U.S. Army's Young Investigator Program to study the best ways to connect sensors and actuators into networks. His research interests include:
- Control and optimization
- Power and energy networks
- Distributed robotics
Browse
Browsing Summers, Tyler H. by Subject "Actuators"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item Algorithms for Joint Sensor and Control Nodes Selection in Dynamic Networks(Elsevier Ltd, 2019-05-17) Nugroho, S. A.; Taha, A. F.; Gatsis, N.; Summers, Tyler H.; Krishnan, R.; Summers, Tyler H.The problem of placing or selecting sensors and control nodes plays a pivotal role in the operation of dynamic networks. This paper proposes optimal algorithms and heuristics to solve the Simultaneous Sensor and Actuator Selection Problem (SSASP) in linear dynamic networks. In particular, a sufficiency condition of static output feedback stabilizability is used to obtain the minimal set of sensors and control nodes needed to stabilize an unstable network. We then show that SSASP can be written as a mixed-integer nonconvex problem. To solve this nonconvex combinatorial problem, three methods based on (i) mixed-integer nonlinear programming, (ii) binary search algorithms, and (iii) simple heuristics are proposed. The first method yields optimal solutions to SSASP—given that some constants are appropriately selected. The second method requires a database of binary sensor/actuator combinations, returns optimal solutions, and necessitates no tuning parameters. The third approach is a heuristic that yields suboptimal solutions but is computationally attractive. The theoretical properties of these methods are discussed and numerical tests on dynamic networks showcase the trade-off between optimality and computational time. ©2019 Elsevier Ltd. All Rights Reserved.Item Performance Bounds for Optimal Feedback Control in Networks(Institute of Electrical and Electronics Engineers Inc.) Summers, Tyler H.; Ruths, Justin; Summers, Tyler H.; Ruths, JustinMany important complex networks, including critical infrastructure and emerging industrial automation systems, are becoming increasingly intricate webs of interacting feedback control loops. A fundamental concern is to quantify the control properties and performance limitations of the network as a function of its dynamical structure and control architecture. We study performance bounds for networks in terms of optimal feedback control costs. We provide a set of complementary bounds as a function of the system dynamics and actuator structure. For unstable network dynamics, we characterize a tradeoff between feedback control performance and the number of control inputs, in particular showing that optimal cost can increase exponentially with the size of the network. We also derive a bound on the performance of the worst-case actuator subset for stable networks, providing insight into dynamics properties that affect the potential efficacy of actuator selection. We illustrate our results with numerical experiments that analyze performance in regular and random networks. ©2018 AACC.Item Simultaneous Sensor and Actuator Selection/Placement through Output Feedback Control(Institute of Electrical and Electronics Engineers Inc.) Nugroho, S.; Taha, A. F.; Summers, Tyler H.; Gatsis, N.; Summers, Tyler H.In most dynamic networks, it is impractical to measure all of the system states; instead, only a subset of the states are measured through sensors. Consequently, and unlike full state feedback controllers, output feedback control utilizes only the measured states to obtain a stable closed-loop performance. This paper explores the interplay between the selection of minimal number of sensors and actuators (SaA) that yield a stable closed-loop system performance. Through the formulation of the static output feedback control problem, we show that the simultaneous selection of minimal set of SaA is a combinatorial optimization problem with mixed-integer nonlinear matrix inequality constraints. To address the computational complexity, we develop two approaches: The first approach relies on integer/disjunctive programming principles, while the second approach is a simple algorithm that is akin to binary search routines. The optimality of the two approaches is also discussed. Numerical experiments are included showing the performance of the developed approaches. © 2018 AACC.