Geometric Bicriteria Optimal Path Problems
No Access Until
Permanent Link(s)
Collections
Other Titles
Author(s)
Abstract
A bicriteria optimal path simultaneously satisfies two bounds on two
measures of path quality. The complexity of finding such a path
depends on the particular choices of path quality. This thesis studies
bicriteria path problems in a geometric setting using several pairs of
path quality, including: path length measured according to different
norms (
For several cases, finding the bicriteria optimal path is shown to be
NP-hard. These NP-hard cases include minimizing path length in two
different norms, minimizing travel through two regions, and minimizing
length and total turn. In the last case, an
A main result of this thesis examines minimizing the Euclidean length
and number of links of a path. When the geometric setting of this
problem is a polygon without holes, this thesis presents an
Finally, some approximation algorithms are outlined for finding a minimum link path among polyhedral obstacles.