Optimal Grid Exploration by Asynchronous Oblivious Robots

86  0  Download (0) ✓

Full text

(1)

Optimal Grid Exploration by Asynchronous Oblivious Robots

Franck Petit

INRIA/LIP6-CNRS/UPMC

(2)

Impossibility Results (1)

(3)

! Impossible if k<3

Impossibility Results (1)

(4)

! Impossible if k<3

Impossibility Results (1)

Remark

Any terminal configuration of any (probabilistic or deterministic) exploration protocol for a grid of n nodes using k < n oblivious robots contains at least one tower.

(5)

! Impossible if k<3

Impossibility Results (1)

Remark

Any terminal configuration of any (probabilistic or deterministic) exploration protocol for a grid of n nodes using k < n oblivious robots contains at least one tower.

(6)

! Impossible if k<3

Impossibility Results (1)

Remark

Any terminal configuration of any (probabilistic or deterministic) exploration protocol for a grid of n nodes using k < n oblivious robots contains at least one tower.

(7)

! Impossible if k<3

Impossibility Results (1)

Remark

Any terminal configuration of any (probabilistic or deterministic) exploration protocol for a grid of n nodes using k < n oblivious robots contains at least one tower.

Initial configuration

(8)

Impossibility Results (2)

(9)

Impossibility Results (2)

! Impossible for (2,2)-grid if k=3

(10)

Impossibility Results (2)

! Impossible for (2,2)-grid if k=3

(11)

Impossibility Results (2)

! Impossible for (2,2)-grid if k=3

Impossible [Devismes 2009]

(12)

Impossibility Results (3)

! Impossible for (3,3)-grid if k=3

(13)

Impossibility Results (3)

! Impossible for (3,3)-grid if k=3

" Tower of size 3 At most one new node is visited

(14)

Impossibility Results (3)

! Impossible for (3,3)-grid if k=3

" Tower of size 3 At most one new node is visited

" Tower of size 2

• The tower remains idle 4 new nodes are visited

(7 distinct nodes are visited in total)

(15)

Impossibility Results (3)

! Impossible for (3,3)-grid if k=3

" Tower of size 3 At most one new node is visited

" Tower of size 2

• The tower remains idle 4 new nodes are visited

(7 distinct nodes are visited in total)

Impossible since n=6

(16)

Impossibility Results (3)

! Impossible for (3,3)-grid if k=3

" Tower of size 3 At most one new node is visited

" Tower of size 2

• The tower remains idle 4 new nodes are visited

(7 distinct nodes are visited in total)

Impossible since n=6

• The tower moves Multiplicity of size 3

(17)

Impossibility Results (4)

! Impossible for (3,3)-grid if k=4

(18)

Impossibility Results (4)

! Impossible for (3,3)-grid if k=4

(19)

Impossibility Results (4)

! Impossible for (3,3)-grid if k=4

(20)

Impossibility Results (4)

! Impossible for (3,3)-grid if k=4

(21)

Impossibility Results (4)

! Impossible for (3,3)-grid if k=4

(22)

Impossibility Results (4)

! Impossible for (3,3)-grid if k=4

(23)

Impossibility Results (4)

! Impossible for (3,3)-grid if k=4

(24)

Algorithm

(25)

Algorithm

"Setting

! (i,j)-grids such that j >3

! k=3

! Towerless initial configuration

(26)

Algorithm

(27)

Algorithm

"Phase 1: Set-Up phase

"Phase 2: Orientation phase

"Phase 3: Exploration phase

(28)

Algorithm

(29)

Algorithm

"Phase 2: Orientation phase

(30)

Algorithm

"Phase 2: Orientation phase

(31)

Algorithm

"Phase 2: Orientation phase

(0,0)

(32)

Algorithm

"Phase 2: Orientation phase

(0,0) (0,1) (0,2) (0,3) (0,4) (0,5) (0,6) (0,7) (0,8) (0,9)

(1,0) (1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9)

(2,0) (2,1) (2,2) (2,3) (2,4) (2,5) (2,6) (2,7) (2,8) (2,9)

(3,0) (3,1) (3,2) (3,3) (3,4) (3,5) (3,6) (3,7) (3,8) (3,9)

(4,0) (4,1) (4,2) (4,3) (4,4) (4,5) (4,6) (4,7) (4,8) (4,9)

(33)

Algorithm

