Publication

Interior Point Decomposition for Multi-Agent Optimization

Related publications (64)

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.

Coordination and Sampling in Distributed Constraint Optimization

Brammert Ottens

The Distributed Constraint Optimization (DCOP) framework can be used to model a wide range of optimization problems that are inherently distributed. A distributed optimization problem can be viewed as a problem distributed over a set of agents, where agent ...

EPFL2012

On the limiting behavior of distributed optimization strategies

Ali H. Sayed

Motivated by recent developments in the context of adaptation over networks, this work establishes useful results about the limiting global behavior of diffusion and consensus strategies for the solution of distributed optimization problems. It is known th ...

IEEE2012

, ,

As the Internet of Things grows to large scale, its components will increasingly be controlled by selfinterested agents. For example, sensor networks will evolve to community sensing where a community of agents combine their data into a single coherent str ...

2012

Distributed Constraint Optimization under Stochastic Uncertainty

Boi Faltings, Thomas Léauté

In many real-life optimization problems involving multiple agents, the rewards are not necessarily known exactly in advance, but rather depend on sources of exogenous uncertainty. For instance, delivery companies might have to coordinate to choose who shou ...

2011

Hybrid Simulated Annealing and Its Application to Optimization of Hidden Markov Models for Visual Speech Recognition

Jong Seok Lee

We propose a novel stochastic optimization algorithm, hybrid simulated annealing (SA), to train hidden Markov models (HMMs) for visual speech recognition. In our algorithm, SA is combined with a local optimization operator that substitutes a better solutio ...

2010

Today's supply networks consist of a certain amount of logistics objects that are enabled to interact with each other and to decide autonomously upon their next steps: in other words, they exhibit a certain degree of autonomous cooperation. Therefore, mode ...

Elsevier2010

2010

Simple Monte Carlo model for crowd dynamics

Francesco Piazza

In this paper, we introduce a simple Monte Carlo method for simulating the dynamics of a crowd. Within our model a collection of hard-disk agents is subjected to a series of two-stage steps, implying (i) the displacement of one specific agent followed by ( ...

2010

Hidden information is a critical issue for the successful delivery of services in grid systems. It arises when the agents (hardware and software resources) employed to serve a task belong to multiple administrative domains, thus rendering monitoring of rem ...

Elsevier2010

Modifier-adaptation methodology for real-time optimization

Alejandro Gabriel Marchetti

The process industries are characterized by a large number of continuously operating plants, for which optimal operation is of economic importance. However, optimal operation is particularly difficult to achieve when the process model used in the optimizat ...

EPFL2009