![Page 1: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/1.jpg)
1
Decentralized Task Allocation for Heterogeneous Teams
with Cooperation Constraints
Presented by: Sin Ting, Angela, LuiARC Centre of Excellence for Autonomous Systems
Han-Lim Choi, Andrew K. Whitten, and Jonathan P. How
![Page 2: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/2.jpg)
2
Outline
• Problem• Paper Contribution• Consensus Based Bundle Algorithm• Task Decomposition / Scoring• Task Elimination• Results
![Page 3: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/3.jpg)
3
Problem
Allocation task of agents to tasks.Given a list of J tasks of K types, and I
agents of M types. Find the mapping of tasks to a required set of agents that maximize some global reward.
a) Solo Task (Tracking)b) Preferred Duo Task (Tracking)c) Required Duo Task (Tracking and
striking)
![Page 4: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/4.jpg)
4
ProblemOptimization:
![Page 5: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/5.jpg)
5
Contribution
• Extending Consensus Bundle Based Algorithm to number of agents on task.
• Constraints due to requirements & preferences of cooperation.
• Embedding cooperation constraints in the scorings structure.
• Decentralized methods to eliminate invalid assignment.
![Page 6: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/6.jpg)
6
Consensus Based Bundle Algorithm (CBBA)Consensus-Based Decentralized Auctions for Robust Task
Allocation (2009, H.Choi, L.Brunet and J.P.How)Based off winning agents and winning
scores. 1) Bundle 2) Consensus (Conflict Resolution)Each agent carries five vectors
![Page 7: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/7.jpg)
7
CBBA
1) Bundle- are tasks added based on time.- list based on location in the assignment
which incurs the largest score improvement.
![Page 8: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/8.jpg)
8
CBBA
2) Conflict Resolution- the winning bid list.- the winning agent list.- d time stamps of the last information
update.If is different between two agents, the
agent that receives the message will update, leave, or reset the task assignment.
If there are any changes, the bundle is released and the agent has to replan.
![Page 9: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/9.jpg)
9
CBBA
![Page 10: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/10.jpg)
10
CBBA - Example
Example & figures from MIT CBBA code
![Page 11: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/11.jpg)
11
CBBA
Example & figures from MIT CBBA code
![Page 12: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/12.jpg)
12
Consensus Based Bundle Algorithm (CBBA)
Advantages:• Polynomial time algorithm. • Scales well with network and numbers
of tasks. • Accounts for inconsistent information
among networked agents. Disadvantages:• Allocation only allows one agent per
task
![Page 13: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/13.jpg)
13
Task Decomposition & Scoring
Task Decomposition for Preferred Duo Task
![Page 14: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/14.jpg)
14
Task Decomposition & Scoring
Task Decomposition for Required Duo Task
![Page 15: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/15.jpg)
15
Task Decomposition & Scoring
Constraint to not allow a single agent to bid for the same task twice.
Constraint for required duo
![Page 16: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/16.jpg)
16
Task Decomposition & ScoringOptimization:
![Page 17: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/17.jpg)
17
Task Decomposition & Scoring
![Page 18: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/18.jpg)
18
Decentralized Task Elimination
After CBBA converges, the subtask allocations for required duo tasks will either be:
1) Both subtasks are assigned.2) Both subtasks are not assigned.3) Only one subtask is assigned.
Since is the same for all agents when CBBA converges, each agent can reconstruct the bundle of other agents and eliminate invalid tasks in their bundle.
![Page 19: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/19.jpg)
19
Decentralized Task Elimination
Final Proposed Algorithm:
![Page 20: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/20.jpg)
20
Results
Track & Eliminate Task. Task allocation improvement over baseline CBBA.
Figure 1 from Paper
![Page 21: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/21.jpg)
21
Results
Figure 2&3 from Paper
![Page 22: Decentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints](https://reader035.vdocuments.us/reader035/viewer/2022062310/56816737550346895ddbe901/html5/thumbnails/22.jpg)
22
Questions?
?