Searching Algorithms Based Path Planning of Multiple Mobile Robots
碩士 === 雲林科技大學 === 電機工程系碩士班 === 98 === The thesis mainly researches searching algorithms based path planning of multiple mobile robots. There are three topices of the thesis. The first manner is the application of A* search algorithm to solve shortest path problem of single mobile robot, this object...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/52736810614081525685 |
| Summary: | 碩士 === 雲林科技大學 === 電機工程系碩士班 === 98 === The thesis mainly researches searching algorithms based path planning of multiple mobile robots. There are three topices of the thesis. The first manner is the application of A* search algorithm to solve shortest path problem of single mobile robot, this object can developed path planning foundation of multiple mobile robots. The second manner is the combination of A* search algorithm and greedy algorithm to solve the routing problem of single mobile robot, and apply 2-opt exchange heuristic to improve the path. The third manner is the combination of the second manner and sequential single-item auction method to solve the problem of multi-robot task allocation. In the article, a near optimal assignment of multi-robot path can be obtained.
|
|---|