The deployment of multi-agent systems in presence of obstacle deals with autonomous motion of agents toward a specified target by sensing each other and boundaries of obstacles. In this paper, asynchronous, scalable, distributed algorithm is used to deploy agents. Boundaries of obstacles are modeled by virtual agents. Algorithm was implemented by solving continuous n-median problem called generalized Fermat-Weber problem. It is shown that deployment is performed when position of real agents are the geometric median of their Voronoi cells. Simulation results show the validity of the proposed algorithm very well.
Volume Subject Area:
Dynamic Systems and Control
This content is only available via PDF.
You do not currently have access to this content.
