A Method for Finding the Routes of Mazes

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publication2018 International Automatic Control Conference, CACS 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781538662786
DOIs
StatePublished - 9 Jan 2019
Event2018 International Automatic Control Conference, CACS 2018 - Taoyuan, Taiwan
Duration: 4 Nov 20187 Nov 2018

Publication series

Name2018 International Automatic Control Conference, CACS 2018

Conference

Conference2018 International Automatic Control Conference, CACS 2018
CountryTaiwan
CityTaoyuan
Period4/11/187/11/18

Fingerprint Dive into the research topics of 'A Method for Finding the Routes of Mazes'. Together they form a unique fingerprint.

Cite this