Research on task allocation of multi-target search with swarm robots Online publication date: Fri, 31-Oct-2014
by Guo-You Zhang; Jian-Chao Zeng; Song-Dong Xue
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 7, No. 3, 2014
Abstract: One of basic problems of multi-target search in swarm robotics is how to allocate the tasks of searching targets among robots. In this paper, the formal description of the problem of multi-target search and task allocation are presented. Inspired by division labour of wasp swarm, the strategy of task allocation of multi-target search based on the response threshold model in swarm robotics is prompted. The states of robots are divided into wander, search and marking target. Robots adopt random search in global search phase and particle swarm algorithm in local search in order to illustrate the effectiveness of the strategy. Simulation results show the method is effective and feasible.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com