Award Date

May 2016

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Laxmi Gewali

Second Committee Member

Fatma Nasoz

Third Committee Member

Justin Zhan

Fourth Committee Member

Henry Selvaraj

Number of Pages

51

Abstract

Constructing collision-free paths in Euclidean space is a well-known problem in computational geometry having applications in many fields that include robotics, VLSI, and covert surveillance. In this thesis, we investigate the development of efficient algorithms for constructing a collision-free path that satisfies directional and visibility constraints. We present algorithms for constructing monotone collision-free paths that tend to maximize the visibility of the boundary of obstacles. We also present implementation of some monotone path planning algorithms in Java Programming Language.

Keywords

collision free; monotone; monotone path; visibility; watchman route; waterfall model

Disciplines

Computer Sciences

Language

English


Share

COinS