Maze Exploration Algorithm for Small Mobile Platforms

  • Bienias Ł
  • Szczepański K
  • Duch P
N/ACitations
Citations of this article
27Readers
Mendeley users who have this article in their library.

Abstract

An algorithm that enables efficient maze exploration is presented in the paper. The algorithm involves two phases: first the whole maze is explored in an ordered way and then, the shortest possible way out is determined. The algorithm has been derived in a way that combines main advantages of the two known labirynth-exploration algorithms: “Wall follower” and “Trémaux’s algorithm”. The algorithm has been tested using an autonomous vehicle, controlled by Arduino UNO, with two DC engines, ultrasonic sensors and gyroscope. It has been shown that the proposed approach provides a few crucial advantages with respect to already known solutions.

Cite

CITATION STYLE

APA

Bienias, Ł., Szczepański, K., & Duch, P. (2016). Maze Exploration Algorithm for Small Mobile Platforms. Image Processing & Communications, 21(3), 15–26. https://doi.org/10.1515/ipc-2016-0013

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free