A.N. Shah. Pebble automata on arrays. Computer Graphics and Image Processing, pages 236--246, 1974.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... in plane Baeza Yates [3] Kao et al. [38] figure of merit Papadimitriou and Yannakakis [58] Blum et al. [5] Bar Eli et al. [4] Deng et al. [20] Klein [40] Kleinberg [41] Kalyanasundaram and Pruhs [37, 35, 36] Class C restricted computation Budach [10, 11] Coy [19] Dopp [22] Shah [75], Blum and Kozen [7] Table 1: A taxonomy of non heuristic navigation algorithms. A) Touch Sensors: Typically a touch sensor detects when the robot touches an obstacle. Several algorithms based on such sensors have been extensively studied by Lumelsky [45] and by many other researchers. Early ....

....computational models than a finite state automata. Then we consider the case of finite automata, but the robot is equipped with pebbles that it can drop in a cell, recognize and pick up; these pebbles are used as markers on certain cells (when the coordinates of cells cannot be computed) Shah [75] illustrated an algorithm for a finite automaton that uses five pebbles. Then Blum and Kozen [7] showed that a finite automaton with two pebbles can achieve the same result. The algorithms for finite automata with pebbles are described briefly in the last part of this section. 39 7.1 Algorithms ....

[Article contains additional citation context not shown here]

A. P. Shah. Pebble automata on arrays. Computer Graphics and Image Processing, 3:236--246, 1974.

....two robot algorithm. 4 Most early work on graph exploration assumed that the robot is a nite automaton. Rabin [32] rst proposed the idea of providing the automaton with pebbles to help it explore. This led to a body of work examining the number of pebbles needed to explore various environments [38, 16, 15, 5, 33]. For a survey on automata exploring labyrinths, see [29] Deng and Papadimitriou [22] propose and study the problem of exploring an unknown directed graph having labeled vertices. Albers and Henzinger [2] give improved algorithms for this problem. These works study exploration from the ....

A.N. Shah. Pebble automata on arrays. Computer Graphics and Image Processing, pages 236-246, 1974.

....algorithm. 6 Most early work on graph exploration assumed that the robot is a finite automaton. Rabin [24] first proposed the idea of providing the automaton with pebbles to help it explore. This led to a body of work examining the number of pebbles needed to explore various environments [29, 13, 12, 3, 25]. For a survey on automata exploring labyrinths, see [21] Deng and Papadimitriou [16] propose and study the problem of exploring an unknown directed graph having labeled vertices. Albers and Henzinger [1] give improved al 6 In light of our results and those of Bender and Slonim, we see that a ....

A.N. Shah. Pebble automata on arrays. Computer Graphics and Image Processing, pages 236--246, 1974.

....algorithm. 6 Most early work on graph exploration assumed that the robot is a finite automaton. Rabin [23] first proposed the idea of providing the automaton with pebbles to help it explore. This led to a body of work examining the number of pebbles needed to explore various environments [28, 13, 12, 3, 24]. Deng and Papadimitriou [16] propose and study the problem of exploring an unknown directed graph having labeled vertices. 5 Actually, the robot may be at vertices equivalent under automorphism, but we avoid this issue in the introduction. 6 In light of our results and those of Bender and ....

A.N. Shah. Pebble automata on arrays. Computer Graphics and Image Processing, pages 236--246, 1974.

No context found.

A.N. Shah. Pebble automata on arrays. Computer Graphics and Image Processing, pages 236--246, 1974.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC