Abstract-We consider a scenario where a wind farm is given a power set point below its actual power production capacity. The objective is to dynamically redistribute power in order to minimize the fatigue loads experienced by the turbines, while maintaining the desired power production at all times. We show that this can be done in a distributed way by coordinating neighboring turbines. The result is a control scheme where both the synthesis and the resulting control law only require each turbine to communicate with a limited set of neighboring turbines.

No abstract

Abstract-In this paper a synthesis method for distributed controllers for continuous time distributed systems, is discussed. The systems considered consists of subsystems interconnected in a graph structure. This graph represents a communication structure of the system and hence governs the structure of the admissible controller, meaning that distributed controllers are considered. The objective of the synthesis is to obtain such admissible controllers that optimize a given performance. The method is scalable with respect to the size of the system and is therefore suitable for large-scale systems.Distributed controllers are suboptimal with respect to centralized ones and it is desirable to measure the amount of performance degradation. Using the variables of the synthesis scheme, it is shown how to determine such a measure of suboptimality.

This paper presents a scheme to construct distributed observers for a system consisting of agents interconnected in a graph structure. The scheme is an iterative procedure to improve the observers with respect to global performance. It is modular in the sense that each agent iterates using only local model information. As a consequence, the complexity of the scheme scales linearly with the size of the system. The resulting observers estimate states for each agent using only local measurements and model knowledge of its neighbors. Distributed observers are suboptimal to centralized ones and it is desirable to measure the amount of performance degradation. We show how to use the variables of the synthesis scheme to also determine such a measure of the suboptimality.

Abstract-We consider load balancing on a network. Servers of limited bandwidth move a single commodity through a network of buffers (or queues) while external random processes generate and consume this commodity. Our contribution is a distributed algorithm for regulating the backlogs of these queues to a given reference while balancing the mean flow in the network.We formulate this as a fluid buffer regulation problem and use distributed gradient descent to update the feedback gains for an LQG controller. Our proposed distributed algorithm both implicitly and explicitly estimates the statistics of the external process flows using only local information on fixed time intervals and updates the feedback matrix for the regulator accordingly.We demonstrate our method on a simulation of an industrial floor where autonomous vehicles remove palettes from production line buffers.