530 Physik
Refine
Language
- English (12) (remove)
Is part of the Bibliography
- yes (12)
Keywords
- Dynamical systems (2)
- Genetic programming (2)
- Synchronization control (2)
- Explainable AI (1)
- Hydraulic models (1)
- Hydraulic networks (1)
- Machine learning control (1)
- Maximum entropy method (1)
- Nonlinear analysis (1)
- Pipe networks (1)
Institute
The maximum entropy method is used to predict flows on water distribution networks. This analysis extends the water distribution network formulation of Waldrip et al. (2016) Journal of Hydraulic Engineering (ASCE), by the use of a continuous relative entropy defined on a reduced parameter set. This reduction in the parameters that the entropy is defined over ensures consistency between different representations of the same network. The performance of the proposed reduced parameter method is demonstrated with a one-loop network case study.
The maximum entropy method is used to derive an alternative gravity model for a transport network. The proposed method builds on previous methods which assign the discrete value of a maximum entropy distribution to equal the traffic flow rate. The proposed method however, uses a distribution to represent each flow rate. The proposed method is shown to be able to handle uncertainty in a more elegant way and give similar results to traditional methods. It is able to incorporate more of the observed data through the entropy function, prior distribution and integration limits potentially allowing better inferences to be made.
A maximum entropy (MaxEnt) method is developed to predict flow rates or pressure gradients in hydraulic pipe networks without sufficient information to give a closed-form (deterministic) solution. This methodology substantially extends existing deterministic flow network analysis methods. It builds on the MaxEnt framework previously developed by the authors. This study uses a continuous relative entropy defined on a reduced parameter set, here based on the external flow rates. This formulation ensures consistency between different representations of the same network. The relative entropy is maximized subject to observable constraints on the mean values of a subset of flow rates or potential differences, the frictional properties of each pipe, and physical constraints arising from Kirchhoff’s first and second laws. The new method is demonstrated by application to a simple one-loop network and a 1,123-node, 1,140-pipe water distribution network in the suburb of Torrens, Australian Capital Territory, Australia.
We investigate synchronization of coupled organ pipes. Synchronization and reflection in the organ lead to undesired weakening of the sound in special cases. Recent experiments have shown that sound interaction is highly complex and nonlinear, however, we show that two delay-coupled Van-der-Pol oscillators appear to be a good model for the occurring dynamical phenomena. Here the coupling is realized as distance-dependent, or time-delayed, equivalently. Analytically, we investigate the synchronization frequency and bifurcation scenarios which occur at the boundaries of the Arnold tongues. We successfully compare our results to experimental data.
Machine learning control
(2020)
Recently, the term explainable AI came into discussion as an approach to produce models from artificial intelligence which allow interpretation. For a long time, symbolic regression has been used to produce explainable and mathematically tractable models. In this contribution, we extend previous work on symbolic regression methods to infer the optimal control of a dynamical system given one or several optimization criteria, or cost functions. In earlier publications, network control was achieved by automated machine learning control using genetic programming. Here, we focus on the subsequent path continuation analysis of the mathematical expressions which result from the machine learning model. In particular, we use AUTO to analyze the solution properties of the controlled oscillator system which served as our model. As a result, we show that there is a considerable advantage of explainable symbolic regression models over less accessible neural networks. In particular, the roadmap of future works may be to integrate such analyses into the optimization loop itself to filter out robust solutions by construction.
Big data have become a critically enabling component of emerging mathematical methods aimed at the automated discovery of dynamical systems, where first principles modeling may be intractable. However, in many engineering systems, abrupt changes must be rapidly characterized based on limited, incomplete, and noisy data. Many leading automated learning techniques rely on unrealistically large data sets, and it is unclear how to leverage prior knowledge effectively to re-identify a model after an abrupt change. In this work, we propose a conceptual framework to recover parsimonious models of a system in response to abrupt changes in the low-data limit. First, the abrupt change is detected by comparing the estimated Lyapunov time of the data with the model prediction. Next, we apply the sparse identification of nonlinear dynamics (SINDy) regression to update a previously identified model with the fewest changes, either by addition, deletion, or modification of existing model terms. We demonstrate this sparse model recovery on several examples for abrupt system change detection in periodic and chaotic dynamical systems. Our examples show that sparse updates to a previously identified model perform better with less data, have lower runtime complexity, and are less sensitive to noise than identifying an entirely new model. The proposed abrupt-SINDy architecture provides a new paradigm for the rapid and efficient recovery of a system model after abrupt changes.
Many previous studies have shown that the turbulent mixing layer under periodic forcing tends to adopt a lock-on state, where the major portion of the fluctuations in the flow are synchronized at the forcing frequency. The goal of this experimental study is to apply closed-loop control in order to provoke the lock-on state, using information from the flow itself. We aim to determine the range of frequencies for which the closed-loop control can establish the lock-on, and what mechanisms are contributing to the selection of a feedback frequency. In order to expand the solution space for optimal closed-loop control laws, we use the genetic programming control (CPC) framework. The best closed-loop control laws obtained by CPC are analysed along with the associated physical mechanisms in the mixing layer flow. The resulting closed-loop control significantly outperforms open-loop forcing in terms of robustness to changes in the free-stream velocities. In addition, the selection of feedback frequencies is not locked to the most amplified local mode, but rather a range of frequencies around it.
The concept of a "flow network"-a set of nodes and links which carries one or more flows-unites many different disciplines, including pipe flow, fluid flow, electrical, chemical reaction, ecological, epidemiological, neurological, communications, transportation, financial, economic and human social networks. This Feature Paper presents a generalized maximum entropy framework to infer the state of a flow network, including its flow rates and other properties, in probabilistic form. In this method, the network uncertainty is represented by a joint probability function over its unknowns, subject to all that is known. This gives a relative entropy function which is maximized, subject to the constraints, to determine the most probable or most representative state of the network. The constraints can include "observable" constraints on various parameters, "physical" constraints such as conservation laws and frictional properties, and "graphical" constraints arising from uncertainty in the network structure itself. Since the method is probabilistic, it enables the prediction of network properties when there is insufficient information to obtain a deterministic solution. The derived framework can incorporate nonlinear constraints or nonlinear interdependencies between variables, at the cost of requiring numerical solution. The theoretical foundations of the method are first presented, followed by its application to a variety of flow networks.
We propose a novel cluster-based reduced-order modelling (CROM) strategy for unsteady flows. CROM combines the cluster analysis pioneered in Gunzburger's group (Burkardt, Gunzburger & Lee, Comput. Meth. Appl. Mech. Engng, vol. 196, 2006a, pp. 337-355) and transition matrix models introduced in fluid dynamics in Eckhardt's group (Schneider, Eckhardt & Vollmer, Phys. Rev. E, vol. 75, 2007, art. 066313). CROM constitutes a potential alternative to POD models and generalises the Ulam-Galerkin method classically used in dynamical systems to determine a finite-rank approximation of the Perron-Frobenius operator. The proposed strategy processes a time-resolved sequence of flow snapshots in two steps. First, the snapshot data are clustered into a small number of representative states, called centroids, in the state space. These centroids partition the state space in complementary non-overlapping regions (centroidal Voronoi cells). Departing from the standard algorithm, the probabilities of the clusters are determined, and the states are sorted by analysis of the transition matrix. Second, the transitions between the states are dynamically modelled using a Markov process. Physical mechanisms are then distilled by a refined analysis of the Markov process, e. g. using finite-time Lyapunov exponent (FTLE) and entropic methods. This CROM framework is applied to the Lorenz attractor (as illustrative example), to velocity fields of the spatially evolving incompressible mixing layer and the three-dimensional turbulent wake of a bluff body. For these examples, CROM is shown to identify non-trivial quasi-attractors and transition processes in an unsupervised manner. CROM has numerous potential applications for the systematic identification of physical mechanisms of complex dynamics, for comparison of flow evolution models, for the identification of precursors to desirable and undesirable events, and for flow control applications exploiting nonlinear actuation dynamics.
Networks of coupled dynamical systems provide a powerful way to model systems with enormously complex dynamics, such as the human brain. Control of synchronization in such networked systems has far-reaching applications in many domains, including engineering and medicine. In this paper, we formulate the synchronization control in dynamical systems as an optimization problem and present a multi-objective genetic programming-based approach to infer optimal control functions that drive the system from a synchronized to a non-synchronized state and vice versa. The genetic programming-based controller allows learning optimal control functions in an interpretable symbolic form. The effectiveness of the proposed approach is demonstrated in controlling synchronization in coupled oscillator systems linked in networks of increasing order complexity, ranging from a simple coupled oscillator system to a hierarchical network of coupled oscillators. The results show that the proposed method can learn highly effective and interpretable control functions for such systems.