A few bad (but polynomial!) solutions to the Freeze Tag Problem. Done for CSCI-719 at RIT.
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Failed to load latest commit information.
AlternatingGreedy.java
Edge.java
Graph.java
Greedy.java
MstTSP.java
OptimalTSP.java
Path.java
Point.java
Quicksortr.java
README.md
Robot.java
VHeap.java
input.txt
input2.txt

README.md

The Problem

Imagine a swarm of robots on the plane, such that all but one robot are "asleep" or in stand-by mode. To awaken a robot, a currently active robot must go to its location on the plane. Once a sleeping robot is awakened, it may assist in waking other sleeping robots. Our presentation deck including a more in-depth problem statement can be found here.

The Objective

Assuming general position principle, awaken every robot in the swarm in the shortest possible period of time. The general case of the Freeze Tag Problem is NP-hard.

The Writeup

Documentation and presentations for the project can be found online here.