A Method for Finding the Routes of Mazes

Chang Ming Wu, Der-Cherng Liaw, Hung Tse Lee

研究成果: Paper同行評審

4 引文 斯高帕斯(Scopus)

摘要

In this paper, we propose a potential modified route-searching algorithm to find all feasible paths in a new place which is like an unknown maze. The maze-like place is assumed to be a region constructed by grids and each grid is supposed to have at most four directions for moving. A searching algorithm is developed to accomplish the required tasks for patrolling every path in the new place. Based on the traditional depth-first graph traversal method, we build up a local-maze coordinate system to record the visited pathway. The main results of this paper will give an experiment simulation to demonstrate the success of proposed design.

原文American English
DOIs
出版狀態Published - 9 1月 2019
事件2018 International Automatic Control Conference, CACS 2018 - Taoyuan, Taiwan
持續時間: 4 11月 20187 11月 2018

Conference

Conference2018 International Automatic Control Conference, CACS 2018
國家/地區Taiwan
城市Taoyuan
期間4/11/187/11/18

指紋

深入研究「A Method for Finding the Routes of Mazes」主題。共同形成了獨特的指紋。

引用此