1 Introduction
Rayleigh–Bénard Convection (RBC) provides a widely studied paradigm for thermallydriven flows, which are ubiquitous in nature and in industrial applications [intro:thermobook]. Buoyancy effects, ultimately yielding to fluid dynamics instability, are determined by temperature gradients [intro:chandrasekharfluidinstalbility] and impact on the heat transport. The control of RBC is an outstanding research topic with fundamental scientific implications [intro:RBcontrolaccelexp]. Additionally, preventing, mitigating or enhancing such instabilities and/or regulating the heat transport is crucial in numerous applications. Examples include crystal growth processes, e.g. to produce silicon wafers [intro:crystalconvectioninhomogeneitiesbook]. Indeed, while the speed of these processes benefits from increased temperature gradients, the quality of the outcome is endangered by fluid motion (i.e. flow instability) that grows as the thermal gradients increase. Thus the key problem addressed here: can we control and stabilize fluid flows that, due to temperature gradients, would otherwise be unstable?
In the Boussinesq approximation, the fluid motion in RBC can be described via the following equations [intro:lbmbook]:
(1)  
(2) 
where denotes the time, the incompressible velocity field (), the pressure, the kinematic viscosity, the thermal expansion coefficient, the magnitude of the acceleration of gravity (with direction ), and the thermal diffusivity. For a fluid system confined between two parallel horizontal planes at distance and with temperatures and , respectively for the top and the bottom element (), it is well known that the dynamics is regulated by three nondimensional parameters: the Rayleigh and Prandtl numbers and the aspect ratio of the cell (i.e. the ratio between the cell height and width ), i.e.
(3) 
Considering adiabatic side walls, a mean heat flux, , independent on the height establishes on the cell:
(4) 
where indicates an average with respect to the axis, parallel to the plates, and the time averaging. The timeaveraged heat flux is customarily reported in a nondimensional form, scaling it by the conductive heat flux, , which defines the Nusselt number
(5) 
As the Rayleigh number overcomes a critical threshold, , fluid
motion is triggered enhancing the heat exchange ().
) uses a Neural Network controller which acquires flow state from a number of probes at fixed locations and returns a temperature profile (see details in Fig.
2). The parameters of the Neural Network are automatically optimized by the RL method, during training. Moreover, in the RL case, the temperature fluctuations at the bottom plate are piecewise constant and can have only prefixed temperature value between two states, hot or cold (cf. Eq. (12)). Operating with discrete actions, reduces significantly the complexity and the computational resources needed for training.Dubbed in terms of Rayleigh and Nusselt numbers, our control question becomes: can we diminish, or minimize, Nusselt for a fixed Rayleigh number?
In recent years, diverse approaches have been proposed to tackle this issue. These can be divided into passive and active control methods. Passive control methods include: acceleration modulation [intro:RBcontrolaccelexp, intro:RBcontrolaccelcompute], oscillating shear flows [intro:RBcontrolshearflows], and oscillating boundary temperatures [intro:RBcontroltemperatureoscillations]. Active control methods include: velocity actuators [intro:RBcontrolvelocity], and perturbations of the thermal boundary layer [intro:RBcontroltempfirst, intro:RBcontroltempexperimental, intro:RBcontroltemprobust]. Many of these methods, although ingenious, are not practical due, e.g., to the requirement of a perfect knowledge of the state of the system, or a starting condition close to the conductive state  something difficult to establish [intro:RBcontroltempexperimental]. Another stateoftheart active method, that is used in this paper as comparison, is based on a linear control acting at the bottom thermal boundary layer [intro:PDRBcontrol]. The main difficulty in controlling RBC resides in its chaotic behavior and chaotic response to controlling actions. In recent years, Reinforcement Learning (RL) algorithms [intro:RLbook] have been proven capable of solving complex control problems, dominating extremely hard challenges in highdimensional spaces (e.g. board games [intro:RLexampleGO, intro:RLexampleboardgames] and robotics [intro:RLexampleirlcube]
). Reinforcement Learning is a supervised Machine Learning (ML)
[RLback:MLbook] approach aimed at finding optimal control strategies. This is achieved by successive trialanderror interactions with a (simulated or real) environment which iteratively improve an initial random control policy. Indeed, this is usually a rather slow process which may take millions of trialanderror episodes to converge [intro:RLexamplerainbowatari]. Reinforcement learning has also been used in connection with fluid flows, such as for training smart inertial or selfpropelling particles [colabrese2018smart, colabrese2017flow, gustavsson2017finding], for schooling of fishes [gazzola2016learning, verma2018efficient], soaring of birds and gliders in turbulent environments [reddy2016learning, reddy2018glider], optimal navigation in turbulent flows [biferale2019, alageshan2019path], drag reduction by active control in the turbulent regime [intro:drag], and more [muinos2018reinforcement, novati2018deep, tsang2018self, intro:dragaccel, cichos2020machine, rabault2020deep].In this work, we show that RL methods can be successfully applied for controlling a Rayleigh–Bénard system at fixed Rayleigh number reducing (or suppressing) convective effects. Considering a 2D proofofconcept setup, we demonstrate that RL can significantly outperform stateoftheart linear methods [intro:PDRBcontrol] when allowed to apply (small) temperature fluctuations at the bottom plate (see setup in Figure 1). In particular, we target a minimization of the timeaveraged Nusselt number (Eq. (5)), aiming at reducing its instantaneous counterpart:
(6) 
where the additional average along the vertical direction, , amends instantaneous fluctuations.
Finding controls fully stabilizing RBC might be, however, at all impossible. For a chaotic system as RBC, this may happen, among others, when delays in controls or observation become comparable with the Lyapunov time. We discuss this topic in the last part of the paper employing Reinforcement Learning to control the Lorenz attractor, a wellknown, reduced version of RBC [back:lorenz1963].
The rest of this manuscript is organized as follows. In Section 2, we formalize the Rayleigh–Bénard control problem and the implementation of both linear and RL controls. In Section 3, we present the control results and comment on the induced flow structures. In Section 4 we analyze physical factors that limit the RL control performance. The discussion in Section 5 closes the paper.
2 Controlbased convection reduction
In this section we provide details of the Rayleigh–Bénard system considered, formalize the control problem and introduce the control methods.
We consider an ideal gas () in a twodimensional Rayleigh–Bénard system with at an assigned Rayleigh number (cf. sketch and coordinate system in Figure 1). We assume the four cell sides to satisfy a nonslip boundary condition, the lateral sides to be adiabatic, and a uniform temperature, , imposed at the top boundary. We enforce the Rayleigh number by specifying the average temperature,
(7) 
at the bottom boundary (where is the instantaneous temperature at location of the bottom boundary). Temperature fluctuations with respect to such average,
(8) 
are left for control.
We aim at controlling to minimize convective effects, which we quantify via the timeaveraged Nusselt number (cf. Eq.(5)). We further constrain the allowed temperature fluctuations to
(9) 
to prevent extreme and nonphysical temperature gradients (in similar spirit to the experiments in [intro:RBcontroltempexperimental]).
We simulate the flow dynamics through the LatticeBoltzmann method (LBM) [intro:lbmbook] employing a double lattice, respectively for the velocity and for the temperature populations (with D2Q9 and D2Q4 schemes on a square lattice with sizes ; collisions are resolved via the standard BGK relaxation). We opt for the LBM since it allows for fast, extremely vectorizable, implementations which enables us to perform multiple (up to hundreds) simulations concurrently on a GPU architecture. See Table 1 for relevant simulation parameters; further implementation details are reported in Appendix A.
Parameters  
Ra  Rayleigh Number  
Pr  Prandtl Number  
Aspect Ratio  
Control  
0.75  Control amplitude limit, Eq. (9)  
Control loop (unit: LBM steps)  
(training)  Start evaluation time, for averages in Eq. (5)  
”  (test)  ” 
End evaluation time, for averages in Eq. (5)  
Lattice Boltzmann simulation (Appendix A)  
Grid size  
Speed of sound  
0.56  Relaxation time  
1  Top boundary temperature  
2  Bottom boundary mean temperature  
Temperature relaxation time  
Kinematic viscosity  
Thermal diffusivity  
Effective gravity 
Starting from a system in a (random) natural convective state (cf. experiments [intro:RBcontroltempexperimental]), controlling actions act continuously. Yet, to limit learning computational costs, is updated with a period, (i.e. control loop), longer than the LBM simulation step and scaling with the convection time, . We report in Table 3 the loop length, which satisfies, approximately, , and the system size, all of which are Radependent. Once more, for computational efficiency reasons, we retain the minimal system size that enables us to quantify the (uncontrolled) Nusselt number within error (Appendix A).
In the next subsections we provide details on the linear and reinforcementlearning based controls.
2.1 Linear control
We build our reference control approach via a linear proportionalderivative (PD) controller [intro:PDRBcontrol]. Our control loop prescribes instantaneously the temperature fluctuations at the bottom boundary as
(10) 
with , being constant parameters and the (signed) distance from the optimal conductive state (), , satisfying
(11) 
where is a reference vertical velocity. To ensure the constraints given by Eqs. (7),(9) we operate a clipping and renormalization operation, , as described in Appendix B.
Various other metrics, , have been proposed leveraging, for instance, on the shadow graph method ( [intro:RBcontroltempexperimental]), and on the midline temperature (, with , [intro:RBcontroltempfirst]). These metrics provide similar results and, in particular, an average Nusselt number for the controlled systems within . Hence, we opted for Eq. (11) as it proved to be more stable. Note that, by restricting to , one obtains a linear proportional (P) controller. While supposedly less powerful than a PD controller, in our case the two show similar performance. The controller operates with the same space and time discretization of the LBM simulations, with the time derivative of calculated with a first order backwards scheme. We identify the Rayleighdependent parameters and via a gridsearch algorithm [RLback:optimizationbook] for (cf. values in Table 2). In case of higher Ra, due to the chaoticity of the system, we were unable to find parameters consistently reducing the heat flux with respect to the uncontrolled case.
P control  PD control  

