Searcharxiv⌕ Search

arXiv subjects

Sengiyumva Kisole

Publications and source records attributed to Sengiyumva Kisole.

4 recordsLinked to original sources

State-Dependent Delay Modeling of Wind-Farm Wake Dynamics

Turbines convert wind to electrical power. In the wake of a turbine, wind speed is reduced in proportion to the amount of power extracted. In a wind farm, downstream turbines may be located in wake of an upstream turbine, requiring coordination to yield maximum power generation. This paper creates a state-dependent delay model for a two turbine wind farm. The upstream turbine creates a wake that diminishes the wind speed at the downstream turbine. Changing the upstream turbine operation will affect the downstream turbine after a delay that depends on the wind-propagation time between them. This delay depends on the upstream power extraction and it can destabilize the combined dynamics. Conventional models of this effect rely on nonlinear partial differential equations (PDEs). Control design and analysis with such models is difficult with established methods. We first show that the PDE model can be represented by an Abel-type state-dependent delay differential equation. The equation has an implicit solution. To obtain an explicit representation, we then introduce a simplified state-dependent delay model. Both models predict destabilizing interactions between the two turbines. Numerical examples illustrate delay-induced oscillations using the simplified model and verify their effectiveness in simulation.

eess.SY↗

Parameterization of Seed Functions for Equivalent Representations of Time-Varying Delay Systems

Abel's classic transformation shows that any well-posed system with time-varying delay is equivalent to a parameter-varying system with fixed delay. The existence of such a parameter-varying constant delay representation then simplifies the problems of stability analysis and optimal control. Unfortunately, the method for construction of such transformations has been ad-hoc -- requiring an iterative time-stepping approach to constructing the transformation beginning with a seed function subject to boundary-value constraints. Moreover, a poor choice of seed function often results in a constant delay representation with large time-variations in system parameters -- obviating the benefits of such a representation. In this paper, we show how the set of all feasible seed functions can be parameterized using a basis for $L_2$. This parameterization is then used to search for seed functions for which the corresponding time-transformation results in smaller parameter variation. The parameterization of admissible seed functions is illustrated with numerical examples that contrast how well-chosen and poorly chosen seed functions affect the boundedness of a time transformation.

math.OC↗

Time-Transformation-Based Analysis of Systems with Periodic Delay via Perturbative Expansion

It is difficult to analyze the stability of systems with time-varying delays. One approach is to construct a time-transformation that converts the system into a form with a constant delay but with a time-varying scalar appearing in the system matrices. The stability of this transformed system can then be analyzed using methods to bound the effect of the time-varying scalar. One issue is that this transformation is non-unique and requires the solution of an Abel equation. A specific time-transformation typically must be computed numerically. We address this issue by computing an explicit, although approximate, time-transformation for systems where the delay has a constant plus small periodic term. We use a perturbative expansion to construct our explicit solutions. We provide a simple numerical example to illustrate the approach. We also demonstrate the use of this time-transformation to analyze stability of the system with this class of periodic delays.

eess.SY↗

Bounding the Settling Time of Finite-Time Stable Systems using Sum of Squares

Finite-time stability (FTS) of a differential equation guarantees that solutions reach a given equilibrium point in finite time, where the time of convergence depends on the initial state of the system. For traditional stability notions such as exponential stability, the convex optimization framework of Sum-of-Squares (SoS) enables computation of polynomial Lyapunov functions to certify stability. However, finite-time stable systems are characterized by non-Lipschitz, non-polynomial vector fields, rendering standard SoS methods inapplicable. To this end, we show that computation of a non-polynomial Lyapunov function certifying finite-time stability can be reformulated as feasibility of a set of polynomial inequalities under a particular transformation. As a result, SoS can be utilized to verify FTS and obtain a bound on the settling time. Numerical examples are used to demonstrate the accuracy of the conditions in both certifying finite-time stability and bounding the settling time.

math.OC↗