Distributed Solution of Road Lighting Problem Over Multi-Agent Networks

Abstract

In this study, we consider the solution of the road lighting problem by distributed algorithms over multi-agent networks where the objective is to determine the powers of the lamps that provide the desired road lighting level for a given road profile. The road is modeled as multiple road sections each with a length of 50 meters where a lighting pole is located in the middle of each section. Under given assumptions, the illumination levels of the road sections are expressed as linear functions of the powers of the lamps. When the processing units in the lighting poles can communicate wirelessly with the neighboring processing units and make simple calculations, it is shown that the power levels of the lamps that provide the desired lighting level for each road section can be calculated in a distributed manner. Finally, the model and the proposed solution has been verified by a numerical example.

GraParT: A MATLAB Toolbox for Partitioning Directed Graphs

“…The last two decades have seen the rapid development of consensus algorithms due to their use in practical problems consisting of multiple agents [1][2][3][4][5][6]. These algorithms find applications in the fields of robotics [1,2], computer networks [3], distributed optimization [4], and social networks [5].…”

“…The last two decades have seen the rapid development of consensus algorithms due to their use in practical problems consisting of multiple agents [1][2][3][4][5][6]. These algorithms find applications in the fields of robotics [1,2], computer networks [3], distributed optimization [4], and social networks [5]. Most of the work consider the consensus problem as agreement on a single state which requires the underlying graph of the network to have a spanning tree [7,8].…”