Ra  
20  0.0  0.0  0.0  
20  0.0  
20  
25  
30  16.4  94.8  
40  9.38  11.5  
100  6.61  
200  7.38  0.12  31.8  
350  0.33     
2.2 Reinforcement Learningbased control
In a Reinforcement Learning context we have a policy, , that selects a temperature fluctuation, , on the basis of the observed system state. is identified automatically through an optimization process, which aims at maximizing a reward signal. In our case we define the system state, the allowed controlling actions and the reward are as follows:

The state space, , includes observations of the temperature and velocity fields (i.e. of scalar fields) probed on a regular grid in nodes for the last time steps (i.e. , where is the current time). Note that the probe grid has a coarser resolution than the lattice, i.e. , , which allows to reduce the complexity of the control problem. It holds, therefore, .

The action space, , includes the temperature profiles for the lower boundary that the controller can instantaneously enforce. To limit the computational complexity, we allow profiles which are piecewise constant functions on segments (cf. Figure 1). Moreover, each of the function elements, (), can attain only two temperature levels, i.e.
(12) To enforce the constraint in Eq. (7),(9) we normalize the profile according to Appendix B, generating the final profile . After normalization, the action space includes distinct actions.

The reward function defines the goal of the control problem. We define the reward, , as the negative instantaneous Nusselt number (cf. Eq. 6) which results from applying a temperature profile at time . In formulas, it holds
(13) Note that the RL controller aims at maximizing the reward accumulated over time (rather than the instantaneous reward), which minimizes the average Nusselt number, Eq. (5), as desired.
We employ the Proximal Policy Optimization (PPO) RL algorithm [intro:PPOalgorithm]
, which belongs to the family of Policy Gradient Methods. Starting from a random initial condition, Policy Gradient Methods search iteratively (and probabilistically) for optimal (or sufficient) policies by gradient ascent (based on local estimates of the performance). Specifically, this optimization employs a probability distribution,
, on the action space conditioned to the instantaneous system state. At each step of the control loop, we sample and apply an action according to the distribution . Notably, the sampling operation is essential at training time, to ensure an adequate balance between exploration and exploitation, while at test time, this stochastic approach can be turned deterministic by restricting to the action with highest associated probability. In our case, at test time we used the deterministic approach for and the stochastic approach for , as this allowed for higher performance.The PPO algorithm is modelfree, i.e. it does not need assumptions on the nature of the control problem. Besides, it does not generally require significant hyperparameter tuning, as often happens for RL algorithms (e.g. value based method
[intro:PPOalgorithm]).When the state vector
is highdimensional (or even continuous), it is common to parameterize the policy function in probabilistic terms as , for a parameter vector [intro:RLexampleGO]. This parameterization can be done via different kinds of functions and, currently, neural networks are a popular choice [intro:universalNN]. In the simplest case, as used here, the neural network is a multilayer perceptron
[intro:RLbook](MLP). An MPL is a fully connected network in which neurons are stacked in layers and information flows in a predefined direction from the input to the output neurons via “hidden” neuron layers. The
th neuron in the th layer operates returning the value , which satisfies(14) 
where the ’s are the outputs of the neurons of the previous layer (the th one), which thus undergo an affine transformation via the matrix and the biases
. The nonlinear activation function
provides the network with the capability of approximating nonlinear functions [intro:universalNN]. During training, the parameters get updated through back propagation [intro:backprop] (according to the loss defined by the PPO algorithm) which results in progressive improvements of the policy function.To increase the computational efficiency, we opt for a policy function factorized as follows
(15) 
In other words, we address the marginal distributions of the local temperature values . We generate the marginals by an MLP (with two hidden layers each with activation) that has final outputs, , returned by sigmoid activation functions, in formulas:
(16) 
with (see Fig. 2, note that ). The values provide the parameters for Bernoulli distributions that determine, at random, the binary selection between the temperature levels . In formulas, it holds
(17) 
The final temperature profile is then determined via Eq. (12) and the normalization in Eq. (23). We refer to Fig. 2 for further details on the network.
3 Results
We compare the linear and RBbased control methods on different scenarios with Rayleigh number ranging between (just before the onset of convection) and (mild turbulence, see Table 3). Figure 3 provides a summary of the performance of the methods in terms of the (ensemble) averaged Nusselt number. Until , the RL control and the linear control deliver similar performance. At higher Ra numbers, in which the Rayleigh–Bénard system is more complex and chaotic, RL controls significantly outperform linear methods. This entails an increment of the critical Rayleigh number, which increases from , in the uncontrolled case, to , in case of linear control, and to in case of RLbased controls. Above the critical Rayleigh, RL controls manage a reduction of the Nusselt number which remains approximately constant, for our specific experiment, it holds
In contrast, the linear method scores only
while at higher Rayleigh it results completely ineffective.
The reduction of the average Nusselt number is an indicator of the overall suppression or the reduction of convective effects, yet it does not provide insightful and quantitative information on the characteristics of the control and of the flow. In Figure 4, we compare the controls in terms of the time histories of the (ensembleaveraged) Nusselt number. We include four different scenarios. For the RL control is able to stabilize the system () while both linear control methods result in periodic orbits [intro:PDRBcontrol]. At , RL controls are also unable to stabilize the system; yet, this does not result in any periodic flows as in the case of linear control. Finally, at we observe a timevarying Nusselt number even using RLbased controls. To better understand the RL control strategy, in Figures 5 and 6, we plot the instantaneous velocity streamlines for the last two scenarios.
For the case (see Figure 5(c)), the RL control steers and stabilizes the system towards a configuration that resembles a double cell. This reduces convective effect by effectively halving the effective Rayleigh number. In particular, we can compute a effective Rayleigh number, , by observing that the double cell structure can be constructed as two vertically stacked Rayleigh–Bénard systems with halved temperature difference and height (i.e., in formulas, and ). It thus results in an effective Rayleigh number satisfying
(18) 
which is in line with the observed reduction in Nusselt.
At it appears that the RL control attempts, yet fails, to establish the “double cell” configuration observed at lower Ra (cf. Figure 6(c)). Likely, this is connected to the increased instability of the double cell configuration as Rayleigh increases.
These results were achieved with less than an hour of training time on an Nvidia V100 for the cases with low Rayleigh number (). However, at the optimization took up to 150 hours of computing time (the majority of which is spent in simulations and the minority of which is spent in updating the policy). For further details on the training process of the RL controller see Appendix D.
4 Limits to learning and control
In this section we discuss possible limits to the capability of learning automatic controls when aiming at suppressing convection. Our arguments are grounded on general physics concepts and thus apply to other control problems for nonlinear/chaotic dynamics.
In Sect. 2, we showed that RL controls are capable of substantially outperforming linear methods in presence of sufficient control complexity (). It remains however unclear how far these controls are from optimality, especially at high Ra. Here we address the physics factors certainly hindering learning and controlling capabilities.
Having sufficient time and spatial resolution on the relevant state of the system is an obvious requirement to allow a successful control. Such resolution however is not defined in absolute terms, rather it connects to the typical scales of the system and, in case of a chaotic behavior, with the Lyapunov time and associated length scale. In our case, at fixed Ra, learnability and controllability connect with the number and density of probes, with the time and space resolution of the control, but also with its “distance” with respect to the bulk of the flow.
The system state is observed via a number of probes in fixed position (see Figure 0(b)). For a typical (buoyant) velocity in the cell, , there is a timescale associated with the delay with which a probe records a sudden change (e.g. creation/change of a plume) in the system. When this timescale becomes comparable or larger than the Lyapunov time, it appears hopeless for any control to learn and disentangle features from the probe readings. In other words, as Ra increases, we expect that a higher and higher number of probes becomes necessary (but not sufficient) in order to learn control policies.
Besides, our choice to control the system via the bottom plate temperature fluctuations entails another typical delay: the time taken to thermal adjustments to propagate inside the cell. In particular, in a cell at rest, this is the diffusion time, . If the delay gets larger or comparable to the Lyapunov time, controlling the system becomes, again, likely impossible.
To illustrate this concept, we rely on a wellknown lowdimensional model inspired by RBC: the Lorenz attractor. The attractor state is threedimensional and its variables (usually denoted by ; see Appendix E) represent the flow angular velocity, the horizontal temperature fluctuations and the vertical temperature fluctuations. We consider a RL control acting on the horizontal temperature fluctuations ( variable) that aims at either minimizing or maximizing the sign changes of the angular velocity (i.e. maximizing or minimizing the frequency of sign changes of the variable). In other words, the control aims at keeping the flow rotation direction maximally consistent or, conversely, at magnifying the rate of velocity inversions. In this simplified context, we can easily quantify the effects of an artificial delay in the control on the overall control performance (Figure 7). Consistently with our previous observations, when the artificial delay approaches the Lyapunov time the control performance significantly degrades.
Notably, in our original 2D RBC control problem (Sect. 2), control limitations are not connected to delays in observability. In fact, as we consider coarser and coarser grids of probes, the control performance does not diminish significantly (cf. Fig. 8; surprisingly, observations via only allow similar control performance to what achieved employing probes). This suggests that other mechanisms than insufficient probing determine the performance, most likely, the excessively long propagation time (in relation to the Lyapunov time) needed by the controlling actions to traverse the cell from the boundary to the bulk. This could be possibly lowered by considering different control and actuation strategies.
5 Discussion
In this paper we considered the issue of suppressing convective effects in a 2D Rayleigh–Bénard cell, by applying small temperature fluctuations at the bottom plate. In our proof of concept comparison, limited to a square cell and fixed Pr, we showed that controls based on Reinforcement Learning (RL) are able to significantly outperform stateoftheart linear approaches. Specifically, RL is capable of discovering controls stabilizing the Rayleigh–Bénard system up to a critical Rayleigh number that is approximately times larger than achievable by linear controls and times larger than in the uncontrolled case. Secondly, when the purely conductive state could not be achieved, the RL still produces control strategies capable of reducing convection, which are significantly better than linear algorithms. The RL control achieves this by inducing an unstable flow mode, similar to a stacked doublecell, yet not utilized in the context of RBC control.
Actually no guarantee exists on the optimality of the controls found by RL. Similarly it holds for the linear controls, which additionally need vast manual intervention for the identification of the parameters. However, as we showed numerically, theoretical bounds to controllability hold which are regulated by the chaotic nature of the system, i.e. by its Lyapunov exponents, in connection with the (space and time) resolution of the system observations as well as with the actuation capabilities. We quantified such theoretical bounds in terms of delays, in observability and/or in actuation: whenever these become comparable to the Lyapunov time, the control becomes impossible.
There is potential for replication of this work in an actual experimental setting. However, training a controller only via experiments might take an excessively long time to converge. Recent developments in reinforcement learning showed already the possibility of employing controllers partially trained on simulations (transfer learning
[intro:RLexampleirlcube]). This would not only be a large step for the control of flows, but also for RL where practical/industrial uses are still mostly lacking [intro:RLbook].Appendix A Rayleigh–Bénard simulation details
We simulate the Rayleigh–Bénard system via the lattice Boltzmann method (LBM) that we implement in a vectorized way on a GPU. We employ the following methods and schemes

