Award Date

8-1-2022

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Laxmi Gewali

Second Committee Member

Kazem Taghva

Third Committee Member

Venkata Prashant Modekurthy

Fourth Committee Member

Henry Selvaraj

Number of Pages

48

Abstract

Problems dealing with the development of efficient algorithms for constructing collision-free paths have been explored extensively. We review existing algorithms for constructing collision-free paths under turn-angle constraints. We examine the problem of computing collision-free paths in the presence of polygonal obstacles. We present an algorithm for identifying the placement of a source vertex so that the maximum number of obstacle vertices can be reached via the shortest path tree under turn-angle requirements. We also present some experimental results on the construction of collision-free paths in the presence of polygonal obstacles.

Keywords

Computer algorithms; Constraint programming (Computer science); Polygons--Computer programs

Disciplines

Computer Sciences

File Format

pdf

File Size

3000 KB

Degree Grantor

University of Nevada, Las Vegas

Language

English

Rights

IN COPYRIGHT. For more information about this rights statement, please visit http://rightsstatements.org/vocab/InC/1.0/

Download


Share

COinS