By Topic

A Hierarchical Task Allocation Method Based on Task Case and its Application to Multi-Robot Hunting

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

4 Author(s)
Ying Ma ; Lab. of Complex Syst. & Intell. Sci., Chinese Acad. of Sci., Beijing ; Zhiqiang Cao ; Chao Zhou ; Min Tan

This paper proposes a hierarchical task allocation method, based on the matching of task cases. On the basis of hierarchical organization form of multi-robot system, the tasks are allocated by case matching, which is based on the combination of contract net and acquaintance net. After a new task is arrived, its features are synthesized and then it is matched from task cases library. When the stored items of matched case in the library are enough, high-layer manager will allocate the task to the selected low-layer manager directly, or else, it adopts contract net based allocation to each low-layer manager, who will bid to high-layer manager directly based on acquaintance net. The execution result of selected robots will be returned to the high-layer manager, who will update the cases library. The method is applied to multi-robot hunting to show its validity.

Published in:

Intelligent Networks and Intelligent Systems, 2008. ICINIS '08. First International Conference on

Date of Conference:

1-3 Nov. 2008