Velocity population: D2Q9 scheme, afterwards indicated by ;

Temperature population: D2Q4 scheme;

Collision model: BGK collision operator [Appendix:BGK, intro:lbmbook];

Forcing scheme: As seen in [intro:lbmbook] most forcing schemes can be formulated as follows
(19) (20) with and defined by scheme. We choose the scheme by He et al. [Appendix:Heforcemodel] for its improved accuracy which reads
(21) (22) 
Boundary model: bounceback rule enforcing noslip boundary conditions [intro:lbmbook].
To limit the training time, we implemented the LBM vectorizing on the simulations. This enabled us to simulate multiple concurrent, fully independent, Rayleigh–Bénard systems within a single process. This eliminates the overhead of having numerous individual processes running on a single GPU which would increase the CPU communication overhead.
When a RL controller selects a temperature profile for the bottom boundary this is endured for number of LBM steps (this defines one environment step, or env step, with length ). The reason for these, socalled, sticky actions is that within one env step the system does not change significantly. Allowing quicker actions would not only be physically meaningless but also possibly detrimental to the performance (this is a known issue when training RL agents for games where actions need to be sustained to make an impact [intro:RLexampleCuriositylarge]). Furthermore, due to our need to investigate the transient behavior, we set the episode length to env steps. In this way, the transient is extinguished within the first env steps. After each episode the system is reset to a random, fully developed, convective RB state.
In dependence on the Rayleigh number (i.e. system size), it takes between millions and billions env steps to converge to a control strategy. To limit the computing time, we consider the smallest possible system that gives a good estimate for the uncontrolled Nusselt number (error within few percent).
In Table 3 we report the considered Rayleigh numbers and related system sizes.
Ra  and 

