On competitive strategies for external exploration of a convex polygon
department or school: Science, Faculty of
department or school: Computer Science, Department of
data provider: DSpace
degree campus: UBCV
creator: Clarkson, Kyle P.
issued: 2020-12-18T19:30:28Z
issued: 2020
related degree: Master of Science - MSc
degree grantor: University of British Columbia
description: In this thesis we consider the problem faced by an agent who is tasked with inspecting certain objects within the plane. In particular, given some starting position not interior to a convex polygon the agent must traverse through the plane to fully see all edges of the polygon. However traversal is expensive for the agent and so the agent would like to determine the shortest path it can take such that all edges of the polygon will be seen from the path. For all polygons and feasible starting positions we present an efficient algorithm for determining what the shortest path is by characterizing properties that any such path must exhibit. Next we consider how the agent should accomplish this task when it is only aware that the polygon it is to inspect is convex, but not its shape (i.e. location of edges.) In such a scenario the agent must search for the edges by traversing through the plane. Yet if such searching is not done in an efficient manner, the distance traversed may be unacceptably large with respect to the length of the optimal path. We discuss several strategies that the agent can employ that will ensure that the distance it traverses to see all edges is at most a constant times the length of the optimal path.
aggregated CHO: https://circle.library.ubc.ca/rest/handle/2429/76856
note: On Competitive Strategies for External Exploration of aConvex PolygonbyKyle P. ClarksonBSc (Hons), Brandon University, 2018A THESIS SUBMITTED IN PARTIAL FULFILLMENTOF THE REQUIREMENTS FOR THE DEGREE OFMaster of ScienceinTHE FACULTY OF GRADUATE AND POSTDOCTORALSTUDIES(Computer Science)The University of British Columbia(Vancouver)December 2020c© Kyle P. Clarkson, 2020The following individuals certify that they have read, and recommend to the Fac-ulty of Graduate and Postdoctoral Studies for acceptance, the thesis entitled:On Competitive Strategies for External Exploration of a Convex Poly-gonsubmitted by Kyle P. Clarkson in partial fulfillment of the requirements for thedegree of Master of Science in Computer Science.Examining Committee:Dr. Will Evans, Computer ScienceSupervisorDr. Nick Harvey, Computer ScienceSupervisory Committee MemberiiAbstractIn this thesis we consider the problem faced by an agent who is tasked with inspect-ing certain objects within the plane. In particular, given some starting position notinterior to a convex polygon the agent must traverse through the plane to fully seeall edges of the polygon. However traversal is expensive for the agent and so theagent would like to determine the shortest path it can take such that all edges ofthe polygon will be seen from the path. For all polygons and feasible starting posi-tions we present an efficient algorithm for determining what the shortest path is bycharacterizing properties that any such path must exhibit.Next we consider how the agent should accomplish this task when it is onlyaware that the polygon it is to inspect is convex, but not its shape (i.e. location ofedges.) In such a scenario the agent must search for the edges by traversing throughthe plane. Yet if such searching is not done in an efficient manner, the distancetraversed may be unacceptably large with respect to the length of the optimal path.We discuss several strategies that the agent can employ that will ensure that thedistance it …
has type: Thesis/Dissertation
date issued: 2021-05
is shown at: 10.14288/1.0395351
language: eng
degree discipline: Computer Science
provider: Vancouver : University of British Columbia Library
publisher: University of British Columbia
rights: Attribution-NonCommercial-NoDerivatives 4.0 International
rights URI: http://creativecommons.org/licenses/by-nc-nd/4.0/
scholar level: Graduate
type: Text
identifier URI: http://hdl.handle.net/2429/76856