Abstract
dc:description.abstractWe study a new search problem on the plane involving a robot and an immobile treasure, initially placed at distance 1 from each other. The length of an arc (a fence) within the perimeter of the corresponding circle, as well as the promise that the treasure is outside the fence, is given as part of the input. The goal is to devise movement trajectories so that the robot locates the treasure in minimum time. Although the presence of the fence limits searching uncertainty, the location of the fence is unknown, and worst case analysis is determined adversarially. Nevertheless, the robot has the ability to move in the interior of the circle. In particular the robot can attempt a number of chord-jump moves if it happens to be within the fence or if an endpoint of the fence is discovered. We study optimization and randomization algorithms using fence-jumping techniques.
Degree
thesis:*- Name thesis:degree_name
- Master of Computer Science (M.C.S.)
- Level thesis:degree_level
- Master's
- Discipline thesis:degree_discipline
- Computer Science
- Grantor dc:publisher
- Carleton University
- Year dc:date.issued
- 2017
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Steau, Ioana Alexandra
Subjects
dc:subject × 1Rights
dc:rights- Statement dc:rights
-
- Copyright © 2017 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.
- Language dc:language.iso
- en