94,920 research outputs found
Convex hull ranking algorithm for multi-objective evolutionary algorithms
AbstractDue to many applications of multi-objective evolutionary algorithms in real world optimization problems, several studies have been done to improve these algorithms in recent years. Since most multi-objective evolutionary algorithms are based on the non-dominated principle, and their complexity depends on finding non-dominated fronts, this paper introduces a new method for ranking the solutions of an evolutionary algorithm’s population. First, we investigate the relation between the convex hull and non-dominated solutions, and discuss the complexity time of the convex hull and non-dominated sorting problems. Then, we use convex hull concepts to present a new ranking procedure for multi-objective evolutionary algorithms. The proposed algorithm is very suitable for convex multi-objective optimization problems. Finally, we apply this method as an alternative ranking procedure to NSGA-II for non-dominated comparisons, and test it using some benchmark problems
Design and operations of gas transmission networks
Problems dealing with the design and the operations of gas transmission networks are challenging. The difficulty mainly arises from the simultaneous modeling of gas transmission laws and of the investment costs. The combination of the two yields a non- linear non-convex optimization problem. To obviate this shortcoming, we propose a new formulation as a multi-objective problem, with two objectives. The first one is the investment cost function or a suitable approximation of it; the second is the cost of energy that is required to transmit the gas. This energy cost is approximated by the total energy dissipated into the network. This bi-criterion problem turns out to be convex and easily solvable by convex optimization solvers. Our continuous optimization formulation can be used as an efficient continuous relaxation for problems with non-divisible restrictions such as a limited number of available commercial pipe dimensions.gas transmission networks, reinforcement, convex optimization
On Time Optimization of Centroidal Momentum Dynamics
Recently, the centroidal momentum dynamics has received substantial attention
to plan dynamically consistent motions for robots with arms and legs in
multi-contact scenarios. However, it is also non convex which renders any
optimization approach difficult and timing is usually kept fixed in most
trajectory optimization techniques to not introduce additional non convexities
to the problem. But this can limit the versatility of the algorithms. In our
previous work, we proposed a convex relaxation of the problem that allowed to
efficiently compute momentum trajectories and contact forces. However, our
approach could not minimize a desired angular momentum objective which
seriously limited its applicability. Noticing that the non-convexity introduced
by the time variables is of similar nature as the centroidal dynamics one, we
propose two convex relaxations to the problem based on trust regions and soft
constraints. The resulting approaches can compute time-optimized dynamically
consistent trajectories sufficiently fast to make the approach realtime
capable. The performance of the algorithm is demonstrated in several
multi-contact scenarios for a humanoid robot. In particular, we show that the
proposed convex relaxation of the original problem finds solutions that are
consistent with the original non-convex problem and illustrate how timing
optimization allows to find motion plans that would be difficult to plan with
fixed timing.Comment: 7 pages, 4 figures, ICRA 201
Non-Convex Distributed Optimization
We study distributed non-convex optimization on a time-varying multi-agent
network. Each node has access to its own smooth local cost function, and the
collective goal is to minimize the sum of these functions. We generalize the
results obtained previously to the case of non-convex functions. Under some
additional technical assumptions on the gradients we prove the convergence of
the distributed push-sum algorithm to some critical point of the objective
function. By utilizing perturbations on the update process, we show the almost
sure convergence of the perturbed dynamics to a local minimum of the global
objective function. Our analysis shows that this noised procedure converges at
a rate of
- …