1. ROBOT RENDEZVOUS: 3 OR MORE ROBOTS USING 1-DIMENSIONAL SEARCH !!!!!!! !

2. OVERVIEW Approaches Tested Search approaches ensuring coverage of the entire environment Final Approach Reduces problem to a 1-Dimensional Search

3. APPROACHES TESTED

4. GRID-BASED ITERATIVELY DEEPENING DEPTH FIRST SEARCH

5. GRID-BASED IDDFS

6. Based on "Symmetric Rendezvous in Planar Environments with and without Obstacles" - Isler, et. al. Decompose map into square cells of side length L Search each cell by counterclockwise perimeter circumnavigation Neighboring cells recursively searched on discovery up to a prescribed depth D. D increases each iteration by the square root of 2. Iterative deepening attempts to simulate optimality of breadth-first search.

7. GRID-BASED IDDFS: SIMULATION VIDEO

9. GRID-BASED IDDFS: CHALLENGES C-space obstacles not known beforehand. Need to use on-line wall following. Too large a cell size may cause areas to be exempt from the search For these reasons, we did not use this Corridor 1 (searched first) Corridor 3 (never searched) Corridor 2 (searched second)

10. LOGARITHMICALLY EXPANDING SPIRAL SEARCH

11. LOG SPIRAL SEARCH Based on "Spiral Search as an Efficient Mobile Robotic Search Technique" - Burlington, et. al. Generate a series of coordinates with increasing distance from origin for robot to “goto” When in contact with obstacles, wall follow using Bug2 Algorithm to navigate to next point

21. LOG SPIRAL SEARCH: CHALLENGES Online wall following in an unknown environment has it’s challenges Areas may be completely bypassed if robot starts in a long tunnel Future work would require a different approach to logarithmic spiraling in order to bypass this problem.

22. HIGHER-LEVEL RENDEZVOUS IN UNBOUNDED ENVIRONMENT LF1F3F2

23. HIGHER-LEVEL RENDEZVOUS IN UNBOUNDED ENVIRONMENT

24. R1 R2 R3 R4

25. R1 R2 R3 R4

26. R1 R2 R3 R4 INTERMEDIATE RENDEZVOUS

27. R1 R2 R3 R4

28. R1 R2 R3 R4

29. R1 R2 R3 R4 INTERMEDIATE RENDEZVOUS

30. R1 R2 R3 R4

31. R1 R2 R3 R4 FINAL RENDEZVOUS

32. R1 R2 R3 R4

33. 1-DIMENSIONAL RENDEZVOUS IN BOUNDED ENVIRONMENT FINAL APPROACH METHODOLOGY LFFF

34. METHODOLOGY: SYSTEM OVERVIEW

35. METHODOLOGY: OUTER BOUNDARY USING DISTBUG

36. METHODOLOGY: 1D SEARCH

37. METHODOLOGY: HIGHER-LEVEL RENDEZVOUS R1 R2 R3 R4

38. METHODOLOGY: HIGHER-LEVEL RENDEZVOUS R1 RENDEZVOUS R3 R4 R2 COLLISION AVOIDANCE

39. METHODOLOGY: SIMULATION VIDEO

40. METHODOLOGY: COMPETITIVE RATIO

41. METHODOLOGY: ADVANTAGES Its a very elegant and compact algorithm Search area is greatly reduced (so we don't need to guarantee coverage of the environment) Localization isn't as crucial after the outer boundary has been found (thus much easier to apply to real world applications) Less parameter adjustment is needed to apply to real world applications

42. METHODOLOGY: CONSTRAINTS Method works only for bounded environment There is an upper bound on the number of robots that can perform the search with adequate "personal space" (deadlock) Rendezvous area is n*R (where R is the communication range and n is the number of robots) We can't guarantee coverage of the environment

43. FURTHER WORK Add communication between colliding robots to lessen the time consumed by 1D search Better search for outer bound Decrease rendezvous area Test algorithm with more robots