Nu  Nu reference [Appendix:RBNuref]  
20  16  1.000  1.000  
20  16  1.141  
20  30  2.090  2.15  
25  60  2.753  
30  60  3.847  3.91  
40  60  4.768  
100  60  6.136  6.3  
200  100  7.500  
350  180  10.900 
Appendix B Control amplitude normalization
To limit the amplitude of the temperature fluctuations and ensure their zeroaverage (see Eq. (7), (9)) we employ the following three normalization steps, indicated by in the manuscript. Let be the temperature fluctuation proposed by either the linear control or the RLbased control, we obtain as
(23)  
(24)  
(25) 
Note that the first operation is a clipping of the local temperature fluctuation between , which is necessary only for the linear control case.
Appendix C RL algorithm implementation and hyperparameters
In this appendix we elaborate on our design choices about the implementation of RL for Rayleigh–Bénard control.

Discretization of the bottom boundary in 10 sections. A literature study [LAres:RLcontinuesaction2, LAres:RLcontinuesaction] and preliminary experiments have shown that large/continuous action spaces are currently rather challenging for the convergence of RL methods. In our preliminary experiments we observed that discretizing in sections was even less effective that in sections, and that sections were instead insufficient to get the desired performance.

3 layer multilayer perceptron (MLP) for state encoding.
We considered this option over a convolutional neural network (CNN) applied on the entire lattice. The latter had significantly longer training times and lower final performance. Besides, we included in the state observed by the MLP the system readings in the
previous env steps, which is known to be beneficial for performance [intro:RLexampleCuriositylarge]. 
PPO algorithm.
We considered this option over valuebased methods which were however more difficult to operate with due to the need of extensive hyperparameter tuning. Furthermore, we used the open source implementation of PPO included in the stablebaselines python library
[intro:RLplatformstablebaselines] (note: training PPO demands for a socalled auxiliary value function [intro:PPOalgorithm]. For that we employed a separate neural network having the same structure as the policy function).
c.1 Hyperparameters
We used the work by Burda et al. [intro:RLexampleCuriositylarge] as a starting point for our choice of the hyperparameters. We specifically considered two separate hyperparameter sets. i targeting final performance over training speed, used for . ii targeting speed over final performance, used only on the highest Rayleigh number case () and for the research on the probe density. Below one can see the PPO hyperparameters used (see [intro:RLbook] and [intro:PPOalgorithm] for further explanations).

