The path planning for autonomous robots by using greedy algorithm
碩士 === 國立屏東教育大學 === 資訊科學系 === 99 === The so-called problem of path planning refers to the computation of an optimal path for a robot to move from the origin to the destination without colliding with any obstacles. In this study, we mainly use three steps to solve the problem of path planning. First,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/51545946415975809102 |