decentralized task allocation for heterogeneous teams with cooperation constraints presented by: sin...
TRANSCRIPT
1
Decentralized Task Allocation for Heterogeneous Teams
with Cooperation Constraints
Presented by: Sin Ting, Angela, Lui
ARC Centre of Excellence for Autonomous Systems
Han-Lim Choi, Andrew K. Whitten, and Jonathan P. How
2
Outline
• Problem• Paper Contribution• Consensus Based Bundle Algorithm• Task Decomposition / Scoring• Task Elimination• Results
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)
4
Problem
Optimization:
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.
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
7
CBBA
1) Bundle- are tasks added based on time.- list based on location in the assignment
which incurs the largest score improvement.
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.
9
CBBA
10
CBBA - Example
Example & figures from MIT CBBA code
11
CBBA
Example & figures from MIT CBBA code
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
13
Task Decomposition & Scoring
Task Decomposition for Preferred Duo Task
14
Task Decomposition & Scoring
Task Decomposition for Required Duo Task
15
Task Decomposition & Scoring
Constraint to not allow a single agent to bid for the same task twice.
Constraint for required duo
16
Task Decomposition & Scoring
Optimization:
17
Task Decomposition & Scoring
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.
19
Decentralized Task Elimination
Final Proposed Algorithm:
20
Results
Track & Eliminate Task. Task allocation improvement over baseline CBBA.
Figure 1 from Paper
21
Results
Figure 2&3 from Paper
22
Questions?
?