Number of concurrent environments: 512 (set 2: 128)

Number of rollout steps: 128

Number of samples training samples: (set 2: )

Entropy coefficient : 0.01

Learning rate :

Discount factor : 0.99

Number of minibatches: 8 (set 2: 16)

Number of epoch when optimizing the surrogate: 4 (set 2: 32)

Value function coefficient for the loss calculation: 0.5

Factor for tradeoff of bias vs. variance for Generalized Advantage Estimator
: 0.95 
PPO Cliprange: 0.2
Appendix D Training curves
We report in Figure 9 the learning curves for our RL control (performance vs. length of the training session). These curves provide information on the time necessary to converge to a strategy and thus are an indication of the difficulty and stability of the process.
Appendix E Implementation Lorentz Attractor Control
To illustrate our argument that a delay comparable to the Lyapunov time is detrimental to the control performance, we introduce two control problems defined on the Lorentz Attractor (LA). These LA control problems are defined considering the following equations
(26)  
(27)  
(28)  
(29) 
with being a relatively small controllable parameter, and , and . The control loop and integration loop (via RK4) have the same time stepping . The two control problems are as follows

“LA stabilizer”. We aim at minimizing the frequency with which the flow direction changes (i.e. the frequency of sign changes). Reward: if and zero otherwise;

“LA oscillator”. Similar to LA stabilizer but with inverse goal. Reward: if and zero otherwise.
We start the system in a random state around the attractor, the controller is an MLP network, and we use the PPO RL algorithm (similarly to our approach for the complete Rayleigh–Bénard case). We furthermore limit the control to three states, , for training speed purposes.
Applying RL on these control problems with no delay results in the behaviors shown in Figure 10. The control develops complex strategies to maximize/minimize the frequency of sign changes of .
Comments
There are no comments yet.