Simulation for complete coverage path planning
Simulation for complete coverage path planning
This thesis consits of 2 parts. -Part A-. 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)
- Nanyang Technological University Singapore
DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics, :Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics [DRNTU], 004
DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics, :Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics [DRNTU], 004
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!