SearcharxivSearch

arXiv subjects

Suat Gumussoy

Publications and source records attributed to Suat Gumussoy.

At least 19 recordsLinked to original sources

Learning Emergence of Interaction Patterns across Independent RL Agents in Multi-Agent Environments

Many real-world problems, such as controlling swarms of drones and urban traffic, naturally lend themselves to modeling as multi-agent reinforcement learning (RL) problems. However, existing multi-agent RL methods often suffer from scalability challenges, primarily due to the introduction of communication among agents. Consequently, a key challenge lies in adapting the success of deep learning in single-agent RL to the multi-agent setting. In response to this challenge, we propose an approach that fundamentally reimagines multi-agent environments. Unlike conventional methods that model each agent individually with separate networks, our approach, the Bottom Up Network (BUN), adopts a unique perspective. BUN treats the collective of multi-agents as a unified entity while employing a specialized weight initialization strategy that promotes independent learning. Furthermore, we dynamically establish connections among agents using gradient information, enabling coordination when necessary while maintaining these connections as limited and sparse to effectively manage the computational budget. Our extensive empirical evaluations across a variety of cooperative multi-agent scenarios, including tasks such as cooperative navigation and traffic control, consistently demonstrate BUN's superiority over baseline methods with substantially reduced computational costs.

cs.MA

Certifying Stability and Performance of Uncertain Differential-Algebraic Systems: A Dissipativity Framework

This paper presents a novel framework for characterizing dissipativity of uncertain systems whose dynamics evolve according to differential-algebraic equations. Sufficient conditions for dissipativity (specializing to, e.g., stability or $L_2$ gain bounds) are provided in the case that uncertainties are characterized by integral quadratic constraints. For polynomial or linear dynamics, these conditions can be efficiently verified through sum-of-squares or semidefinite programming. Performance analysis of the IEEE 39-bus power network with a set of potential line failures modeled as an uncertainty set provides an illustrative example that highlights the computational tractability of this approach; conservatism introduced in this example is shown to be quite minimal.

eess.SY

Grouping of $N-1$ Contingencies for Controller Synthesis: A Study for Power Line Failures

The problem of maintaining power system stability and performance after the failure of any single line in a power system (an "N-1 contingency") is investigated. Due to the large number of possible N-1 contingencies for a power network, it is impractical to optimize controller parameters for each possible contingency a priori. A method to partition a set of contingencies into groups of contingencies that are similar to each other from a control perspective is presented. Design of a single controller for each group, rather than for each contingency, provides a computationally tractable method for maintaining stability and performance after element failures. The choice of number of groups tunes a trade-off between computation time and controller performance for a given set of contingencies. Results are simulated on the IEEE 39-bus and 68-bus systems, illustrating that, with controllers designed for a relatively small number of groups, power system stability may be significantly improved after an N-1 contingency compared to continued use of the nominal controller. Furthermore, performance is comparable to that of controllers designed for each contingency individually.

eess.SY

PD-MORL: Preference-Driven Multi-Objective Reinforcement Learning Algorithm

Multi-objective reinforcement learning (MORL) approaches have emerged to tackle many real-world problems with multiple conflicting objectives by maximizing a joint objective function weighted by a preference vector. These approaches find fixed customized policies corresponding to preference vectors specified during training. However, the design constraints and objectives typically change dynamically in real-life scenarios. Furthermore, storing a policy for each potential preference is not scalable. Hence, obtaining a set of Pareto front solutions for the entire preference space in a given domain with a single training is critical. To this end, we propose a novel MORL algorithm that trains a single universal network to cover the entire preference space scalable to continuous robotic tasks. The proposed approach, Preference-Driven MORL (PD-MORL), utilizes the preferences as guidance to update the network parameters. It also employs a novel parallelization approach to increase sample efficiency. We show that PD-MORL achieves up to 25% larger hypervolume for challenging continuous control tasks and uses an order of magnitude fewer trainable parameters compared to prior approaches.

cs.LG

