R. Tayar

Technion – Israel Institute of Technology

Papers

Total Citations

H-Index

About

R. Tayar’s research centers on algorithmic robotics and graph theory, with a particular focus on the traversal of unknown, finite directed Eulerian mazes. In their most cited work (2002, 29 citations), Tayar introduced two groundbreaking algorithms that enable a robot controlled by a finite-state automaton to thread such mazes using only a single pebble placed at each vertex’s exits. These pebbles serve as markers to guide the robot along an Eulerian cycle, effectively solving a classic problem in autonomous navigation with minimal memory and resources. A subsequent paper (2004, 4 citations) refined these methods, assuming each vertex has a circular list of outgoing edges, further demonstrating the practicality of the approach. Tayar’s contributions are notable for their elegance and efficiency, offering foundational insights into how simple agents can explore complex, directed environments without prior knowledge. This work has implications for robotics, network theory, and distributed computing, inspiring further studies in minimalistic traversal algorithms. Tayar’s achievements highlight a deep understanding of automata theory and graph traversal, making their research a key reference for students and researchers exploring autonomous exploration and maze-solving strategies.