DYNAMICS MODEL FOR GLOBALLY STABLE MODELING OF SYSTEM DYNAMICS
20210042457 ยท 2021-02-11
Inventors
- Gaurav Manek (Pittsburgh, PA, US)
- Jeremy Zieg Kolter (Pittsburgh, PA, US)
- Julia Vinogradska (Stuttgart, DE)
Cpc classification
International classification
G06F30/27
PHYSICS
Abstract
A system and computer-implemented method are provided for training a dynamics model to learn the dynamics of a physical system. The dynamics model may be learned to be able to infer a future state of the physical system and/or its environment based on a current state of the physical system and/or its environment. The learned dynamics model is inherently globally stable. Instead of learning a dynamics model and attempting to separately verify its stability, the learnable dynamics model comprises a learnable Lyapunov function which is jointly learned together with the nominal dynamics of the physical system. The learned dynamics model is highly suitable for real-life applications in which a physical system may assume a state which was unseen during training as the learned dynamics model is inherently globally stable.
Claims
1. A machine learning system for training a dynamics model to learn dynamics of a physical system by learning to infer a future state of the physical system and/or its environment based on a current state of the physical system and/or its environment, the machine learning system comprising: an input interface configured for accessing: training data representing a time-series of states of the physical system and/or its environment; and model data defining a machine learnable dynamics model which includes a machine learnable Lyapunov function; and a processor subsystem configured to learn the dynamics model based on time-sequential pairs of states so as to learn to infer a future state of the physical system and/or its environment based on the current state, wherein the learning is constrained to provide a globally stable modelling of dynamics of the physical system by jointly learning the dynamics model and the Lyapunov function so that values of the learned Lyapunov function decrease along all trajectories of states inferred by the learned dynamics model.
2. The machine learning system according to claim 1, wherein the processor subsystem is configured to jointly learn the dynamics model and the Lyapunov function by learning, as the dynamics model, a projection of nominal dynamics of the physical system, which are learned based on the time-series of states, onto a function that fulfills a Lyapunov condition as defined by the Lyapunov function.
3. The machine learning system according to claim 2, wherein the projection is an orthogonal projection onto a halfspace.
4. The machine learning system according to claim 2, wherein the dynamics model includes a neural network for learning the nominal dynamics of the physical system based on the time-sequential pairs of states.
5. The machine learning system according to claim 1, wherein the machine learnable Lyapunov function is represented at least in part by an input-convex neural network.
6. The machine learning system according to claim 5, wherein the input-convex neural network includes a smoothed variant of a rectified linear unit for each activation function.
7. The machine learning system according to claim 5, wherein the Lyapunov function is shifted to establish a zero value of the Lyapunov function at an equilibrium point of the Lyapunov function, and wherein the learning of the Lyapunov function includes using a quadratic regularization term to ensure strict positive definitiveness of the Lyapunov function.
8. The machine learning system according to claim 5, wherein the processor subsystem is configured to, when learning the input-convex neural network on the training data, apply a continuously differentiable invertible function to the training data and use an output of the continuously differential invertible function as an input to the input-convex neural network.
9. A non-transitory computer-readable medium on which is stored model data defining a machine learnable dynamics model which includes a machine learnable Lyapunov function, wherein the dynamics model is learned to infer a future state of the physical system and/or its environment based on a current state, wherein the learning of the dynamics model has been constrained to provide a globally stable modelling of dynamics of the physical system by the dynamics model and the Lyapunov function having been jointly learned so that values of the learned Lyapunov function decrease along all trajectories of states inferred by the learned dynamics model.
10. A computer-implemented method for training a dynamics model to learn dynamics of a physical system by learning to infer a future state of the physical system and/or its environment based on a current state of the physical system and/or its environment, the method comprising the following steps: accessing training data representing a time-series of states of the physical system and/or its environment, and model data defining a machine learnable dynamics model which includes a machine learnable Lyapunov function; learning the dynamics model based on time-sequential pairs of states so as to learn to infer a future state of the physical system and/or its environment based on the current state, wherein the learning includes: constraining the learning to provide a globally stable modelling of the dynamics of the physical system by jointly learning the dynamics model and the Lyapunov function so that values of the learned Lyapunov function decrease along all trajectories of states inferred by the learned dynamics model.
11. A computer-implemented method for controlling or monitoring a physical system using a machine learned modelling of dynamics of the physical system, the method comprising the following steps: accessing: sensor data representing an observation of a current state of the physical system; and model data defining a machine learned dynamics model which includes a machine learnable Lyapunov function, wherein the dynamics model is learned to infer a future state of the physical system and/or its environment based on the current state, wherein the learning of the dynamics model has been constrained to provide a globally stable modelling of the dynamics of the physical system by the dynamics model and the Lyapunov function having been jointly learned so that values of the learned Lyapunov function decrease along all trajectories of states inferred by the learned dynamics model; inferring the future state of the physical system based on the observation of the current state of the physical system as obtained from the sensor data; and using an output interface to an output device which is used in the control or monitoring of the physical system, to provide output data to the output device to enable the control or monitoring of the physical system based on the inferred future state.
12. A non-transitory computer-readable medium on which is stored data representing instructions for training a dynamics model to learn dynamics of a physical system by learning to infer a future state of the physical system and/or its environment based on a current state of the physical system and/or its environment, the instructions, when executed by a processor system, causing the processor system to perform the following steps: accessing training data representing a time-series of states of the physical system and/or its environment, and model data defining a machine learnable dynamics model which includes a machine learnable Lyapunov function; learning the dynamics model based on time-sequential pairs of states so as to learn to infer a future state of the physical system and/or its environment based on the current state, wherein the learning includes: constraining the learning to provide a globally stable modelling of the dynamics of the physical system by jointly learning the dynamics model and the Lyapunov function so that values of the learned Lyapunov function decrease along all trajectories of states inferred by the learned dynamics model.
13. A control or monitoring system for controlling or monitoring a physical system using a machine learned modelling of dynamics of the physical system, the control or monitoring system comprising: an input interface for accessing: sensor data representing an observation of a current state of the physical system; and model data defining a machine learned dynamics model which includes a machine learnable Lyapunov function, wherein the dynamics model is learned to infer a future state of the physical system and/or its environment based on the current state, wherein the learning of the dynamics model has been constrained to provide a globally stable modelling of dynamics of the physical system by the dynamics model and the Lyapunov function having been jointly learned so that values of the learned Lyapunov function decrease along all trajectories of states inferred by the learned dynamics model; an output interface to an output device which is used in the control or monitoring of the physical system; and a processor subsystem configured to: infer the future state of the physical system based on the observation of the current state of the physical system as obtained from the sensor data; and using the output interface, provide output data to the output device to enable the control or monitoring of the physical system based on the inferred future state.
14. The control or monitoring system according to claim 13, wherein the output device is an actuator associated with the physical system, and wherein the processor subsystem is configured to control the physical system by providing control data) to the actuator which is based on the inferred future state of the physical system.
15. The control or monitoring system according to claim 14, wherein the system is one of: a vehicle control system, a robotics control system, a manufacturing control system, and a building control system.
Description
BRIEF DESCRIPTION OF THE DRAWINGS
[0031] These and other aspects of the present invention will be apparent from and elucidated further with reference to the embodiments described by way of example in the following description and with reference to the figures.
[0032]
[0033]
[0034]
[0035]
[0036]
[0037]
[0038]
[0039]
[0040]
[0041]
[0042]
[0043]
[0044]
[0045]
[0046] It should be noted that the figures are purely diagrammatic and not drawn to scale. In the figures, elements which correspond to elements already described may have the same reference numerals.
LIST OF REFERENCE NUMBERS
[0047] The following list of reference numbers is provided for facilitating understanding of the figures and shall not be construed as limiting the present invention.
[0048] 20 sensor
[0049] 22 camera
[0050] 40 actuator
[0051] 42 electric motor
[0052] 60 environment
[0053] 80 (semi)autonomous vehicle
[0054] 100 system for training dynamics model
[0055] 160 processor subsystem
[0056] 180 data storage interface
[0057] 190 data storage
[0058] 192 training data
[0059] 194 model data
[0060] 196 model data
[0061] 200 method for training dynamics model
[0062] 210 accessing training data
[0063] 220 accessing model data defining dynamics model
[0064] 230 learning dynamics model based on training data
[0065] 240 joint learning of dynamics model with Lyapunov function
[0066] 300-304 contour plot of Lyapunov function of stable dynamics system
[0067] 400 rectified linear unit activation function
[0068] 410 smoothed variant of rectified linear unit activation function
[0069] 500 streamplot of dynamics as simulated from first principles
[0070] 510 streamplot of dynamics of the learned dynamics model
[0071] 520 contour plot of the learned Lyapunov function
[0072] 600 prediction error as a function of timestamp for 8-link pendulum
[0073] 610 timestamp
[0074] 620 prediction error
[0075] 630 average error over 1000 timestamps as function of number of links
[0076] 640 number of links
[0077] 650 average prediction error
[0078] 660 simple learned dynamics model
[0079] 670 stable learned dynamics model
[0080] 700 structure of video texture generation network
[0081] 710 stable dynamics model run 1
[0082] 720 stable dynamics model run 2
[0083] 730 stable dynamics model run 3
[0084] 740 nave dynamics model
[0085] 800 system for control or monitoring using learned dynamics model
[0086] 820 sensor data interface
[0087] 822 sensor data
[0088] 840 actuator interface
[0089] 842 control data
[0090] 860 processor subsystem
[0091] 880 data storage interface
[0092] 890 data storage
[0093] 900 method for control or monitoring using learned dynamics model
[0094] 910 accessing sensor data
[0095] 920 accessing model data defining learned dynamics model
[0096] 930 inferring future state from observed current state using model
[0097] 940 providing output data based on inferred future state
[0098] 1000 computer-readable medium
[0099] 1010 non-transitory data
DETAILED DESCRIPTION OF EXAMPLE EMBODIMENTS
[0100] The following describes, with reference to
[0101]
[0102] The system 100 may comprise an input interface for accessing training data 192 representing a time-series of states of the physical system and/or its environment and for accessing model data 194 defining a machine learnable dynamics model which comprises a machine learnable Lyapunov function. For example, as also illustrated in
[0103] The system 100 may further comprise a processor subsystem 160 which may be configured to, during operation of the system 100, to learn the dynamics model based on time-sequential pairs of states so as to learn to infer a future state of the physical system and/or its environment based on the current state, wherein said learning is constrained to provide a globally stable modelling of the dynamics of the physical system by jointly learning the dynamics model and the Lyapunov function so that values of the learned Lyapunov function decrease along all trajectories of states inferred by the learned dynamics model. This dynamics model and its training will be further described with reference to
[0104] The system 100 may further comprise an output interface for outputting trained model data 196 representing the learned (or trained) dynamics model. For example, as also illustrated in
[0105]
[0106] The computer-implemented method 200 is shown to comprise, in a step titled ACCESSING TRAINING DATA, accessing 210 training data representing a time-series of states of the physical system and/or its environment, in a step titled ACCESSING MODEL DATA DEFINING DYNAMICS MODEL, accessing 220 model data defining a machine learnable dynamics model which comprises a machine learnable Lyapunov function, in a step titled LEARNING DYNAMICS MODEL BASED ON TRAINING DATA, learning 230 the dynamics model based on time-sequential pairs of states so as to learn to infer a future state of the physical system and/or its environment based on the current state, wherein said learning step 230 comprises, in a step or sub-step titled JOINT LEARNING OF DYNAMICS MODEL WITH LYAPUNOV FUNCTION, constraining the learning to provide a globally stable modelling of the dynamics of the physical system by jointly learning 240 the dynamics model and the Lyapunov function so that values of the learned Lyapunov function decrease along all trajectories of states inferred by the learned dynamics model.
[0107] The following examples describe the machine learnable dynamics model, including the training thereof, in more detail. However, the actual implementation of the machine learnable dynamics model and its training may be carried out in various other ways, e.g., on the basis of analogous mathematical concepts. For example, instead of using a neural network, a Gaussian process or another machine learnable model type may be used to learn the nominal dynamics of the physical system and to learn the Lyapunov function.
[0108] Briefly speaking, the following deals with learning continuous time dynamical systems, but also applies mutatis mutandis to discrete time dynamical systems. That is, given a state at time t, x(t).sup.n, the time-derivative of the state is modelled as
for some function .sup.n.fwdarw.
.sup.n: Modeling the time evolution of such dynamical systems (or their counterparts with control inputs {dot over (x)}(t)=(x(t), u(t)) for u(t)
.sup.m) is a foundational problem, with applications in reinforcement learning, control, forecasting, and many other settings. Owing to their representational power, neural networks have long been a natural choice for modeling the above function. However, when using a generic neural network to model dynamics in this setting, very little can be guaranteed about the behavior of the learned system. For example, it is very difficult to say anything about the stability properties of a learned model (informally, the tendency of the system to remain within some invariant bounded set). While some recent work has begun to consider stability properties of neural networks, see the aforementioned [1, 2, 3], such work has typically done so by (softly) enforcing stability as an additional loss term on the training data. Consequently, such work can say little about the stability of the system in unseen states.
[0109] Herein, an approach is described to learning neural network dynamics that are provably stable over the entirety of the state space. To do so, the system dynamics and a Lyapunov function may be jointly learned. This stability may be a hard constraint imposed upon the model. Accordingly, unlike recent approaches, stability may not be enforced via an imposed loss function but built directly into the dynamics of the model (e.g., even a randomly initialized model in the described model class will be provably stable everywhere in state space). For that purpose, a Lyapunov function may be provided, which may be based on an input convex neural network, and which may ensure global exponential stability to an equilibrium point while still allowing for expressive dynamics.
[0110] Using these methods, the following demonstrates learning the dynamics of physical models such as n-link pendulums, e.g., with reference to
[0111] The following primarily considers the setting of autonomous dynamics {dot over (x)}(t)=(x(t)) for x(t).sup.n. While the techniques described in this specification are applicable to the dynamics with control as well, the following discussion focuses on the autonomous case for ease of explanation. A system is defined to be globally asymptotically stable (for simplicity, around the equilibrium point x.sub.e=0) if we have x(0.fwdarw.0 as t.fwdarw. for any initial state x(0)
.sup.n; is locally asymptotically stable if the same holds but only for x(0)B where B is some bounded set containing the origin. Similarly, is globally (locally, respectively) exponentially stable (e.g., converges to the equilibrium exponentially quickly) if
x(t).sub.2mx(0.sub.2e.sup.at (2)
for some constants m, a0 for any x(0).sup.n (B, respectively).
[0112] The area of Lyapunov theory establishes the connection between the various types of stability mentioned above and descent according to a particular type of function known as a Lyapunov function. Specifically, let V:.sup.n.fwdarw.
be a continuously differentiable positive definite function, i.e., V(x)>0 for x0 and V(0)=0. Lyapunov analysis says that is stable (according to the definitions above) if and only if we can find some function V as above such the value of this function is decreasing along trajectories generated by . Formally, this is the condition that the time derivative {dot over (V)}(x(t))<0, i.e.,
[0113] This condition should hold for all x(t).sup.n or for all x(t)B to ensure global or local stability respectively. Similarly, f is globally asymptotically stable if and only if there exists positive definite V such that
{dot over (V)}(x(t))aV(x(t)), with c.sub.1x.sub.2.sup.2V(x)c.sub.2x.sub.2.sup.2 (4)
[0114] Showing that these conditions imply the various forms of stability is relatively straightforward, but showing the converse (that any stable system must obey this property for some V) is relatively more complex. However, we are largely concerned with the simpler of these two directions, as the goal is to enforce conditions that ensure stability.
[0115] Briefly speaking, for an arbitrary (non-stable) nominal dynamics f and a given positive definite function V(x)0, V(0)=0, V(x)>0 for x0, we may ensure global asymptotic stability by projecting {circumflex over ()} to
where Proj(.,.) denotes the orthogonal projection onto a halfspace. For example, automatic differentiation tools may be used to define/implement V such that including V in the definition of can be done straightforwardly. Overall, the neural network for 71 may be trained straightforwardly, similar to the training for any other function.
[0116] The following provides a more detailed explanation of the above while referring to .sup.n.fwdarw.
.sup.n denote a nominal dynamics model referring to a dynamics model which is directly learned on the training data, e.g., without incorporating the Lyapunov function, and let V:
.sup.n.fwdarw.
be a positive definite function: V(x)0 for x0 and V(0)=0. Then in order to (provably, globally) ensure that a dynamics function is stable, {circumflex over ()} may be projected such that it satisfies the condition
V(x).sup.T{circumflex over ()}(x)aV(x) (9)
i.e., one may define the dynamics as
where Proj(x;C) may denote the orthogonal projection of x onto the point C, and where the second equation follows from the analytical projection of a point onto a halfspace. V may for example be defined using automatic differentiation tools. Accordingly, the gradient V term may be included into the definition of , obtaining a composite neural network for (e.g., comprising a first neural network for {circumflex over ()} and a second neural network for the Lyapunov function) which may be trained just like any other function.
[0117]
[0118] As indicated previously, V may need to be positive definite, but additionally V may be preferred to have no local optima except 0. This is due to Lyapunov decrease condition: one may desire to guarantee stability to the equilibrium point x=0, yet the decrease condition imposed upon the dynamics may mean that V may be decreasing along trajectories of . If V has a local optimum away from the origin, the dynamics may in theory, but may not need to in practice, get stuck in this location; this may manifest itself by the V(x).sub.2.sup.2 term going to zero, which may result in the dynamics becoming undefined at the optima. The above conditions may be enforced by design decisions as described below.
[0119] The Lyapunov function V may be learned and represented by a neural network. To ensure the required properties of V, the following considerations may apply. More specifically, one may prefer to ensure (i) that V has only one (global) optimum (without loss of generality assumed to be V(0)=0), (ii) that V is positive definite, e.g., V(x)>0 for x0 and (iii) that V is continuously differentiable.
[0120] Firstly, property (i) may be enforced by representing V with an input-convex neural network (ICNN) g, which may be defined by:
z.sub.1=.sub.0(W.sub.ox+b.sub.0) z.sub.i+=.sub.0(U.sub.iz.sub.i+W.sub.ix+b.sub.i), i=1, . . . k1g(x)z.sub.k (11)
where W.sub.i may be real-valued weights mapping from inputs to the i+1 layer activations; U.sub.i may be positive weights mapping previously layer activations z.sub.i to the next layer; b.sub.i may be real-valued biases; and .sub.i may be convex, monotonically non-decreasing non-linear activations, such as the ReLU or smooth variants thereof. With this formulation, g is convex in x, and any convex function can be approximated by such networks.
[0121] Secondly, it may be desirable to ensure that V is positive definite. Representing V with an ICNN makes V convex, i.e., there is only one optimum, however it does not enforce V(0)=0. There are multiple ways to ensure V(0)=0. For example, one could find the global optimum of g and shift it or by removing the biases terms. However, shifting requires finding the optimum during training, which may be computationally expensive while removing the biases may put limitations on the class of variables that can be approximated. As an alternative approach, g may be shifted to ensure V(0)=0, while a little quadratic regularization term may be added to ensure positive definiteness, e.g., as:
V(x)=.sub.k+1(g(x)g(0))+x|.sub.2.sup.2 (12)
where .sub.k may be a positive, convex, non-decreasing function with .sub.k(0)=0 and is a small constant, for example selected such that
[0122] Thirdly, it may be desirable to ensure that V is continuously differentiable, for example by using a smoothed version 410 of the ReLU activations, as shown in
[0123] Additionally, warping to the input space may be used, such that the input to g is first mapped by any continuously differentiable, invertible function. Namely, although convexity may ensure that the Lyapunov function have no local optima, this may be a sufficient but not necessary condition, and indeed requiring a strongly convex Lyapunov function may impose too strict a requirement upon the learned dynamics. For this reason, the input to the ICNN function g(x) above may be optionally preceded by any continuously differentiable invertible function F:.sup.n
.sup.n, e.g., using
V(x)=.sub.k+1(g(F(x))g(F(0)))+x.sub.2.sup.2. (14)
as the Lyapunov function. Invertibility may ensure that the sublevel sets of V (which are convex sets, by definition) may map to contiguous regions of the composite function gF, thus ensuring that no local optima exist in this composed function.
[0124] The above-described dynamics model may be demonstrated on several example problems described with reference to
[0125] In
[0126] The learned dynamics may also be evaluated quantitatively while varying n and the time horizon of simulation.
[0127] .sup.2n giving mean and variance , log.sub.t.sup.2=e(y.sub.t), latent state z.sub.t
.sup.n
(.sub.t,.sub.t.sup.2) and decoder d:
.sup.n.fwdarw.y, y.sub.td(z.sub.t). The overall network may be trained to minimize both the standard VAE loss (reconstruction error plus a KL divergence term), but also to minimize the reconstruction loss of a next predicted state. The evolution of the latent dynamics may be modeled at z.sub.t+1(z.sub.t), or more precisely y.sub.t+1d((z.sub.t)). In other words, as also illustrated in
[0128] minimize.sub.e,d,{circumflex over ()},V.sub.t=1.sup.T1(KL()(.sub.t, .sub.t.sup.2I
(0, I)+E.sub.z[d(z.sub.t)y.sub.t.sub.2.sup.2+d(z.sub.t))y.sub.t+1.sub.2.sup.2])
[0129] The overall network may be trained on pairs of successive frames sampled from videos. To generate video textures, the dynamics model may be seeded with the encoding of a single frame and the dynamics model may be numerically integrated to obtain a trajectory. The VAE decoder may convert each step of the trajectory into a frame.
[0130]
[0131]
[0132] The system 800 may further comprise a processor subsystem 860 which may be configured to, during operation of the system 800, infer the future state of the physical system based on the observation of the current state of the physical system as obtained from the sensor data 822, and using an output interface as described elsewhere, provide output data 842 to an output device to enable the control or monitoring of the physical system based on the inferred future state, as also described elsewhere in this specification.
[0133] It will be appreciated that the same considerations and implementation options apply for the processor subsystem 860 as for the processor subsystem 860 of
[0134]
[0135] In some embodiments, the system 800 may comprise an actuator interface 840 for providing control data 842 to an actuator 40 in the environment 60. Such control data 842 may be generated by the processor subsystem 860 to control the actuator 40 based on one or more inferred future states of the physical system, which may be generated using the learned dynamics model. For example, the actuator may be an electric, hydraulic, pneumatic, thermal, magnetic and/or mechanical actuator. Specific yet non-limiting examples include electrical motors, electroactive polymers, hydraulic cylinders, piezoelectric actuators, pneumatic actuators, servomechanisms, solenoids, stepper motors, etc. Such type of control is described with reference to
[0136] In other embodiments (not shown in
[0137] In general, each system described in this specification, including but not limited to the system 100 of
[0138]
[0139]
[0140] The example method 900 is shown to comprise, in a step titled ACCESSING SENSOR DATA, accessing 910 sensor data representing an observation of a current state of the physical system, in a step titled ACCESSING MODEL DATA DEFINING LEARNED DYNAMICS MODEL, accessing 920 model data defining a machine learned dynamics model as described elsewhere in this specification, e.g., as obtained from the system 100 or method 200 of
[0141] It will be appreciated that, in general, the operations or steps of the computer-implemented methods 200 and 800 of respectively
[0142] Each method, algorithm or pseudo-code described in this specification may be implemented on a computer as a computer implemented method, as dedicated hardware, or as a combination of both. As also illustrated in
[0143] Examples, embodiments or optional features, whether indicated as non-limiting or not, are not to be understood as limiting the present invention.
[0144] In accordance with an abstract of the specification, a system and computer-implemented method are provided for training a dynamics model to learn the dynamics of a physical system. In particular, the dynamics model may be learned to be able to infer a future state of the physical system and/or its environment based on a current state of the physical system and/or its environment. The learned dynamics model is inherently globally stable. Namely, instead of learning a dynamics model and attempting to separately verify its stability, the learnable dynamics model comprises a learnable Lyapunov function which is jointly learned together with the nominal dynamics of the physical system. Accordingly, the learned dynamics model is highly suitable for real-life applications in which a physical system may assume a state which was unseen during training as the learned dynamics model is inherently globally stable.
[0145] It should be noted that the above-mentioned embodiments illustrate rather than limit the present invention, and that those skilled in the art will be able to design many alternative embodiments without departing from the scope of the present invention. Herein, use of the verb comprise and its conjugations does not exclude the presence of elements or stages other than those stated. The article a or an preceding an element does not exclude the presence of a plurality of such elements. Expressions such as at least one of when preceding a list or group of elements represent a selection of all or of any subset of elements from the list or group. For example, the expression, at least one of A, B, and C should be understood as including only A, only B, only C, both A and B, both A and C, both B and C, or all of A, B, and C. The present invention may be implemented using hardware comprising several distinct elements, and using a suitably programmed computer. In the case of the device being described as several elements, several of these elements may be embodied by one and the same item of hardware. The mere fact that certain measures are described separately does not indicate that a combination of these measures cannot be used to advantage.