Collaborative Evacuation of Mobile Robots
Debasish Pattanayak, H. Ramesh, Partha Sarathi Mandal · 2020
Distributed evacuation of mobile robots has recently raised the interest of researchers. Czyzowicz et al. [1] introduced the evacuation problem minimizing the time required for the last searcher to reach the target. They showed the optimal evacuation time for two robots in the wireless model while achieved an upper and lower bound for two robots in the face-to-face model. This has been further improved in subsequent papers. The objective is to plan the path of robots such that the worst-case evacuation time can be minimized. In a variation with faulty robots not able to detect the exit, Czyzowicz et al. [2] focused on minimizing the evacuation time for the latest non-faulty robot. They presented a lower and upper bound for three robots where at most one is susceptible to crash fault with wireless communication. Please refer [3] for detailed related works.