AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

28
AsynchDP Example
  • date post

    19-Dec-2015
  • Category

    Documents

  • view

    216
  • download

    2

Transcript of AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

Page 1: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

AsynchDP Example

Page 2: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

a

b

c

d

s t1

1

1 1

1

1

3

15

4

23

1

1 1

AsynchDP: initial graph

Page 3: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

a

b

c

d

s t1

1

1 1

1

0

3

15

4

23

1

1 1

AsynchDP: iteration 1

Page 4: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

a

b

c

d

s t1

1

1 3

1

0

3

15

4

23

1

1 1

AsynchDP: iteration 2

Page 5: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

a

b

c

d

s t1

6

5 2

1

0

3

15

4

23

1

1 1

AsynchDP: iteration 3

Page 6: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

a

b

c

d

s t

7

6

4 2

1

0

3

15

4

23

1

1 1

AsynchDP: iteration 4

Page 7: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

a

b

c

d

s t

7

5

4 2

1

0

3

15

4

23

1

1 1

AsynchDP: iteration 5

Page 8: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

a

b

c

d

s t

6

5

4 2

1

0

3

15

4

23

1

1 1

AsynchDP: iteration 6

Page 9: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

a

b

c

d

s t

6

5

4 2

1

0

3

15

4

23

1

1 1

AsynchDP: shortest path

Page 10: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA* Example

Page 11: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA* - initialization

a

b

c

d

s t

0

0

0 0

0

0

2

23

2

35

1

2 3

Page 12: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA* - trial 1

a

b

c

d

s t

2

2

2 0

1

0

2

23

2

35

1

2 3

Page 13: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA* - trial 2

a

b

c

d

s t

4

4

2 0

1

0

2

23

2

35

1

2 3

Page 14: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA* - trial 3

a

b

c

d

s t

4

4

3 4

1

0

2

23

2

35

1

2 3

Page 15: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA* - trial 4

a

b

c

d

s t

5

4

3 4

1

0

2

23

2

35

1

2 3

Page 16: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA* - trial 5

a

b

c

d

s t

5

4

3 4

1

0

2

23

2

35

1

2 3

Page 17: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA*(2) Example

Page 18: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA*(2) - initialization

a

b

c

d

s t

0

0

0 0

0

0

2

23

2

35

1

2 3

Page 19: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA*(2) – trial 1

a

b

c

d

s t

2

2

2 0

1

0

2

23

2

35

1

2 3

Page 20: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA*(2) – trial 2

a

b

c

d

s t

4

4

3 4

1

0

2

23

2

35

1

2 3

Page 21: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA*(2) – trial 3

a

b

c

d

s t

5

4

3 4

1

0

2

23

2

35

1

2 3

Page 22: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

LRTA*(2) – trial 4

a

b

c

d

s t

5

4

3 4

1

0

2

23

2

35

1

2 3

Page 23: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

Naive Assignment problem example #1

Page 24: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

Naive algorithm

(1,x1), (2,x2), (3,x3)2x111403

(2,x2), (3,x3)1x330402

(2,x2)2x220201

(1,x2)2x210000

current assignment

bid incr.

preferred object

bidder

p3

p2

p1

round

Page 25: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

Naive Assignment Problemexample #2

Page 26: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

(2,x1), (1,x2)0x120004

(3,x1), (1,x2)0x210003

(3,x1), (2,x2)0x130002

(1,x1), (2,x2)0x220001

(1,x1)0x110000

current assignment

bid incr.

preferred object

bidder

p3

p2

p1

round

Page 27: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

Improved Assignment Problem example #3

Page 28: AsynchDP Example. a b c d s t 1 1 1 1 1 1 3 1 5 4 2 3 1 11 AsynchDP: initial graph.

(2,x1), (1,x2)2x1204

(3,x1), (1,x2)2x2103

(3,x1), (2,x2)2x1302

(1,x1), (2,x2)2x2201

(1,x1)x11000

current assignment

bid incr.

preferred object

bidder

p3

p2

p1

round