Publications related to Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Polynomial Filtering for Fast Convergence in Distributed Consensus

In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods proposed in the literature address the consensus averaging problem by distributed linear iter ...

2009

A hybrid model predictive control scheme for multi-agent containment and distributed sensing

Giancarlo Ferrari Trecate

This paper deals with distributed sensing over a field by means of a multi-agent control architecture. A leader/follower scheme is built up for exploring an environment by properly sensing areas of interest. By means of a control architecture based on dece ...

2009

Multiple Heterogeneous Ant Colonies with Information Exchange

Arash Arami, Bijan Rahimzadeh Rofoee

The method of multiple heterogeneous ant colonies with information exchange (MHACIE) is presented in this paper with emphasis on the speed of finding the optimal solution and the corresponding computational complexity. The proposed method which is inspired ...

2008

A Statistical Analysis of Certain Iterative Learning Control Algorithms

Alireza Karimi, Roland Longchamp, Mark Edward John Butcher

Iterative Learning Control (ILC) is a technique used to improve the tracking performance of systems carrying out repetitive tasks, which are affected by deterministic disturbances. The achievable performance is greatly degraded, however, when non-repeating ...

2008

A Fast Thresholded Landweber Algorithm for General Wavelet Bases: Application to 3D Deconvolution Microscopy

Michaël Unser, Cédric René Jean Vonesch

Wavelet-domain

ℓ _{ 1 }

-regularization is a promising approach to deconvolution. The corresponding variational problem can be solved using a “thresholded Landweber” (TL) algorithm. While this iterative procedure is simple to implement, it is known to ...

IEEE2008

Memory-efficient Krylov subspace techniques for solving large-scale Lyapunov equations

Daniel Kressner

This paper considers the solution of large-scale Lyapunov matrix equations of the form AX + XA(T) = -bb(T). The Arnoldi method is a simple but sometimes ineffective approach to deal with such equations. One of its major drawbacks is excessive memory consum ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?

Martin Vetterli, Patrick Thiran, Florence Bénézit, Patrick Denantes

Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. Inspired by heat diffusion, they compute the average of ...

Institute of Electrical and Electronics Engineers2008

Hitting time of large subsets of the hypercube

Jiri Cerny, Véronique Gayrard

We study the simple random walk on the n-dimensional hypercube, in particular its hitting times of large (possibly random) sets. We give simple conditions on these sets ensuring that the properly rescaled hitting time is asymptotically exponentially distri ...

2008

Numerical methods and models relevant to transportation applications

Michaël Clément Louis Ghislain Thémans

In this thesis, we focus on standard classes of problems in numerical optimization: unconstrained nonlinear optimization as well as systems of nonlinear equations. More precisely, we consider two types of unconstrained nonlinear optimization problems. On t ...

EPFL2007

A class of algorithms for distributed constraint optimization

Adrian Petcu

Multi Agent Systems (MAS) have recently attracted a lot of interest because of their ability to model many real life scenarios where information and control are distributed among a set of different agents. Practical applications include planning, schedulin ...

EPFL2007

Walkman: A Communication-Efficient Random-Walk Algorithm for Decentralized Optimization

Graph Chatbot

Chat with Graph Search

Polynomial Filtering for Fast Convergence in Distributed Consensus

A hybrid model predictive control scheme for multi-agent containment and distributed sensing

Multiple Heterogeneous Ant Colonies with Information Exchange

A Statistical Analysis of Certain Iterative Learning Control Algorithms

A Fast Thresholded Landweber Algorithm for General Wavelet Bases: Application to 3D Deconvolution Microscopy

Memory-efficient Krylov subspace techniques for solving large-scale Lyapunov equations

Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?

Hitting time of large subsets of the hypercube

Numerical methods and models relevant to transportation applications

A class of algorithms for distributed constraint optimization

Numerical methods and models relevant to transportation applications

Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?

Hitting time of large subsets of the hypercube

Multiple Heterogeneous Ant Colonies with Information Exchange

A class of algorithms for distributed constraint optimization

Memory-efficient Krylov subspace techniques for solving large-scale Lyapunov equations

A Fast Thresholded Landweber Algorithm for General Wavelet Bases: Application to 3D Deconvolution Microscopy

Polynomial Filtering for Fast Convergence in Distributed Consensus

A Statistical Analysis of Certain Iterative Learning Control Algorithms

A hybrid model predictive control scheme for multi-agent containment and distributed sensing