Award Date

May 2024

Degree Type

Thesis

Degree Name

Master of Science in Computer Science

Department

Computer Science

First Committee Member

Laxmi Gewali

Second Committee Member

Mingon Kang

Third Committee Member

John Minor

Fourth Committee Member

Henry Selvaraj

Number of Pages

38

Abstract

Algorithms dealing with the construction of high clearance collision-free paths in the presence of polygonal obstacles is an important problem in robotics and transportation engineering. Method of extracting collision-free paths guided by triangulation of free space is examined. Two algorithms for improving the standard triangulation guided algorithms are presented. The time complexities of the presented algorithms are analysed. Finally, further applications of the proposed techniques are discussed.

Keywords

collision free paths; high clearance; robotics engineering; transportation engineering; triangulation guided algorithms; triangulation guided high clearance paths

Disciplines

Computer Sciences

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