Skip to Main Content
The Freeze-Tag Problem is a scenario in which there is “n” number of robots; n-1 ones are “asleep” and one is “awake”. Any awake robot can move and awaken another robot by touching it. The woken up robot can wake up other robots. The optimal goal is to minimize the required time to awaken all the sleeping robots. We present a simulated annealing approximation which improves an existing solution and runs in a short period of time.