Search

Motivated by the problems of charging a number of electric vehicles via limited capacity infrastructure, this article considers the problem of individual load adjustment under a total capacity constraint. For reasons of scalability and simplified communications, distributed solutions to this problem are sought. Borrowing from communication networks (AIMD algorithms) and distributed convex optimisation, we describe a number of distributed algorithms for achieving relative average fairness whilst maximising utilisation. We present analysis and simulation results to show the performance of these algorithms. In the scenarios examined, the algorithm's performance is typically within 5% of that achievable in the ideal centralised case, but with greatly enhanced scalability and reduced communication requirements. [ABSTRACT FROM PUBLISHER]

Inspired by the ability of Markov chains to model complex dynamics and handle large volumes of data in Google's PageRank algorithm, a similar approach is proposed here to model road network dynamics. The central component of the Markov chain is the transition matrix which can be completely constructed by easily collecting traffic data. The proposed model is validated using the popular mobility simulator SUMO. Markov chain theory and spectral analysis of the transition matrix are then shown to reveal non-evident properties of the underlying road network and to correctly predict consequences of road network modifications. Preliminary results from possible applications are shown and simple practical examples are provided throughout this article to clarify and support the theoretical expectations. [ABSTRACT FROM AUTHOR]

This article introduces the use of R-functions to compose single Lyapunov functions (LFs) via classic Boolean operators, with the aim to obtain a rich family of non-conventional, generally non-convex functions. The main benefit of the proposed composition is the nice geometric interpretation, since it corresponds to intersection and union operations in the phase space region. The composition of LFs is parameterised through a variable γ and classic compositions of LFs through min and max operations are recovered as a special case for a particular value of γ. The proposed logical composition is applied to region of asymptotic stability (RAS) estimation problems, where the union of several LFs corresponds to the union of the RAS estimates obtained from the separate use of each LF. Likewise, the intersection of several LFs defined on independent subsets of the state space variables provides a single LF for the overall dynamical system. Sufficient conditions for the composition function to be an LF are provided and results are described through several examples of classic nonlinear dynamical systems. [ABSTRACT FROM AUTHOR]

A class of algorithms for approximation of the maximum entropy estimate of probability density functions on the basis of a finite number of sampled data is introduced. The algorithms are presented as a finite sequence in order of increasing accuracy and decreasing computational efficiency in which the last element of the sequence is the exact maximum entropy estimate. Numerical and applicative examples are reported. [ABSTRACT FROM AUTHOR]

