Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Recherche

Afficher tous les résultats pour

Accueil

Concept

Optimisation par essaims particulaires

Science formelle
Mathématiques
Optimisation (mathématiques)
Métaheuristique

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (31)

Page 2 sur 2

Controlling pedestrian flows with moving walkways

Michel Bierlaire, Nicholas Alan Molyneaux

Moving walkways are pedestrian dedicated hardware which generally decrease pedestrian travel time. We propose the utilization of these devices to dynamically control pedestrian flows in order to improve pedestrian dynamics. Three variations of a control st ...

PERGAMON-ELSEVIER SCIENCE LTD2022

Memory of Motion for Initializing Optimization in Robotics

Teguh Santoso Lembono

Many robotics problems are formulated as optimization problems. However, most optimization solvers in robotics are locally optimal and the performance depends a lot on the initial guess. For challenging problems, the solver will often get stuck at poor loc ...

EPFL2022

Finding symmetry breaking order parameters with Euclidean neural networks

Mario Geiger

Curie's principle states that "when effects show certain asymmetry, this asymmetry must be found in the causes that gave rise to them." We demonstrate that symmetry equivariant neural networks uphold Curie's principle and can be used to articulate many sym ...

AMER PHYSICAL SOC2021

Systematic Method for the Energy-Saving Potential Calculation of Air Conditioning Systems via Data Mining. Part II: A Detailed Case Study

Shen Yang, Xianlin Wang

Increased data monitoring enables the energy-efficient operation of air-conditioning systems via data-mining. The latter is projected to have lesser consumption but more comprehensive diagnosis than traditional methods. Following the companion paper that p ...

2021

Multikernel Regression with Sparsity Constraint

Michaël Unser, Shayan Aziznejad

In this paper, we provide a Banach-space formulation of supervised learning with generalized total-variation (gTV) regularization. We identify the class of kernel functions that are admissible in this framework. Then, we propose a variation of supervised l ...

2021

Wind Farm Area Shape Optimization Using Newly Developed Multi-Objective Evolutionary Algorithms

Fernando Porté Agel, Nicolas Otto Kirchner Bossi

In recent years, wind farm layout optimization (WFLO) has been extendedly developed to address the minimization of turbine wake effects in a wind farm. Considering that increasing the degrees of freedom in the decision space can lead to more efficient solu ...

MDPI2021

Convergence of adaptive algorithms for constrained weakly convex optimization

Volkan Cevher, Ahmet Alacaoglu, Yurii Malitskyi

We analyze the adaptive first order algorithm AMSGrad, for solving a constrained stochastic optimization problem with a weakly convex objective. We prove the

\tilde O(t^{-1/2})

rate of convergence for the squared norm of the gradient of Moreau envelope, ...

2021

Data-Driven Convergence Prediction of Astrobots Swarms

Denis Gillet, Jean-Paul Richard Kneib, Matin Macktoobian

Astrobots are robotic artifacts whose swarms are used in astrophysical studies to generate the map of the observable universe. These swarms have to be coordinated with respect to various desired observations. Such coordination\footnote{\z{A coordination sa ...

2022

Pareto-like sequential sampling heuristic for global optimisation

Katrin Beyer, Mahmoud S. M. Shaqfa

In this paper, we propose a simple global optimisation algorithm inspired by Pareto’s principle. This algorithm samples most of its solutions within prominent search domains and is equipped with a self-adaptive mechanism to control the dynamic tightening o ...

2021

Bias free multiobjective active learning for materials design and discovery

Berend Smit, Kevin Maik Jablonka, Shi-Lin Wang

The design rules for materials are clear for applications with a single objective. For most applications, however, there are often multiple, sometimes competing objectives where there is no single best material and the design rules change to finding the se ...

Nature Research2021

Gramian-Based Adaptive Combination Policies For Diffusion Learning Over Networks

Ali H. Sayed, Stefan Vlaski

This paper presents an adaptive combination strategy for distributed learning over diffusion networks. Since learning relies on the collaborative processing of the stochastic information at the dispersed agents, the overall performance can be improved by d ...

IEEE2021