dc.contributor.authorWin Myat Soe.en_US
dc.date.accessioned2008-09-17T09:36:23Z
dc.date.available2008-09-17T09:36:23Z
dc.date.copyright2005en_US
dc.date.issued2005
dc.identifier.urihttp://hdl.handle.net/10356/3736
dc.description.abstractThis 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.en_US
dc.rightsNanyang Technological Universityen_US
dc.subjectDRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics
dc.titleSimulation for complete coverage path planningen_US
dc.typeThesisen_US
dc.contributor.supervisorHo, Yeong Khingen_US
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen_US
dc.description.degreeMaster of Science (Computer Control and Automation)en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record