28
Fr !ncis Cl!rke Université de Lyon Error !nd f !ll!cy in control 1

Error nd f ll cy in control · Francis Clarke Mathematics GTM 264 Functional Analysis, Calculus of Variations and Optimal Control Functional analysis owes much of its early impetus

  • Upload
    others

  • View
    4

  • Download
    0

Embed Size (px)

Citation preview

  • Francis ClarkeUniversité de Lyon

    Error and fallacy in control

    1

  • 1770 Lagrange

    Our first error was committed by Lagrange in 1770

    2

  • 04/20/2007 04:08 PMUntitled

    Page 1 of 1

    Joseph Louis Lagrange 1736-1813

    •Born in Turin, student of Euler•Replaces Euler in Berlin; later

    joins the Paris Academy

    •During the revolution : metric system, Ecole Normale and

    Ecole Polytechnique

    •Under Napoléon : senator, count of the Empire, grand officer of

    the Légion d’honneur

    •His ‘greatest treasure’ : his (very) young wife, whom he marries at the age of 56

    •Dies in Paris at the age of 77

    3

  • Ainsi c'est un problème de maximis et minimis de déterminer la courbe qui, par sa rotation autour de son axe formera une colonne capable de supporter la plus grande charge possible, la hauteur et la masse de la colonne étant données. Lagrange (1770) Sur la figure des colonnes

    To find the curve which by its revolution determines the column of greatest efficiency. Truesdell

    Lagrange’s design problem

    4

  • He proves the following(false) theorem:1770 Lagrange

    The optimal column is a cylinder

    the prejudging mistake: acting as if the answer is known, based on incorrect intuition or analogy, or wishful thinking

    5

  • minx(·)

    � b

    aL�x(t), x�(t)

    �dt

    He proves the following (false) theorem:

    If x∗ is an extremal satisfying Lvv�x(t), x�(t)

    �> 0 ∀ t,

    then x∗ is a weak local minimum for the problem.

    The mistake lies in assuming that a differentialequation like x� = x2 + 1 has a solution definedon the interval [a, b].

    the existence mistake

    1783 Legendre

    His proof is quite ingenious.

    6

  • 1

    Clarke

    Francis ClarkeFunctional Analysis, Calculus of Variations and Optimal Control

    Graduate Texts in Mathematics

    Functional Analysis, Calculus ofVariations and Optimal Control

    Francis Clarke

    Mathematics

    GTM264

    Functional Analysis, Calculus of Variations and Optimal Control

    Functional analysis owes much of its early impetus to problems that arise in the calculus of variations. In turn, the methods developed there have been applied to optimal control, an area that also requires new tools, such as nonsmooth analysis. ! is self-contained textbook gives a complete course on all these topics. It is written by a leading specialist who is also a noted expositor.

    ! is book provides a thorough introduction to functional analysis and includes many novel elements as well as the standard topics. A short course on nonsmooth analysis and geometry completes the " rst half of the book whilst the second half concerns the calculus of variations and optimal control. ! e author provides a comprehensive course on these subjects, from their inception through to the present. A notable feature is the inclusion of recent, unifying developments on regularity, multiplier rules, and the Pon-tryagin maximum principle, which appear here for the " rst time in a textbook. Other major themes include existence and Hamilton-Jacobi methods.

    ! e many substantial examples, and the more than three hundred exercises, treat such topics as viscosity solutions, nonsmooth Lagrangians, the logarithmic Sobolev inequality, periodic trajectories, and systems theory. ! ey also touch lightly upon several " elds of application: mechanics, economics, resources, " nance, control engineering.

    Functional Analysis, Calculus of Variations and Optimal Control is intended to support several di# erent courses at the " rst-year or second-year graduate level, on functional analysis, on the calculus of variations and optimal control, or on some combination. For this reason, it has been organized with customization in mind. ! e text also has considerable value as a reference. Besides its advanced results in the calculus of varia-tions and optimal control, its polished presentation of certain other topics (for example convex analysis, measurable selections, metric regularity, and nonsmooth analysis) will be appreciated by researchers in these and related " elds.

    9 7 8 1 4 4 7 1 4 8 1 9 7

    ISBN 978-1-4471-4819-7

    7

  • 1821 CauchyIn 1821 he proves the following (false) theorem:

    the prejudging mistake. But also the inadequate definition mistake

    The pointwise limit f(x) of a sequence ofcontinuous functions fi(x) is continuous

    Astonishing: Cauchy is the baron of analysis, author of

    800 articles, the inventor of epsilon/delta!

    8

  • He studies solutions uof Laplace’s equation

    uxx + uyy = 0

    1851 Riemann

    the existence mistake

    min

    �u2x + u

    2y

    �dx dy

    u = ϕ (prescribed) on ∂Ω

    (Dirichlet principle)

    He obtains one byconsidering

    which (he says) is evidently attained

    9

  • Poincaré is awarded the prize for showing that the reduced three-body problem is (essentially) stable.

    1889 Poincaré It is known that two planets constitute a stable system. In 1887 King Oscar offers a large prize for a solution of the n-body problem.

    BUT while the prize paper is in proof, serious errors are found. The final paper proves instability (!).

    the prejudging mistake

    10

  • 1960 Keller & Tadjbaksh

    the smoothness mistake

    They prove the following(false) theorem:

    The optimal columnhas zero width at two points

    11

  • 1968 Arrow

    the prejudging mistake

    x�(t) = f(x(t), u(t)) a.e.

    u(t) ∈ U a.e.

    state x(·) and control u(·)defined on [a, b]

    (x(a), x(b)) ∈ S

    min �(x(b)) where

    ���

    The necessaryconditions are known as the Maximum Principle

    The Nobel-winning economist proves, by economic

    reasoning, a much-cited version of the Maximum

    Principle for problems in which U = U(x).

    The conclusions are identical to the usual ones for

    the case in which U does NOT depend on x.

    12

  • 1976 Clarke

    the prejudging mistake

    He derives (incorrectly) the Hamiltonian inclusion necessary conditions.

    (x(a), x(b)) ∈ S

    x�(t) ∈ F (t, x(t)) a.e.�min �(x(b)) where

    differential inclusion

    (corrected in 2005)

    13

  • Lots of people, often, today

    The Deductive Method:

    1. Prove (a priori) that a solution exists2. Apply correct necessary conditions3. Identify (through elimination and comparison) a unique candidate.

    �the candidate solves the problem

    It is a fallacy to take existence for granted (to omit step 1) in applying the deductive method

    14

  • This fallacy is especially common in optimal control.

    Sometimes, existence is justified by the fact that a “real” phenomenon is being modeled.

    In logic, this is called the “fallacy of misplaced concreteness”.

    Occasionally, the class of controls is not even specified, or taken to be PWC (prejudge the answer)...

    15

  • For optimal control problems, a correct analysis would involve one of:

    • existence theory (measurable controls)• convexity• relaxed controls (measures)• verification functions (nonsmooth)

    (beyond the comfort zone of many engineers and economists)

    16

  • A major source of confusion is the dynamic programming approach (1950’s and 60’s): everything is assumed smooth, continuous, etc.

    This leads to a misleading climate: the ultimate smoothness mistake!

    Consider control systems that are GAC.

    x�(t) = f(x(t), u(t)) a.e.

    u(t) ∈ U a.e.

    GAC

    x�(t) = g(x(t)) a.e.

    stable⇐⇒

    17

  • x�(t) = g(x(t)) a.e.

    stableFact: ⇐⇒there is a smooth Lyapunov function

    But:

    x�(t) = f(x(t), u(t)) a.e.

    u(t) ∈ U a.e.

    GAC⇐⇒

    there is a controlLyapunov function (nonsmooth in general)

    18

  • Let us consider the issue of stabilizing feedbacks.

    x�(t) = f(x(t), u(t)) a.e.

    u(t) ∈ U a.e.

    GAC

    It is a fallacy to assume that k can be taken to be continuous. (Example: NHI)

    Goal: find k(x) with values in U such thatx�(t) = g(x(t)) := f(x(t), k(x(t)))

    is stable.

    19

  • Or: to consider solutions of x� = g(x)

    when g is discontinuous?

    Question: What does it mean to put a

    discontinuous function k(x) into f ?

    There is a longstanding inadequate definition error

    in considering discontinuous feedbacks

    20

  • �xy

    ��=

    �0 10 0

    � �xy

    �+

    �01

    �ux

    �� = u(t) ∈ [−1, 1] a.e.

    min T : x(T ) = y(T ) = 0

    Example: minimal time for the double integrator

    22.3 Problems with variable time 453

    Fig. 22.3 The switching curve and the time-optimal feedback synthesis

    We conclude that if time-optimal trajectories exist (for every initial condition), thenthey are described as above. It so happens that an existence theorem to be seen laterdoes apply to this example (namely Theorem 23.13, but let’s take our word for it fornow). Given this, the deductive method assures us that we have, in fact, identifiedthe optimal trajectories.4

    At this point, it is a matter of routine calculation to derive an explicit formula forthe corresponding optimal time as a function of the initial point (x,y). Letting thisoptimal time be denoted T (x,y), we find:

    T (x,y) =

    −y +

    √2y2 −4x if (x,y) lies to the left of Σ

    +y +√

    2y2 +4x if (x,y) lies to the right of Σ .

    It is of interest (and not difficult) to show that this minimal-time function T is contin-uous, and that T is smooth on the open set which is the complement of the switchingcurve Σ . However, T is nondifferentiable, and indeed, fails to be locally Lipschitz,at points on Σ . "#

    22.15 Exercise. (Very soft landing) Consider the system

    x ′′′(t) = u(t) ∈ [−1,1] ,

    and the problem of steering the state to rest at 0 in minimal time T , in the sense thatthe position x, the velocity x ′, and the acceleration x ′′ must all equal 0 at T . Showthat an optimal control is bang-bang with at most two switches. "#

    4 We should mention that minimal-time problems with linear dynamics, of which the soft land-ing problem is but one example, can be studied on a systematic basis using time reversal and atechnique called “backing out of the origin.” See Lee and Markus [30].

    21

  • So this kind of feedback is meaningless:the thin set fallacy

    dither !

    22

  • Sliding mode feedback

    stable

    nice k2(x, y)

    nice k1(x, y)

    k =

    �k1 below the line

    k2 above the line

    23

  • Theorem (Clarke, Ledyaev, Sontag, Subbotin 1997)

    A system is GAC if and only if it is stabilizable by feedback (in the sample-and-hold sense).

    progress has been made, notably:

    A rigorous approach to sliding feedback control (Clarke & Vinter 2009)

    24

  • There is a parallel universe of alternative facts out there. You must choose:

    The blue pill The red pill

    or

    25

  • The blue pill

    Minima are always attainedNecessary conditions always applyEquations have global smooth solutionsUnique extremals must be solutions Intuition is always rightDependences and value functions are smooth Controllable systems admit continuous stabilizing feedbacks and smooth control Lyapunov functions Nonlinear control systems are always linearizableThe values of a feedback on a set of measure zero can effectively steer a system

    26

  • The red pill

    “You take the red pill: ... all I’m offering is the truth. Nothing more.” (Morpheus)

    Welcome to the real world 27

  • It may be tempting to remain in the world of alternative facts:

    “Why oh why didn’t I take the blue pill?” (Cypher)

    “Truth emerges more readily from error than from confusion” (Francis Bacon 1611)

    But we must resist, and learn from our errors!

    28