Learn More
We propose a deenition of \regular synthesis," more general than those suggested by other authors such as Boltyanskii and Brunovsk y, and an even more general notion of \regular presynthesis." We give a complete proof of the corresponding suuciency theorem, a slightly weaker version of which had been stated in an earlier article, with only a rough outline(More)
|{ We show that, for feedforward nets with a single hidden layer, a single output node, and a \transfer function" Tanhs, the net is uniquely determined by its input-output map, up to an obvious nite group of symmetries (permutations of the hidden nodes, and changing the sign of all the weights associated to a particular hidden node), provided that the net(More)
We illustrate the use of the techniques of modern geometric optimal control theory by studying the shortest paths for a model of a car that can move forwards and backwards. This problem was discussed in recent work by Reeds and Shepp who showed, by special methods, (a) that shortest path motion could always be achieved by means of trajectories of a special(More)
We present two versions of the maximum principle for nonsmooth hybrid optimal control problems, the first one of which requires differentia-bility along the reference trajectory and yields an adjoint equation of the usual kind, while the second one only requires approximability to first order by Lipschitz maps, and yields an adjoint differential inclusion(More)