University of British Columbia
Characterizing minimum-length coordinated motions for two disks
Abstract
dc:descriptionWe study the problem of determining optimal coordinated motions for two disc robots in an otherwise obstacle-free plane. Using the total path length traced by the two disc centres as a measure of distance, we give an exact characterization of a shortest (but not necessarily unique) collision-avoiding motion for all initial and final configurations of the robots. The individual paths are composed of at most six (straight or circular-arc) segments, and their total length can be expressed as a simple integral with a closed form solution depending only on the initial and final configuration of the robots. Furthermore, the paths can be parametrized in such a way that (i) only one robot is moving at any given time (decoupled motion), or (ii) the angle between the two robots’ centres changes monotonically.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Computer Science
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 2017
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Liu, Paul
Rights
dc:rights- Statement dc:rights
-
- Attribution 4.0 International
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/61351