"Phase 2: Orientation phase

(0,0) (0,1) (0,2) (0,3) (0,4) (0,5) (0,6) (0,7) (0,8) (0,9)

(1,0) (1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9)

(2,0) (2,1) (2,2) (2,3) (2,4) (2,5) (2,6) (2,7) (2,8) (2,9)

(3,0) (3,1) (3,2) (3,3) (3,4) (3,5) (3,6) (3,7) (3,8) (3,9)

(4,0) (4,1) (4,2) (4,3) (4,4) (4,5) (4,6) (4,7) (4,8) (4,9)

(34)

Algorithm

(0,0) (0,1) (0,2) (0,3) (0,4) (0,5) (0,6) (0,7) (0,8) (0,9)

(1,0) (1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9)

(2,0) (2,1) (2,2) (2,3) (2,4) (2,5) (2,6) (2,7) (2,8) (2,9)

(3,0) (3,1) (3,2) (3,3) (3,4) (3,5) (3,6) (3,7) (3,8) (3,9)

(4,0) (4,1) (4,2) (4,3) (4,4) (4,5) (4,6) (4,7) (4,8) (4,9)

"Phase 3: Exploration phase

(35)

Algorithm

(0,0) (0,1) (0,2) (0,3) (0,4) (0,5) (0,6) (0,7) (0,8) (0,9)

(1,0) (1,1) (1,2) (1,3) (1,4) (1,5) (1,6) (1,7) (1,8) (1,9)

(2,0) (2,1) (2,2) (2,3) (2,4) (2,5) (2,6) (2,7) (2,8) (2,9)

(3,0) (3,1) (3,2) (3,3) (3,4) (3,5) (3,6) (3,7) (3,8) (3,9)

(4,0) (4,1) (4,2) (4,3) (4,4) (4,5) (4,6) (4,7) (4,8) (4,9)

"Phase 3: Exploration phase

(36)

Algorithm

(37)

Algorithm

"Phase1: Set-Up

(38)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(39)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(40)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(41)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(42)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(43)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(44)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(45)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(46)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(47)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(48)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(49)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(50)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(51)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(52)

Algorithm

"Phase1: Set-Up

! Configuration of type Leader

There is exactly one robot at a corner of the grid

(53)

Algorithm

(54)

Algorithm

"Phase1: Set-Up

(55)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(56)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(57)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(58)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(59)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(60)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(61)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(62)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(63)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(64)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(65)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(66)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(67)

Algorithm

"Phase1: Set-Up

! Configuration of type Choice

There are at least two robots at a corner of the grid

(68)

Algorithm

"Phase1: Set-Up

! Configuration of type Undefined All the corners of the grid are free

(69)

Algorithm

"Phase1: Set-Up

! Configuration of type Undefined All the corners of the grid are free

(70)

Algorithm

"Phase1: Set-Up

! Configuration of type Undefined All the corners of the grid are free

(71)

Algorithm

"Phase1: Set-Up

! Configuration of type Undefined All the corners of the grid are free

(72)

Algorithm

"Phase1: Set-Up

! Configuration of type Undefined All the corners of the grid are free

(73)

Algorithm

"Phase1: Set-Up

! Configuration of type Undefined All the corners of the grid are free

(74)

Algorithm

"Phase1: Set-Up

! Configuration of type Undefined All the corners of the grid are free

(75)

Algorithm

" Special grid: (3,2) grids

(76)

Algorithm

" Special grid: (3,2) grids

(77)

Algorithm

" Special grid: (3,2) grids

(78)

Algorithm

" Special grid: (3,2) grids

(79)

Algorithm

" Special grid: (3,2) grids

Final Configuration

(80)

Special case

" (3,3)-grids with 5 robots

(81)

Special case

" (3,3)-grids with 5 robots

(82)

Special case

" (3,3)-grids with 5 robots

(83)

Special case

" (3,3)-grids with 5 robots

(84)

Special case

" (3,3)-grids with 5 robots

(85)

Special case

" (3,3)-grids with 5 robots

Final Configuration

(86)

Conclusion

! 5 robots are necessary and sufficient to explore (3,3)-grids

! 3 robots are necessary and sufficient to explore (i,j)-grids

such that j >3

! 4 robots are necessary and sufficient to explore (2,2)-grids

Figure

Updating...

References

Download (N/A - 86 Page - 534.22KB)
Related subjects :