AsynchDP Example

a b c d s t AsynchDP: initial graph

a b c d s t AsynchDP: iteration 1

a b c d s t AsynchDP: iteration 2

a b c d s t AsynchDP: iteration 3

a b c d s t AsynchDP: iteration 4

a b c d s t AsynchDP: iteration 5

a b c d s t AsynchDP: iteration 6

a b c d s t AsynchDP: shortest path

LRTA* Example

LRTA* - initialization a b c d s t

LRTA* - trial 1 a b c d s t

LRTA* - trial 2 a b c d s t

LRTA* - trial 3 a b c d s t

LRTA* - trial 4 a b c d s t

LRTA* - trial 5 a b c d s t

LRTA*(2) Example

LRTA*(2) - initialization a b c d s t

LRTA*(2) – trial 1 a b c d s t

LRTA*(2) – trial 2 a b c d s t

LRTA*(2) – trial 3 a b c d s t

LRTA*(2) – trial 4 a b c d s t

Naive Assignment problem example #1

Naive algorithm (1,x 1 ), (2,x 2 ), (3,x 3 ) 2x1x (2,x 2 ), (3,x 3 )1x3x (2,x 2 )2x2x (1,x 2 )2x2x current assignmentbid incr. preferre d object bidde r p3p3 p2p2 p1p1 round

Naive Assignment Problem example #2

(2,x 1 ), (1,x 2 )0x1x (3,x 1 ), (1,x 2 )0x2x (3,x 1 ), (2,x 2 )0x1x (1,x 1 ), (2,x 2 )0x2x (1,x 1 )0x1x current assignmentbid incr. preferred object bidde r p3p3 p2p2 p1p1 round

Improved Assignment Problem example #3

(2,x 1 ), (1,x 2 ) 22 x1x1 20  4 (3,x 1 ), (1,x 2 ) 22 x2x2 10  3 (3,x 1 ), (2,x 2 ) 22 x1x1 30  2 (1,x 1 ), (2,x 2 ) 22 x2x2 20   1 (1,x 1 )  x1x1 100  0 current assignmentbid incr. preferred object bidde r p3p3 p2p2 p1p1 round