| Summary: | 碩士 === 國立雲林科技大學 === 電機工程系碩士班 === 99 === This thesis is maining discuss multi-robot system which is based on searching algorithm and uses multiple searching algorithms to program a shortest motion path during the experiment. The robots record coordinates, action points, barrier points,and feasible points. When they execuate missions and return monitoring client construction of the map record until the searching conditions to be finished. The thesis is divided into two topics. One is single-point search path planning which uses searching algorithms to the heart and Flood-Fill Algorithm to calculate path and exercise to achieve single robot search and path planning. The other uses Depth-First-Search combined with Flood-Fill Algorithm to achieve multiple-robot search, uses searching multiple-point path planning, and uses Sequential Single-item Auction to distribute multiple-robot and multiple targets and acting paths. Whether on searching or planning path, the user interface to establish related informations using statistics method, and uses multiple mobile robots to verify the ways that they bring up are feasible.
|
|---|
