arXiv subjects

Lorenzo Ferrari

Publications and source records attributed to Lorenzo Ferrari.

5 recordsLinked to original sources

arXiv2023

Mixed Integer Linear Program model for optimized scheduling of a vanadium redox flow battery with variable efficiencies, capacity fade, and electrolyte maintenance

Redox Flow Batteries are a promising option for large-scale stationary energy storage. The vanadium redox flow battery is the most widely commercialized system thanks to its chemical stability and performance. This work aims to optimize the scheduling of a vanadium flow battery that stores energy produced by a renewable power plant, keeping into account a thorough characterization of the battery performance, with variable efficiencies and capacity fade effects. A detailed characterization of the battery performance improves the calculation of the optimal number of cycles and revenue associated with the battery use if compared to the results obtained using simpler models, which take into account constant efficiencies and no capacity fade effects. The presented problem is nonlinear due to the functions of the battery efficiency, which depend upon charging and discharging powers and state of charge with nonlinear, non-convex correlations. The problem is linearized using convex hulls. The optimization program also calculates the progressive battery capacity fade due to undesired secondary electrochemical reactions and the economic impact of capacity restoration through periodic maintenance. The final problem is solved as a Mixed-Integer Linear Program (MILP) to guarantee the global optimality of the linearized problem. The proposed optimization model has been applied to two different case studies: a case of energy arbitrage and a case of load-shifting. The optimization results have been compared to those obtained with constant battery efficiency models, which do not consider the capacity fade effects. Results show that simpler models overestimate the optimal number of cycles of the battery and the revenue by up to 15% if they do not take into account the degradation model of the battery, and respectively up to 32% and 42% if they also assume constant efficiency for the battery.

math.OC↗

arXiv2021

A Deep Reinforcement Learning Framework for Contention-Based Spectrum Sharing

The increasing number of wireless devices operating in unlicensed spectrum motivates the development of intelligent adaptive approaches to spectrum access. We consider decentralized contention-based medium access for base stations (BSs) operating on unlicensed shared spectrum, where each BS autonomously decides whether or not to transmit on a given resource. The contention decision attempts to maximize not its own downlink throughput, but rather a network-wide objective. We formulate this problem as a decentralized partially observable Markov decision process with a novel reward structure that provides long term proportional fairness in terms of throughput. We then introduce a two-stage Markov decision process in each time slot that uses information from spectrum sensing and reception quality to make a medium access decision. Finally, we incorporate these features into a distributed reinforcement learning framework for contention-based spectrum access. Our formulation provides decentralized inference, online adaptability and also caters to partial observability of the environment through recurrent Q-learning. Empirically, we find its maximization of the proportional fairness metric to be competitive with a genie-aided adaptive energy detection threshold, while being robust to channel fading and small contention windows.

cs.IT↗

arXiv2017

An Active Sequential Xampling Detector for Spectrum Sensing

Enabling low power wireless devices to adopt Nyquist sampling at high carriers is prohibitive. In spectrum sensing, this limit calls for an analog front-end that can sweep different bands quickly, in order to use the available spectrum opportunistically. In this paper we propose a new framework that allows to optimize a sub-Nyquist sampling front-end to combine the benefits of optimum sequential sensing with those of Compressive Spectrum Sensing (CSS). The sensing strategy we propose is formulated as a sequential utility optimization problem. The utility function decreases linearly with the number of measurements (accrued to make a decision) and increases as a function of the signal components binary states. The optimization selects the best linear combinations of sub-bands to mix, in order to accrue maximum utility. The structure of the utility represents the trade-off between exploration, exploitation and risk of making an error, that is characteristic of the spectrum sensing problem. We first present the analog front-end architecture, and then map the measurement model into the abstract optimization problem proposed, and analyzed, in the remainder of the paper. We characterize the optimal policy under constraints on the sensing matrix and derive the approximation factor of the greedy approach. Numerical simulations showcase the benefits of combining opportunistic spectrum sensing with sub-Nyquist sampling.

cs.IT↗

arXiv2017

Utility Maximizing Sequential Sensing Over a Finite Horizon

We consider the problem of optimally utilizing $N$ resources, each in an unknown binary state. The state of each resource can be inferred from state-dependent noisy measurements. Depending on its state, utilizing a resource results in either a reward or a penalty per unit time. The objective is a sequential strategy governing the decision of sensing and exploitation at each time to maximize the expected utility (i.e., total reward minus total penalty and sensing cost) over a finite horizon $L$. We formulate the problem as a Partially Observable Markov Decision Process (POMDP) and show that the optimal strategy is based on two time-varying thresholds for each resource and an optimal selection rule for which resource to sense. Since a full characterization of the optimal strategy is generally intractable, we develop a low-complexity policy that is shown by simulations to offer near optimal performance. This problem finds applications in opportunistic spectrum access, marketing strategies and other sequential resource allocation problems.

eess.SY↗

arXiv2017

Convergence Results on Pulse Coupled Oscillator Protocols in Locally Connected Networks

This work provides new insights on the convergence of a locally connected network of pulse coupled oscillator (PCOs) (i.e., a bio-inspired model for communication networks) to synchronous and desynchronous states, and their implication in terms of the decentralized synchronization and scheduling in communication networks. Bio-inspired techniques have been advocated by many as fault-tolerant and scalable alternatives to produce self-organization in communication networks. The PCO dynamics in particular have been the source of inspiration for many network synchronization and scheduling protocols. However, their convergence properties, especially in locally connected networks, have not been fully understood, prohibiting the migration into mainstream standards. This work provides further results on the convergence of PCOs in locally connected networks and the achievable convergence accuracy under propagation delays. For synchronization, almost sure convergence is proved for $3$ nodes and accuracy results are obtained for general locally connected networks whereas, for scheduling (or desynchronization), results are derived for locally connected networks with mild conditions on the overlapping set of maximal cliques. These issues have not been fully addressed before in the literature.

cs.NI↗