REVIEW 2 cited by
Some Remarks on Controllability of the Liouville Equation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We revisit the work of Roger Brockett on controllability of the Liouville equation, with a particular focus on the following problem: Given a smooth controlled dynamical system of the form $\dot{x} = f(x,u)$ and a state-space diffeomorphism $\psi$, design a feedback control $u(t,x)$ to steer an arbitrary initial state $x_0$ to $\psi(x_0)$ in finite time. This formulation of the problem makes contact with the theory of optimal transportation and with nonlinear controllability. For controllable linear systems, Brockett showed that this is possible under a fairly restrictive condition on $\psi$. We prove that controllability suffices for a much larger class of diffeomorphisms. For nonlinear systems defined on smooth manifolds, we review a recent result of Agrachev and Caponigro regarding controllability on the group of diffeomorphisms. A corollary of this result states that, for control-affine systems satisfying a bracket generating condition, any $\psi$ in a neighborhood of the identity can be implemented using a time-varying feedback control law that switches between finitely many time-invariant flows. We prove a quantitative version which allows us to describe the implementation complexity of the Agrachev-Caponigro construction in terms of a lower bound on the number of switchings.
Forward citations
Cited by 2 Pith papers
-
Collective steering in finite time: controllability on $\text{GL}^+(n,\mathbb{R})$
Kalman rank condition is necessary and sufficient for arbitrarily fast steering of invertible rearrangements of identical linear systems, but no continuous universal feedback law exists.
-
Constructive approximate transport maps with normalizing flows
A ReLU-perceptron neural ODE with piecewise-constant controls can transport a Gaussian to any lighter-tailed target to arbitrary accuracy in KL divergence, with explicit switch counts.
Discussion (0). Continue with ORCID to comment.