A Method for Finding the Routes of Mazes

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

doi:10.1109/CACS.2018.8606753

A Method for Finding the Routes of Mazes

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

Institute of Electrical and Control Engineering

Research output: Contribution to conference › Paper › peer-review

4 Scopus citations

Abstract

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.

Original language	American English
DOIs	https://doi.org/10.1109/CACS.2018.8606753
State	Published - 9 Jan 2019
Event	2018 International Automatic Control Conference, CACS 2018 - Taoyuan, Taiwan Duration: 4 Nov 2018 → 7 Nov 2018

Conference

Conference	2018 International Automatic Control Conference, CACS 2018
Country/Territory	Taiwan
City	Taoyuan
Period	4/11/18 → 7/11/18

Access to Document

10.1109/CACS.2018.8606753

Cite this

@conference{888cba3e6938418e845f89e62dbb0f2b,

title = "A Method for Finding the Routes of Mazes",

abstract = "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.",

author = "Wu, {Chang Ming} and Der-Cherng Liaw and Lee, {Hung Tse}",

year = "2019",

month = jan,

day = "9",

doi = "10.1109/CACS.2018.8606753",

language = "American English",

note = "2018 International Automatic Control Conference, CACS 2018 ; Conference date: 04-11-2018 Through 07-11-2018",

}

TY - CONF

T1 - A Method for Finding the Routes of Mazes

AU - Wu, Chang Ming

AU - Liaw, Der-Cherng

AU - Lee, Hung Tse

PY - 2019/1/9

Y1 - 2019/1/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85062384310&partnerID=8YFLogxK

U2 - 10.1109/CACS.2018.8606753

DO - 10.1109/CACS.2018.8606753

M3 - Paper

AN - SCOPUS:85062384310

T2 - 2018 International Automatic Control Conference, CACS 2018

Y2 - 4 November 2018 through 7 November 2018

ER -

A Method for Finding the Routes of Mazes

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this