SSD -- Software for Systems with Delays: Reproducible Examples and Benchmarks on Model Reduction and H2 Norm Computation

We present SSD, Software for Systems with Delays, a de novo MATLAB package for the analysis and model reduction of retarded time delay systems (RTDS). Underneath, our delay system object bridges RTDS representation and Linear Fractional Transformation (LFT) representation of MATLAB. This allows seamless use of many available visualizations of MATLAB. In addition, we implemented a set of key functionalities such as H2 norm and system gramian computations, balanced realization and reduction by direct integral definitions and utilizing sparse computation. As a theoretical contribution, we extend the frequency-limited balanced reduction to delay systems first time, propose a computational algorithm and give its implementation. We collected two sets of benchmark problems on H2 norm computation and model reduction. SSD is publicly available in GitHub at https://github.com/gumussoysuat/ssd. Our reproducible paper and two benchmark collections are shared as executable notebooks.

math.OC

Hypervector Design for Efficient Hyperdimensional Computing on Edge Devices

Hyperdimensional computing (HDC) has emerged as a new light-weight learning algorithm with smaller computation and energy requirements compared to conventional techniques. In HDC, data points are represented by high-dimensional vectors (hypervectors), which are mapped to high-dimensional space (hyperspace). Typically, a large hypervector dimension ($\geq1000$) is required to achieve accuracies comparable to conventional alternatives. However, unnecessarily large hypervectors increase hardware and energy costs, which can undermine their benefits. This paper presents a technique to minimize the hypervector dimension while maintaining the accuracy and improving the robustness of the classifier. To this end, we formulate the hypervector design as a multi-objective optimization problem for the first time in the literature. The proposed approach decreases the hypervector dimension by more than $32\times$ while maintaining or increasing the accuracy achieved by conventional HDC. Experiments on a commercial hardware platform show that the proposed approach achieves more than one order of magnitude reduction in model size, inference time, and energy consumption. We also demonstrate the trade-off between accuracy and robustness to noise and provide Pareto front solutions as a design parameter in our hypervector design.

cs.LG

Transfer Learning for Human Activity Recognition using Representational Analysis of Neural Networks

Human activity recognition (HAR) research has increased in recent years due to its applications in mobile health monitoring, activity recognition, and patient rehabilitation. The typical approach is training a HAR classifier offline with known users and then using the same classifier for new users. However, the accuracy for new users can be low with this approach if their activity patterns are different than those in the training data. At the same time, training from scratch for new users is not feasible for mobile applications due to the high computational cost and training time. To address this issue, we propose a HAR transfer learning framework with two components. First, a representational analysis reveals common features that can transfer across users and user-specific features that need to be customized. Using this insight, we transfer the reusable portion of the offline classifier to new users and fine-tune only the rest. Our experiments with five datasets show up to 43% accuracy improvement and 66% training time reduction when compared to the baseline without using transfer learning. Furthermore, measurements on the Nvidia Jetson Xavier-NX hardware platform reveal that the power and energy consumption decrease by 43% and 68%, respectively, while achieving the same or higher accuracy as training from scratch.

eess.SP

Tuning an H-Infinity Controller with a Given Order and a Structure for Interconnected Systems with Delays

An eigenvalue based framework is developed for the H-infinity norm analysis and its norm minimization of coupled systems with time-delays, which are naturally described by delay differential algebraic equations (DDAEs). For these equations H-infinity norms are analyzed and their sensitivity with respect to small delay perturbations is studied. Subsequently, numerical methods for the H-infinity norm computation and for designing controllers minimizing the H-infinity norm with a prescribed structure or order, based on a direct optimization approach, are briefly addressed. The effectiveness of the approach is illustrated with a software demo. The chapter concludes by pointing out the similarities with the computation and optimization of characteristic roots of DDAEs.

eess.SY

An Online Learning Methodology for Performance Modeling of Graphics Processors

