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 covera...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/3735 |
| _version_ | 1826110330507362304 |
|---|---|
| author | Win Myat Soe. |
| author2 | Ho, Yeong Khing |
| author_facet | Ho, Yeong Khing Win Myat Soe. |
| author_sort | Win Myat Soe. |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T02:32:37Z |
| format | Thesis |
| id | ntu-10356/3735 |
| institution | Nanyang Technological University |
| last_indexed | 2024-10-01T02:32:37Z |
| publishDate | 2008 |
| record_format | dspace |
| spelling | ntu-10356/37352023-07-04T15:01:07Z 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 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) 2008-09-17T09:36:21Z 2008-09-17T09:36:21Z 2005 2005 Thesis http://hdl.handle.net/10356/3735 Nanyang Technological University application/pdf |
| spellingShingle | DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics Win Myat Soe. Simulation for complete coverage path planning |
| title | 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_short | Simulation for complete coverage path planning |
| title_sort | simulation for complete coverage path planning |
| topic | DRNTU::Engineering::Electrical and electronic engineering::Control and instrumentation::Robotics |
| url | http://hdl.handle.net/10356/3735 |
| work_keys_str_mv | AT winmyatsoe simulationforcompletecoveragepathplanning |