An evac­u­a­tion prob­lem is a search prob­lem where more then one agent is look­ing for the tar­get. The search ter­mi­nates when all agents have found the tar­get. In the wire­less com­mu­ni­ca­tion model, two agents can ex­change in­for­ma­tion wire­lessly. There­fore, as soon as one agent finds the tar­get, the other agents learn the lo­ca­tion of the tar­get and they can im­me­di­ately go to the tar­get's lo­ca­tion. In the face-to-face com­mu­ni­ca­tion model, two agents can only ex­change in­for­ma­tion when they stand at the same lo­ca­tion at the same time.

In this talk I will pre­sent re­sults from these two pa­pers:

• Czy­zow­icz, Geor­giou, Kranakis, Narayanan, Opa­trny and Vogten­hu­ber. Evac­u­at­ing Ro­bots from a Disk Using Face-to-Face Com­mu­ni­ca­tion. In­ter­na­tional Con­fer­ence on Al­go­rithms and Com­plex­ity (CIAC), Lec­ture Notes in Com­puter Sci­ence, Vol­ume 9079: 140-152, 2015.
• Czy­zow­icz, Gasie­niec, Gorry, Kranakis, Mar­tin and Pajak. Evac­u­at­ing Ro­bots via Un­known Exit in a Disk. In­ter­na­tional Sym­po­sium on DIS­trib­uted Com­put­ing (DISC), Lec­ture Notes in Com­puter Sci­ence, Vol­ume 8784: 122-136, 2014.