CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Solving a Reconfigurable Maze using Hybrid Wall Follower Algorithm

by Abu Bakar Sayuti Saman, Issa Abdramane
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 82 - Number 3
Year of Publication: 2013
Authors: Abu Bakar Sayuti Saman, Issa Abdramane
10.5120/14097-2114

Abu Bakar Sayuti Saman, Issa Abdramane . Solving a Reconfigurable Maze using Hybrid Wall Follower Algorithm. International Journal of Computer Applications. 82, 3 ( November 2013), 22-26. DOI=10.5120/14097-2114

@article{ 10.5120/14097-2114,
author = { Abu Bakar Sayuti Saman, Issa Abdramane },
title = { Solving a Reconfigurable Maze using Hybrid Wall Follower Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { November 2013 },
volume = { 82 },
number = { 3 },
month = { November },
year = { 2013 },
issn = { 0975-8887 },
pages = { 22-26 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume82/number3/14097-2114/ },
doi = { 10.5120/14097-2114 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:56:49.022609+05:30
%A Abu Bakar Sayuti Saman
%A Issa Abdramane
%T Solving a Reconfigurable Maze using Hybrid Wall Follower Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 82
%N 3
%P 22-26
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A key feature of an autonomous vehicle is the ability to get to a target location while traversing through a previously unknown environment. Mapping the environment will allow the vehicle to find an optimum path. This paper explores this issue by programming a mobile robot to find the shortest route in a reconfigurable maze. A wall follower algorithm with combined left-hand and right-hand rules is implemented upon several different maze configurations. It is found that the hybrid algorithm has improved the maze solving capabilities of the maze robot significantly.

References
  1. Verner, I. M. and D. J. Ahlgren, Robot contest as a laboratory for experiential engineering education. J. Educ. Resour. Comput. , 2004. 4(2): p. 2.
  2. Achmad, B. and M. N. Karsiti. Visual-based fuzzy navigation system for mobile robot: Wall and corridor follower. in Intelligent and Advanced Systems, 2007. ICIAS 2007. International Conference on. 2007. Kuala Lumpur.
  3. Vignesh, S. , et al. , Cave Exploration of Mobile Robots using Soft Computing Algorithms. International Journal of Computer Applications 71(22):14-18, June 2013. Published by Foundation of Computer Science, New York, USA.
  4. Mishra, S. and P. Bande. Maze Solving Algorithms for Micro Mouse. in Signal Image Technology and Internet Based Systems, 2008. SITIS '08. IEEE International Conference on. 2008.
  5. Cai, J. , et al. , An Algorithm of Micromouse Maze Solving, in Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology. 2010, IEEE Computer Society. p. 1995-2000.
  6. Jianping, C. , et al. A micromouse maze sovling simulator. in Future Computer and Communication (ICFCC), 2010 2nd International Conference on. 2010.
  7. Adil, M. J. S. A Comprehensive and Comparative Study of Maze-Solving Techniques by Implementing Graph Theory. 2010.
  8. Sharma, M. and K. Robeonics. Algorithms for Micro-mouse. in Future Computer and Communication, 2009. ICFCC 2009. International Conference on. 2009.
  9. Elshamarka, I. and A. B. S. Saman, Article: Design and Implementation of a Robot for Maze-Solving using Flood-Fill Algorithm. International Journal of Computer Applications, 2012. 56(5): p. 6.
  10. Cai, Z. , L. Ye, and A. Yang. FloodFill Maze Solving with Expected Toll of Penetrating Unknown Walls. in 2012 IEEE 14th International Conference on High Performance Computing and Communications. 2012.
  11. Willardson, D. M. , Analysis of Micromouse Maze Solving Algorithm, in Learning from Data. 2001, Portland State University.
  12. Babula, M. Simulated maze solving algorithms through unknown mazes. in Proceedings of XVIIIth Concurrency, Specification and Programming (CS&P) Workshop. 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Reconfigurable maze path optimization micromouse wall follower.

Powered by PhDFocusTM