By Topic

Cooperative dynamic task-allocation through iterative agents' costs permutations

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

2 Author(s)
Keshmiri, S. ; Exp. Robot. Lab., Simon Fraser Univ., Burnaby, BC, Canada ; Payandeh, S.

We propose a multi-robot task-allocation strategy in which individuals' task assignments are carried out through the application of iterative permutations of agents' cost values that are associated with completing given tasks. Different possible permutations of agent-to-task assignments are calculated based on profile matrix that comprises all robotic agents' costs with regards to available tasks. The permutations that are calculated off-line are next used at runtime to dynamically and as per states of agents and available tasks ascertain the optimal agent-task allocations at every decision cycle. Proof of optimality of the adapted allocation strategy is presented. Performance of the proposed approach in multi-robot dynamic multi-task allocation scenario is demonstrated.

Published in:

Computational Intelligence for Security and Defence Applications (CISDA), 2012 IEEE Symposium on

Date of Conference:

11-13 July 2012