Navigation problems for autonomous robots in distributed environments

Abstract

This thesis studies algorithms for Distributed Computing. More specifically however the project aimed to carry out research on the performance analysis of mobile robots in a variety of different settings. In a range of different network and geometric settings we investigate efficient algorithms for the robots to perform given tasks. We looked at a variety of different models when completing this work but focused mainly on cases where the robots have limited communication mechanisms. Within this framework we investigated cases where the robots were numerous to cases where they were few in number. Also we looked at scenarios where the robots involved had different limitations on the maximal speeds they could travel. When conducting this work we explored two main tasks carried out by the robots that became the primary theme of the study. These two main tasks are Robot Location Discovery and Robot Evacuation. To accomplish these tasks we constructed algorithms that made use of both randomised and deterministic approaches in their solutions