Simulation for complete coverage path planning

This thesis consists of 2 parts. -Part B-Coverage path planning is the determination of a path that a robot must take in order to pass over each point in an environment. Applications include vacuuming, floor scrubbing, and inspection. This dissertation presents a simulation study of complete coverag...

Full description

Saved in:
Bibliographic Details
Main Author: Win Myat Soe.
Other Authors: Ho, Yeong Khing
Format: Theses and Dissertations
Published: 2008
Subjects:
Online Access:http://hdl.handle.net/10356/3736
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
id sg-ntu-dr.10356-3736
record_format dspace
spelling sg-ntu-dr.10356-37362023-07-04T15:01:18Z Simulation for complete coverage path planning Win Myat Soe. Ho, Yeong Khing School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics This thesis consists of 2 parts. -Part B-Coverage path planning is the determination of a path that a robot must take in order to pass over each point in an environment. Applications include vacuuming, floor scrubbing, and inspection. This dissertation presents a simulation study of complete coverage path planning using simple back and fork motion. It also reviews some coverage path planning algorithms and problems. Master of Science (Computer Control and Automation) 2008-09-17T09:36:23Z 2008-09-17T09:36:23Z 2005 2005 Thesis http://hdl.handle.net/10356/3736 Nanyang Technological University application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
topic DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics
spellingShingle DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics
Win Myat Soe.
Simulation for complete coverage path planning
description This thesis consists of 2 parts. -Part B-Coverage path planning is the determination of a path that a robot must take in order to pass over each point in an environment. Applications include vacuuming, floor scrubbing, and inspection. This dissertation presents a simulation study of complete coverage path planning using simple back and fork motion. It also reviews some coverage path planning algorithms and problems.
author2 Ho, Yeong Khing
author_facet Ho, Yeong Khing
Win Myat Soe.
format Theses and Dissertations
author Win Myat Soe.
author_sort Win Myat Soe.
title Simulation for complete coverage path planning
title_short Simulation for complete coverage path planning
title_full Simulation for complete coverage path planning
title_fullStr Simulation for complete coverage path planning
title_full_unstemmed Simulation for complete coverage path planning
title_sort simulation for complete coverage path planning
publishDate 2008
url http://hdl.handle.net/10356/3736
_version_ 1772828712671117312