Affiliation:
1. Institute of Applied Computer Science
Abstract
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.
Reference9 articles.
1. [1] Anagnostou, L. (2009). Maze Solving Algorithms: Tremaux’s Algorithm Visual Example, https://www.youtube.com/watch?v=6OzpKm4te-E
2. [2] Bares, J.E., Wettergreen, D.S. (1999). Dante II: Technical description, results, and lessons learned. The International Journal of Robotics Research, 18(7), 621-649
3. [3] Durrant-Whyte, H., Majumder, S., Thrun, S., De Battista, M., Scheding, S. (2003). A bayesian algorithm for simultaneous localisation and map building. In Robotics Research (pp. 49-60). Springer Berlin Heidelberg
4. [4] InvenSense Inc. (2012). MPU-6000 and MPU-6050 Product Specification Revision 3.3. Sunnyvale, 6–7
5. [5] ITead Studio. (2010). Ultrasonic ranging module HC-SR04. Micropik, pp 1–3
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献