Approximately 18 percent of the 3.2 million smartphone applications rely on integrated graphics processing units (GPUs) to achieve competitive performance. Graphics performance, typically measured in frames per second, is a strong function of the GPU frequency, which in turn has a significant impact on mobile processor power consumption. Consequently, dynamic power management algorithms have to assess the performance sensitivity to the frequency accurately to choose the operating frequency of the GPU effectively. Since the impact of GPU frequency on performance varies rapidly over time, there is a need for online performance models that can adapt to varying workloads. This paper presents a light-weight adaptive runtime performance model that predicts the frame processing time of graphics workloads at runtime without apriori characterization. We employ this model to estimate the frame time sensitivity to the GPU frequency, i.e., the partial derivative of the frame time with respect to the GPU frequency. The proposed model does not rely on any parameter learned offline. Our experiments on commercial platforms with common GPU benchmarks show that the mean absolute percentage error in frame time and frame time sensitivity prediction are 4.2 and 6.7 percent, respectively.

eess.SY

Eigenvalue based algorithms and software for the design of fixed-order stabilizing controllers for interconnected systems with time-delays

An eigenvalue based framework is developed for the stability analysis and stabilization of coupled systems with time-delays, which are naturally described by delay differential algebraic equations. The spectral properties of these equations are analyzed and their stability properties are studied, taking into account the effect of small delay perturbations. Subsequently, numerical methods for stability assessment and for designing stabilizing controllers with a prescribed structure or order, based on a direct optimization approach, are briefly addressed. The effectiveness of the approach is illustrated with a software demo. The paper concludes by pointing out the similarities with the computation and optimization of H-infinity norms.

eess.SY

Computer Aided Control System Design for Time Delay Systems using MATLAB

Computer Aided Control System Design (CACSD) allows to analyze complex interconnected systems and design controllers achieving challenging control requirements. We extend CACSD to systems with time delays and illustrate the functionality of Control System Toolbox in MATLAB for such systems. We easily define systems in time and frequency domain system representations and build the overall complex system by interconnecting subsystems. We analyze the overall system in time and frequency domains and design PID controllers satisfying design requirements. Various visualization tools are used for analysis and design verification. Our goal is to introduce these functionalities to researchers and engineers and to discuss the open directions in computer algorithms for control system design.

eess.SY

Fixed-Order H-infinity Optimization of Time-Delay Systems

H-infinity controllers are frequently used in control theory due to their robust performance and stabilization. Classical H-infinity controller synthesis methods for finite dimensional LTI MIMO plants result in high-order controllers for high-order plants whereas low-order controllers are desired in practice. We design fixed-order H-infinity controllers for a class of time-delay systems based on a non-smooth, non-convex optimization method and a recently developed numerical method for H-infinity norm computations.

eess.SY

Analysis and Control of Power-Temperature Dynamics in Heterogeneous Multiprocessors

Virtually all electronic systems try to optimize a fundamental trade-off between higher performance and lower power consumption. The latter becomes critical in mobile computing systems, such as smartphones, which rely on passive cooling. Otherwise, the heat concentrated in a small area drives both the junction and skin temperatures up. High junction temperatures degrade the reliability, while skin temperature deteriorates the user experience. Therefore, there is a strong need for a formal analysis of power consumption-temperature dynamics and predictive thermal management algorithms. This paper presents a theoretical power-temperature analysis of multiprocessor systems, which are modeled as multi-input multi-output dynamic systems. We analyze the conditions under which the system converges to a stable steady-state temperature. Then, we use these models to design a control algorithm that manages the temperature of the system without affecting the performance of the application. Experiments on the Odroid-XU3 board show that the control algorithm is able to regulate the temperature with a minimal loss in performance when compared to the default thermal governors.

eess.SY

Coprime Inner/Outer Factorization of SISO Time-Delay Systems and FIR Structure of Their Optimal H-Infinity Controllers

