Partitioning approach for large wind farms: active power control for optimizing power reserve

© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.Nowadays, large wind farms are expected to guarantee stability of the electrical grid contributing with ancillary services, such as frequency support. To this end, wind farm controllers must set the power generation of each turbine to compensate generation and demand imbalances. With the aim of optimizing primary frequency support, this paper proposes a partitioning approach to split large wind farms into several disjoint subsets of turbines according to the wake propagations through the wind farm. The partitioning problem is solved as a mixed-integer multi-objective optimization problem stated to maximize the strength of the coupling among the turbines due to the wake effect. Thus, no additional information sharing related to the wake propagations needs to be considered between the subsets. Different control tasks are assigned to the local controller of each subset, such that the total power generated meets the power demanded by the grid while the power reserve for enhancing primary frequency support is maximized. Finally, as an application of the proposed model, a decentralized wind farm control strategy is designed and compared with a centralized approach.Peer ReviewedPostprint (author's final draft

Approximately Sampling Elements with Fixed Rank in Graded Posets

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for counting and uniform sampling. We show that for certain classes of posets, biased Markov chains that walk along edges of their Hasse diagrams allow us to approximately generate samples with any fixed rank in expected polynomial time. Our arguments do not rely on the typical proofs of log-concavity, which are used to construct a stationary distribution with a specific mode in order to give a lower bound on the probability of outputting an element of the desired rank. Instead, we infer this directly from bounds on the mixing time of the chains through a method we call $\textit{balanced bias}$. A noteworthy application of our method is sampling restricted classes of integer partitions of $n$. We give the first provably efficient Markov chain algorithm to uniformly sample integer partitions of $n$ from general restricted classes. Several observations allow us to improve the efficiency of this chain to require $O(n^{1/2}\log(n))$ space, and for unrestricted integer partitions, expected $O(n^{9/4})$ time. Related applications include sampling permutations with a fixed number of inversions and lozenge tilings on the triangular lattice with a fixed average height.Comment: 23 pages, 12 figure

Random sampling of plane partitions

This article presents uniform random generators of plane partitions according to the size (the number of cubes in the 3D interpretation). Combining a bijection of Pak with the method of Boltzmann sampling, we obtain random samplers that are slightly superlinear: the complexity is $O(n (\ln n)^3)$ in approximate-size sampling and $O(n^{4/3})$ in exact-size sampling (under a real-arithmetic computation model). To our knowledge, these are the first polynomial-time samplers for plane partitions according to the size (there exist polynomial-time samplers of another type, which draw plane partitions that fit inside a fixed bounding box). The same principles yield efficient samplers for $(a\times b)$-boxed plane partitions (plane partitions with two dimensions bounded), and for skew plane partitions. The random samplers allow us to perform simulations and observe limit shapes and frozen boundaries, which have been analysed recently by Cerf and Kenyon for plane partitions, and by Okounkov and Reshetikhin for skew plane partitions.Comment: 23 page

Singular measures in circle dynamics

Critical circle homeomorphisms have an invariant measure totally singular with respect to the Lebesgue measure. We prove that singularities of the invariant measure are of Holder type. The Hausdorff dimension of the invariant measure is less than 1 but greater than 0