Name
Abstract | ||
|---|---|---|
In 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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/ISVD.2007.15 | ISVD |
Keywords | Field | DocType |
search space,mobile agent,space technology,simulation experiment,computational geometry,mechanical engineering,multiagent systems,biological systems,multi agent systems,aeronautical engineering,uncertainty,multi agent system,convergence,stability analysis | Convergence (routing),Mathematical optimization,Space technology,Control theory,Computational geometry,A priori and a posteriori,Mobile agent,Multi-agent system,Voronoi diagram,Density distribution,Mathematics | Conference |
ISBN | Citations | PageRank |
0-7695-2869-4 | 5 | 0.68 |
References | Authors | |
6 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| K. R. Guruprasad | 1 | 53 | 7.99 |
| Debasish Ghose | 2 | 777 | 71.57 |