  We introduce and study a new search-type problem with ($n+1$)-robots on a
disk. The searchers (robots) all start from the center of the disk, have unit
speed, and can communicate wirelessly. The goal is for a distinguished robot
(the queen) to reach and evacuate from an exit that is hidden on the perimeter
of the disk in as little time as possible. The remaining $n$ robots (servants)
are there to facilitate the queen's objective and are not required to reach the
hidden exit. We provide upper and lower bounds for the time required to
evacuate the queen from a unit disk. Namely, we propose an algorithm specifying
the trajectories of the robots which guarantees evacuation of the queen in time
always better than $2 + 4(\sqrt{2}-1) \frac{\pi}{n}$ for $n \geq 4$ servants.
We also demonstrate that for $n \geq 4$ servants the queen cannot be evacuated
in time less than $2+\frac{\pi}{n}+\frac{2}{n^2}$.
