Multi-agent Search using Voronoi partitions

Guruprasad, KR and Ghose, D (2007) Multi-agent Search using Voronoi partitions. In: Proceedings of the International Conference on Advances in Control and Optimization of Dynamical Systems (ACODS2007), February 2007, Bangalore.

Preview

PDF 10.1.1.116.1546.pdf - Published Version Download (1MB)

Abstract

This paper addresses the problem of multiagent search in an unknown environment. The agents are autonomous in nature and are equipped with necessary sensors to carry out the search operation. The uncertainty, or lack of information about the search area is known a priori as a probability density function. The agents are deployed in an optimal way so as to maximize the one step uncertainty reduction. The agents continue to deploy themselves and reduce uncertainty till the uncertainty density is reduced over the search space below a minimum acceptable level. It has been shown, using LaSalle’s invariance principle, that a distributed control law which moves each of the agents towards the centroid of its Voronoi partition, modified by the sensor range leads to single step optimal deployment. This principle is now used to devise search trajectories for the agents. The simulations were carried out in 2D space with saturation on speeds of the agents. The results show that the control strategy per step indeed moves the agents to the respective centroid and the algorithm reduces the uncertainty distribution to the required level within a few steps.

Item Type:	Conference Paper
Department/Centre:	Division of Mechanical Sciences > Aerospace Engineering(Formerly Aeronautical Engineering)
Date Deposited:	21 Oct 2011 04:36
Last Modified:	21 Oct 2011 04:36
URI:	http://eprints.iisc.ac.in/id/eprint/41559

Actions (login required)

View Item