Random walks on graphs are often used to analyse and predict epidemic spreads and to investigate possible control actions to mitigate them. In this study, we first show that models based on random walks with a single stochastic agent (such as Google's popular PageRank) may provide a poor description of certain features of epidemic spread: most notably, spreading times. Then, we discuss another Markov chain based method that does reflect the correct mean infection times for the disease to spread between individuals in a network, and we determine a procedure that allows one to compute them efficiently via a sampling strategy. Finally, we present a novel centrality measure based on infection times, and we compare its node ranking properties with other centrality measures based on random walks. Our results are provided for a simple SI model for epidemic spreading., Competing Interests: The authors have declared that no competing interests exist., (Copyright: © 2023 Kim et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.)

The recent uptake in popularity in vehicles with zero tailpipe emissions is a welcome development in the fight against traffic induced airborne pollutants. As vehicle fleets become electrified, and tailpipe emissions become less prevalent, non-tailpipe emissions (from tires and brake disks) will become the dominant source of traffic related emissions, and will in all likelihood become a major concern for human health. This trend is likely to be exacerbated by the heavier weight of electric vehicles, their increased power, and their increased torque capabilities, when compared with traditional vehicles. While the problem of emissions from tire wear is well-known, issues around the process of tire abrasion, its impact on the environment, and modelling and mitigation measures, remain relatively unexplored. Work on this topic has proceeded in several discrete directions including: on-vehicle collection methods; vehicle tire-wear abatement algorithms and controlling the ride characteristics of a vehicle, all with a view to abating tire emissions. Additional approaches include access control mechanisms to manage aggregate tire emissions in a geofenced area with other notable work focussing on understanding the particle size distribution of tire generated PM, the degree to which particles become airborne, and the health impacts of tire emissions. While such efforts are already underway, the problem of developing models to predict the aggregate picture of a network of vehicles at the scale of a city, has yet to be considered. Our objective in this paper is to present one such model, built using ideas from Markov chains. Applications of our modelling approach are given toward the end of this note, both to illustrate the utility of the proposed method, and to illustrate its application as part of a method to collect tire dust particles., Competing Interests: The authors have declared that no competing interests exist.

In this paper, a novel and flexible solution for fault prediction based on data collected from Supervisory Control and Data Acquisition (SCADA) system is presented. Generic fault/status prediction is offered by means of a data driven approach based on a self-organizing map (SOM) and the definition of an original Key Performance Indicator (KPI). The model has been assessed on a park of three photovoltaic (PV) plants with installed capacity up to 10 MW, and on more than sixty inverter modules of three different technology brands. The results indicate that the proposed method is effective in predicting incipient generic faults in average up to 7 days in advance with true positives rate up to 95%. The model is easily deployable for on-line monitoring of anomalies on new PV plants and technologies, requiring only the availability of historical SCADA data, fault taxonomy and inverter electrical datasheet.

COVID-19 abatement strategies have risks and uncertainties which could lead to repeating waves of infection. We show-as proof of concept grounded on rigorous mathematical evidence-that periodic, high-frequency alternation of into, and out-of, lockdown effectively mitigates second-wave effects, while allowing continued, albeit reduced, economic activity. Periodicity confers (i) predictability, which is essential for economic sustainability, and (ii) robustness, since lockdown periods are not activated by uncertain measurements over short time scales. In turn-while not eliminating the virus-this fast switching policy is sustainable over time, and it mitigates the infection until a vaccine or treatment becomes available, while alleviating the social costs associated with long lockdowns. Typically, the policy might be in the form of 1-day of work followed by 6-days of lockdown every week (or perhaps 2 days working, 5 days off) and it can be modified at a slow-rate based on measurements filtered over longer time scales. Our results highlight the potential efficacy of high frequency switching interventions in post lockdown mitigation. All code is available on Github at https://github.com/V4p1d/FPSP_Covid19. A software tool has also been developed so that interested parties can explore the proof-of-concept system., Competing Interests: The authors have declared that no competing interests exist.

The recent COVID-19 outbreak has motivated an extensive development of non-pharmaceutical intervention policies for epidemics containment. While a total lockdown is a viable solution, interesting policies are those allowing some degree of normal functioning of the society, as this allows a continued, albeit reduced, economic activity and lessens the many societal problems associated with a prolonged lockdown. Recent studies have provided evidence that fast periodic alternation of lockdown and normal-functioning days may effectively lead to a good trade-off between outbreak abatement and economic activity. Nevertheless, the correct number of normal days to allocate within each period in such a way to guarantee the desired trade-off is a highly uncertain quantity that cannot be fixed a priori and that must rather be adapted online from measured data. This adaptation task, in turn, is still a largely open problem, and it is the subject of this work. In particular, we study a class of solutions based on hysteresis logic. First, in a rather general setting, we provide general convergence and performance guarantees on the evolution of the decision variable. Then, in a more specific context relevant for epidemic control, we derive a set of results characterizing robustness with respect to uncertainty and giving insight about how a priori knowledge about the controlled process may be used for fine-tuning the control parameters. Finally, we validate the results through numerical simulations tailored on the COVID-19 outbreak., Competing Interests: The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (© 2021 The Author(s).)

Testing, tracking and tracing abilities have been identified as pivotal in helping countries to safely reopen activities after the first wave of the COVID-19 virus. Contact tracing apps give the unprecedented possibility to reconstruct graphs of daily contacts, so the question is: who should be tested? As human contact networks are known to exhibit community structure, in this paper we show that the Kemeny constant of a graph can be used to identify and analyze bridges between communities in a graph. Our 'Kemeny indicator' is the value of the Kemeny constant in the new graph that is obtained when a node is removed from the original graph. We show that testing individuals who are associated with large values of the Kemeny indicator can help in efficiently intercepting new virus outbreaks, when they are still in their early stage. Extensive simulations provide promising results in early identification and in blocking the possible 'super-spreaders' links that transmit disease between different communities., Competing Interests: The authors have declared that no competing interests exist.