Honours Project Title:
Time and Energy Trade-offs in Evacuating Robots from a Disk
Consider an evacuation problem for two robots starting in the centre of a disk with radius 1. The robots have to evacuate via an exit in an unknown location on the perimeter of the disk and can move at a constant speed of 1. While past studies have focused on minimising evacuation time, research into time and energy trade-offs is needed. This project investigates time and energy trade-offs in different evacuation algorithms, where energy is the sum of the lengths of the trajectories of the two robots. The project considers two communication models: wireless and face-to-face communication. An energy-optimal algorithm is introduced and compared to different algorithms in both communication models, analysing the trade-offs between time and energy.
- Report.pdf - the written report of the project - Simulations.zip - the simulations along with Java source code (refer to README.txt files in the zip file)