Algorithm for automaton specification for exploring dynamic labyrinths

Indian Journal of Science and Technology

Volumn 6, Issue SUPPL5, 2013, Pages 4554-4559

  Kumarave, A ^a   Rangarajan, K ^a  

^a BHARATH UNIVERSITY   (India)

Author keywords

Finite state automaton; Free way of escape; Labyrinths; Printing mouse

Indexed keywords

EID: 84879343133     PISSN: 09746846     EISSN: 09745645     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. Active-Robots (n.d.) (2008). Cruiser Maze Solver Robot. Available from: http://www.microrobot.co.kr, http://www.activerobots.com/products/robots/cruiser-details-2.shtml.
2. Brüggemann B (2006). Entkommen aus unbekannten labyrinthen mit einbahnstrassen, Master's thesis, Rheinische Friedrich Wilhelms Universität Bonn.
3. Brüggemann B, Kamphans T et al. (2007). Leaving an unknown maze with one-way roads, in Abstracts 23nd European Workshop Computational Geometry, Graz, Austria, 90-93.
4. Muller H (1977). A one symbol printing automation escaping from every labyrinth, Computing Springer Verlag, vol 19, 95-110.
5. Muller H (1971). Endliche automaten und labyrinthen, Elecktronishe Informations verarbeitung und Kybernetik, vol 7(4), 261-264.
6. Muller H (1971). Stack automaten in labyrinthen, Archiv Für Mathematische Logik Und Grundlagenforschung, vol 14 (3-4), 127-134.
7. Nolfi S, and Floreano D (2000). Evolutionary robotics: the biology, intelligence, and technology of self-organizing machines (Intelligent Robotics and Autonomous Agents), Bradford Books.