Picture map of Europe with pins indicating European capital cities

Open Access research with a European policy impact...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by Strathclyde researchers, including by researchers from the European Policies Research Centre (EPRC).

EPRC is a leading institute in Europe for comparative research on public policy, with a particular focus on regional development policies. Spanning 30 European countries, EPRC research programmes have a strong emphasis on applied research and knowledge exchange, including the provision of policy advice to EU institutions and national and sub-national government authorities throughout Europe.

Explore research outputs by the European Policies Research Centre...

Distributed constraint optimisation for flexible network management

Athanasiadis, Dimitrios and Kockar, Ivana and McArthur, Stephen (2013) Distributed constraint optimisation for flexible network management. In: 2013 4th IEEE/PES Innovative Smart Grid Technologies Europe (ISGT EUROPE). IEEE, Piscataway, NJ., pp. 1-5. ISBN 9781479929849

Full text not available in this repository. Request a copy from the Strathclyde author

Abstract

This paper presents a network management approach formalised as a Distributed Constraint Optimization (DCOP) problem, in particular power flow management. In DCOP, a group of distributed agents work to assign variables' values that optimise a set of constraints applied to the variables. This provides a way to optimise a global function through message-passing between asynchronous agents, with certain performance guarantees. Max-sum algorithm, a message passing algorithm will be applied as it is the state of the art for solving DCOP problems. Max-sum algorithm gives a sufficiently good approximate solution which tends to reach optimality but with less computation and communication. To apply the max-sum algorithm the network model will be decomposed as a factor graph which maps directly onto it.