Please use this identifier to cite or link to this item: https://idr.l4.nitk.ac.in/jspui/handle/123456789/7615
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGuruprasad, K.R.-
dc.contributor.authorGhose, D.-
dc.date.accessioned2020-03-30T10:02:33Z-
dc.date.available2020-03-30T10:02:33Z-
dc.date.issued2007-
dc.identifier.citationProceedings - ISVD 2007 The 4th International Symposium on Voronoi Diagrams in Science and Engineering 2007, 2007, Vol., , pp.91-100en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/7615-
dc.description.abstractIn this paper we analyze a deploy and search strategy for multi-agent systems. Mobile agents equipped with sensors carry out search operation in the search space. The lack of information about the search space is modeled as an uncertainty density distribution over the space, and is assumed to be known to the agents a priori. In each step, the agents deploy themselves in an optimal way so as to maximize per step reduction in the uncertainty density. We analyze the proposed strategy for convergence and spatial distributedness. The control law moving the agents has been analyzed for stability and convergence using LaSalle's invariance principle, and for spatial distributedness under a few realistic constraints on the control input such as constant speed, limit on maximum speed, and also sensor range limits. The simulation experiments show that the strategy successfully reduces the average uncertainty density below the required level. � 2007 IEEE.en_US
dc.titleDeploy and search strategy for multi-agent systems using Voronoi partitionsen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
File Description SizeFormat 
7615.pdf1.56 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.