Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


Distributed Learning in the Presence of Disturbances


C. Ramesh, M. Schmitt, J. Lygeros

European Control Conference (ECC)

We consider a problem where multiple agents must learn an action profile that maximises the sum of their utilities in a distributed manner. The agents are assumed to have no knowledge of either the utility functions or the actions and payoffs of other agents. These assumptions arise when modelling the interactions in a complex system and communicating between various components of the system are both difficult. In [1], a distributed algorithm was proposed, which learnt Pareto-efficient solutions in this problem setting. However, the approach assumes that all agents can choose their actions, which precludes disturbances. In this paper, we show that a modified version of this distributed learning algorithm can learn Pareto-efficient solutions, even in the presence of disturbances from a finite set. We apply our approach to the problem of ramp coordination in traffic control for different demand profiles.


Type of Publication:


No Files for download available.
% Autogenerated BibTeX entry
@InProceedings { RamSch:2016:IFA_5535,
    author={C. Ramesh and M. Schmitt and J. Lygeros},
    title={{Distributed Learning in the Presence of Disturbances}},
    booktitle={European Control Conference (ECC)},
Permanent link