Please use this identifier to cite or link to this item:
|Title:||Simulation for complete coverage path planning||Authors:||Win Myat Soe.||Keywords:||DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics||Issue Date:||2005||Abstract:||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.||URI:||http://hdl.handle.net/10356/3736||Rights:||Nanyang Technological University||Fulltext Permission:||restricted||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Theses|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.