The approach in Foias et al. (1996) is one of the well-developed methods to design H-infinity controllers for general infinite dimensional systems. This approach is applicable if the plant admits a special coprime inner/outer factorization. We give the largest class of single-input-single-output (SISO) time delay systems for which this factorization is possible and factorize the admissible plants. Based on this factorization, we compute the optimal H-infinity performance and eliminate unstable pole-zero cancellations in the optimal H-infinity controller. We extend the results on the finite impulse response (FIR) structure of optimal H-infinity controllers by showing that this structure appears not only for plants with input/output (I/O) delays, but also for general SISO time-delay plants.

eess.SY

Computation of Extremum Singular Values and the Strong H-infinity Norm of SISO Time-Delay Systems

We consider the computation of H-infinity norms for Single-Input-Single-Output (SISO) time-delay systems, which are described by delay differential algebraic equations. Unlike the iterative level set methods in the literature, we present a novel numerical method to compute the H-infinity norm. This method requires solving one eigenvalue problem of at most twice the size of the eigenvalue problem in every iteration of a level set method, but in practice often considerably lower. We first show that the computation of extrema of the transfer function can be turned into the computation of the imaginary axis zeros of a transcendental function. We compute these zeros by a predictor-corrector type algorithm. It is known that the H-infinity norm of delay differential algebraic systems, which can model both retarded and neutral type systems, might be sensitive with respect to arbitrarily small delay perturbations. This recently led to the concept of strong H-infinity norms, which explicitly take into account such small delay perturbations. We present a direct numerical method to compute the strong H-infinity norm of SISO time-delay systems. Our algorithm is applicable to the closed-loop system of interconnections (series, parallel, feedback, junctions) of time-delay systems and/or controllers.

eess.SY

Root Locus for SISO Dead-Time Systems: A Continuation Based Approach

We present a numerical method to plot the root locus of Single-Input-Single-Output (SISO) dead-time systems with respect to the controller gain or the system delay. We compute the trajectories of characteristic roots of the closed-loop system on a prescribed complex right half-plane. We calculate the starting, branch and boundary crossing roots of root-locus branches inside the region. We compute the root locus of each characteristic root based on a predictor-corrector type continuation method. To avoid the high sensitivity of roots with respect to the locus parameter in the neighborhood of branch points, the continuation method relies on a natural parameterization of the root-locus trajectory in terms of a distance in the (characteristic root, locus parameter)-space. The method is numerically stable for high order SISO dead-time systems.

eess.SY

Sensitivity Minimization by Strongly Stabilizing Controllers for a Class of Unstable Time-Delay Systems

Weighted sensitivity minimization is studied within the framework of strongly stabilizing (stable) H-infinity controller design for a class of infinite dimensional systems. This problem has been solved by Ganesh and Pearson, [11], for finite dimensional plants using Nevanlinna-Pick interpolation. We extend their technique to a class of unstable time delay systems. Moreover, we illustrate suboptimal solutions, and their robust implementation.

eess.SY

Fixed-order H-infinity control for interconnected systems using delay differential algebraic equations

We analyze and design H-infinity controllers for general time-delay systems with time-delays in systems' state, inputs and outputs. We allow the designer to choose the order of the controller and to introduce constant time-delays in the controller. The closed-loop system of the plant and the controller is modeled by a system of delay differential algebraic equations (DDAEs). The advantage of the DDAE modeling framework is that any interconnection of systems and controllers prone to various types of delays can be dealt with in a systematic way, without using any elimination technique. We present a predictor-correct algorithm for the H-infinity norm computation of systems described by DDAEs. Instrumental to this we analyze the properties of the H-infinity norm. In particular, we illustrate that it may be sensitive with respect to arbitrarily small delay perturbations. Due to this sensitivity, we introduce the strong H-infinity norm which explicitly takes into account small delay perturbations, inevitable in any practical control application. We present a numerical algorithm to compute the strong H-infinity norm for DDAEs. Using this algorithm and the computation of the gradient of the strong H-infinity norm with respect to the controller parameters, we minimize the strong H-infinity norm of the closed-loop system based on non-smooth, non-convex optimization methods. By this approach, we tune the controller parameters and design H-infinity controllers with a prescribed order or structure.

eess.SY