The Studies of Prison Breakers’ Problem
碩士 === 國立臺北大學 === 資訊管理研究所 === 99 === This paper addresses collision-free path planning algorithms, based on a higher geometry maze routing (HGMR) algorithm, for mobile robots with different velocities in a two- dimensional (2D) dynamic environment. The “Prison Breakers’ Problem” is defined as specia...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/38757061432587112945 |