Back to search

NJIT

Mobile robot path planning based on hierarchical hexagonal decomposition

Abstract

dc:description.abstract

<p>In this thesis, a new algorithm based on hierarchical cell decomposition and artificial potential field is developed to solve the find-path problem for a mobile robot. The basic cell structure used for decomposition is a hexagon. The artificial potential field is based on an attractive force from the goal position and repelling forces from the obstacles. Computer simulations of the algorithm for various obstacle scenarios are also presented.</p>

Degree

thesis:*
Name thesis:degree_name
Master of Science in Electrical Engineering - (M.S.)
Discipline thesis:degree_discipline
Electrical and Computer Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Zheng, Dan
Contributors dc:contributor
  • Edwin Hou
  • Yun Q. Shi
  • Anthony D. Robbi

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/2689

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Zheng, Dan. Mobile robot path planning based on hierarchical hexagonal decomposition. https://digitalcommons.njit.edu/theses/2689