Local search techniques for multi-agent constraint optimization problems
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Omnidirectional video streaming is usually implemented based on the representations of tiles, where the tiles are obtained by splitting the video frame into several rectangular areas and each tile is converted into multiple representations with different r ...
Machine intelligence greatly impacts almost all domains of our societies. It is profoundly changing the field of mechanical engineering with new technical possibilities and processes. The education of future engineers also needs to adapt in terms of techni ...
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 ...
In this thesis, we consider commercial buildings with available heating, ventilation and air conditioning (HVAC) systems, and develop methods to assess and exploit their energy storage and production potential to collectively offer ancillary services to th ...
This work develops an effective distributed algorithm for the solution of stochastic optimization problems that involve partial coupling among both local constraints and local cost functions. While the collection of networked agents is interested in discov ...
In this paper, we focus on the problem of minimizing a network of state facilities that provide essential public services (schools, offices, and hospitals). The goal is to reduce the size of the network in order to minimize the costs associated with it. Ho ...
Adaptive networks have the capability to pursue solutions of global stochastic optimization problems by relying only local interactions within neighborhoods. The diffusion of information through repeated interactions allows for globally optimal behavior, w ...
In this paper we present an adaptive robust optimization framework for the day-ahead scheduling of Active Distribution Networks (ADNs) where the controlled devices are distributed Energy Storage Systems (ESSs). First, the targeted problem is formulated usi ...
In this work, we revisit a classical incremental implementation of the primal-descent dual-ascent gradient method used for the solution of equality constrained optimization problems. We provide a short proof that establishes the linear (exponential) conver ...
In this paper we present the application of the interior-point decomposition (IPD) method, which was originally formulated for stochastic programming, to optimization problems involving multiple agents that are coupled through constraints and objectives. I ...