Triangle Evacuation of 2 Agents in the Wireless Model

We consider an evacuation problem from a non-obtuse triangle with 2 agents under a wireless communication model. Given a non-obtuse triangle ABC, we deploy two agents on a point S on the perimeter of the triangle. Two search agents move at the same unit speed, and look for an exit placed on the perimeter of the triangle. Our goal is to design an algorithm that outputs trajectories for searchers that minimize the evacuation time. Evacuation time is the time that is required for the last agent to reach the exit. In contrast to an equilateral triangle, we are dealt with a lack of symmetry when exploring the perimeter of a non-obtuse triangle. Thus, by having either an algorithm or an adversary choosing the starting edge or/and the starting point S on the chosen edge, we analyze an upper and lower bounds on 4 different algorithmic problems.