Search results for "dynamics."
showing 10 items of 9637 documents
Ping-pong configurations and circular orders on free groups
2017
We discuss actions of free groups on the circle with "ping-pong" dynamics; these are dynamics determined by a finite amount of combinatorial data, analogous to Schottky domains or Markov partitions. Using this, we show that the free group $F_n$ admits an isolated circular order if and only if n is even, in stark contrast with the case for linear orders. This answers a question from (Mann, Rivas, 2016). Inspired by work of Alvarez, Barrientos, Filimonov, Kleptsyn, Malicet, Menino and Triestino, we also exhibit examples of "exotic" isolated points in the space of all circular orders on $F_2$. Analogous results are obtained for linear orders on the groups $F_n \times \mathbb{Z}$.
Sensitivity analysis for time optimal orbit transfer
2001
The minimum time transfer of a satellite around the Earth is studied. In order to deal numerically with low thrusts, a new method is introduced: Based on a so-called noncontrollability function, the technique treats the ha1 time as a parameter. The properties of the method arc studied by means of an infinite dimensional sensitivity analysis. The numerical results obtained by this approach for very low thrusts are given
3D Geosynchronous Transfer of a Satellite: Continuation on the Thrust
2003
The minimum-time transfer of a satellite from a low and eccentric initial orbit toward a high geostationary orbit is considered. This study is preliminary to the analysis of similar transfer cases with more complicated performance indexes (maximization of payload, for instance). The orbital inclination of the spacecraft is taken into account (3D model), and the thrust available is assumed to be very small (e.g. 0.3 Newton for an initial mass of 1500 kg). For this reason, many revolutions are required to achieve the transfer and the problem becomes very oscillatory. In order to solve it numerically, an optimal control model is investigated and a homotopic procedure is introduced, namely cont…
Energy minimization of single input orbit transfer by averaging and continuation
2006
AbstractThis article deals with the transfer between Keplerian coplanar orbits using low propulsion. We focus on the energy minimization problem and compute the averaged system, proving integrability and relating the corresponding trajectories to a three-dimensional Riemannian problem that is analyzed in details. The geodesics provide approximations of the extremals of the energy minimization problem and can be used in order to evaluate the optimal trajectories of the time optimal and the minimization of the consumption problems with continuation methods. In particular, minimizing trajectories for transfer towards the geostationary orbit can be approximated in suitable coordinates by straig…
Conjugate and cut loci of a two-sphere of revolution with application to optimal control
2008
Abstract The objective of this article is to present a sharp result to determine when the cut locus for a class of metrics on a two-sphere of revolution is reduced to a single branch. This work is motivated by optimal control problems in space and quantum dynamics and gives global optimal results in orbital transfer and for Lindblad equations in quantum control.
Convergence rate of a relaxed inertial proximal algorithm for convex minimization
2018
International audience; In a Hilbert space setting, the authors recently introduced a general class of relaxed inertial proximal algorithms that aim to solve monotone inclusions. In this paper, we specialize this study in the case of non-smooth convex minimization problems. We obtain convergence rates for values which have similarities with the results based on the Nesterov accelerated gradient method. The joint adjustment of inertia, relaxation and proximal terms plays a central role. In doing so, we highlight inertial proximal algorithms that converge for general monotone inclusions, and which, in the case of convex minimization, give fast convergence rates of values in the worst case.
Geometric and numerical techniques to compute conjugate and cut loci on Riemannian surfaces
2014
International audience; We combine geometric and numerical techniques - the Hampath code - to compute conjugate and cut loci on Riemannian surfaces using three test bed examples: ellipsoids of revolution, general ellipsoids, and metrics with singularities on S2 associated to spin dynamics.
Geometric optimal control of elliptic Keplerian orbits
2005
This article deals with the transfer of a satellite between Keplerian orbits. We study the controllability properties of the system and make a preliminary analysis of the time optimal control using the maximum principle. Second order sufficient conditions are also given. Finally, the time optimal trajectory to transfer the system from an initial low orbit with large eccentricity to a terminal geostationary orbit is obtained numerically.
On some Riemannian aspects of two and three-body controlled problems
2009
The flow of the Kepler problem (motion of two mutually attracting bodies) is known to be geodesic after the work of Moser [20], extended by Belbruno and Osipov [2, 21]: Trajectories are reparameterizations of minimum length curves for some Riemannian metric. This is not true anymore in the case of the three-body problem, and there are topological obstructions as observed by McCord et al. [19]. The controlled formulations of these two problems are considered so as to model the motion of a spacecraft within the influence of one or two planets. The averaged flow of the (energy minimum) controlled Kepler problem with two controls is shown to remain geodesic. The same holds true in the case of o…
Modélisation, Analyse et Traitement de l'Information
2016
Mes activités de recherche s’articulent, d’une part, autour de l’instrumentation et du génie biomédical,et, d’autre part, autour du traitement et de la transmission non linéaire de l’information. Elles sebasent sur la modélisation des signaux à partir de modèles non linéaires (principalement modèles deréaction-diffusion. . . ) continus (EDP) et discrets (numériques). Dans cette partie, d’un point de vuefondamental, des phénomènes dynamiques complexes ou chaotiques sont caractérisés à travers l’analyse,la classification, la reconnaissance des motifs dans des signaux physiologiques ou issus des circuitsélectroniques. Un autre axe sur lequel je travaille concerne l’analyse et le traitement des…