Search results for " optimization."
showing 10 items of 2333 documents
On local optima in minimum time control of the restricted three-body problem
2016
International audience; The structure of local minima for time minimization in the controlled three-body problem is studied. Several homotopies are systematically used to unfold the structure of these local minimizers, and the resulting singularity of the path associated with the value function is analyzed numerically.
Regularization of chattering phenomena via bounded variation controls
2018
In control theory, the term chattering is used to refer to strong oscillations of controls, such as an infinite number of switchings over a compact interval of times. In this paper we focus on three typical occurences of chattering: the Fuller phenomenon, referring to situations where an optimal control switches an infinite number of times over a compact set; the Robbins phenomenon, concerning optimal control problems with state constraints, meaning that the optimal trajectory touches the boundary of the constraint set an infinite number of times over a compact time interval; the Zeno phenomenon, referring as well to an infinite number of switchings over a compact set, for hybrid optimal co…
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.
Time Versus Energy in the Averaged Optimal Coplanar Kepler Transfer towards Circular Orbits
2015
International audience; The aim of this note is to compare the averaged optimal coplanar transfer towards circular orbits when the costs are the transfer time transfer and the energy consumption. While the energy case leads to analyze a 2D Riemannian metric using the standard tools of Riemannian geometry (curvature computations, geodesic convexity), the time minimal case is associated to a Finsler metric which is not smooth. Nevertheless a qualitative analysis of the geodesic flow is given in this article to describe the optimal transfers. In particular we prove geodesic convexity of the elliptic domain.
Solving chance constrained optimal control problems in aerospace via Kernel Density Estimation
2017
International audience; The goal of this paper is to show how non-parametric statistics can be used to solve some chance constrained optimization and optimal control problems. We use the Kernel Density Estimation method to approximate the probability density function of a random variable with unknown distribution , from a relatively small sample. We then show how this technique can be applied and implemented for a class of problems including the God-dard problem and the trajectory optimization of an Ariane 5-like launcher.
A combination of algebraic, geometric and numerical methods in the contrast problem by saturation in magnetic resonance imaging
2014
In this article, the contrast imaging problem by saturation in nuclear magnetic resonance is modeled as a Mayer problem in optimal control. The optimal solution can be found as an extremal solution of the Maximum Principle and analyzed with the recent advanced techniques of geometric optimal control. This leads to a numerical investigation based on shooting and continuation methods implemented in the HamPath software. The results are compared with a direct approach to the optimization problem and implemented within the Bocop toolbox. In complement lmi techniques are used to estimate a global optimum. It is completed with the analysis of the saturation problem of an ensemble of spin particle…
Minimum Time Control of the Restricted Three-Body Problem
2012
The minimum time control of the circular restricted three-body problem is considered. Controllability is proved on an adequate submanifold. Singularities of the extremal flow are studied by means of a stratification of the switching surface. Properties of homotopy maps in optimal control are framed in a simple case. The analysis is used to perform continuations on the two parameters of the problem: The ratio of the masses, and the magnitude of the control.
Enhancement and assessment of WKS variance parameter for intelligent 3D shape recognition and matching based on MPSO
2016
This paper presents an improved wave kernel signature (WKS) using the modified particle swarm optimization (MPSO)-based intelligent recognition and matching on 3D shapes. We select the first feature vector from WKS, which represents the 3D shape over the first energy scale. The choice of this vector is to reinforce robustness against non-rigid 3D shapes. Furthermore, an optimized WKS-based method for extracting key-points from objects is introduced. Due to its discriminative power, the associated optimized WKS values with each point remain extremely stable, which allows for efficient salient features extraction. To assert our method regarding its robustness against topological deformations,…
Drivers-Inspired Ants for Solving the Vehicle Routing Problem with Time Windows
2016
International audience; In our study, we develop a method that merges two information sources within ants colony optimization heuristic. Namely artificial ants which occurs for short term optimization and transporter's vehicles that occurs in long term and continuous optimization toward solving the real-world vehicle routing problem. This study is supported by a transporter (Upsilon) of the region of l'Yonne in France and a transport and logistics software development company (Tedies). Our method suits for transporters that use human planners to make decisions about their tours and intending to move to computer planners without drastically upsetting the drivers habits. Hence, the pledge of …
Scheduling independent stochastic tasks under deadline and budget constraints
2018
This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an ef…