Cart (Loading....) | Create Account
Close category search window

Evolutionary Computation Approach to Decentralized Multi-robot Task Allocation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ping-an Gao ; Sch. of Inf. Sci. & Eng., Central South Univ., Changsha, China ; Zi-xing Cai ; Ling-li Yu

The problem of allocating exploration tasks to a team of mobile robots was addressed in this paper. Each task consists of a site location that needs to be explored by a robot. The objective of the allocation is to minimize the maximum path cost of the robots. Auction-based methods are efficient for decentralized mobile robots to allocate tasks. However, the quality of allocation cannot be guaranteed. This paper presents a decentralized allocation algorithm which combines a sequential single-task auction and task transfer among the robots. After all of the tasks are auctioned off, the robots of the same sub-team transfer tasks to improve the quality of allocation. In order to increase the efficiency of task transferring, the tasks allocated to the sub-team are clustered using an orthogonal genetic algorithm. Each robot determines which tasks should be transferred, and to which robots the tasks should be transferred according to the clusters. The validity of the proposed algorithm was verified with some benchmarks of vehicle routing problem and traveling salesperson problem. The results showed that the proposed algorithm decreased the robot path costs 40% more than that of a well-known auction-based algorithm in most cases.

Published in:

Natural Computation, 2009. ICNC '09. Fifth International Conference on  (Volume:5 )

Date of Conference:

14-16 Aug. 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.