### Table 4: Statistics on 9 multi-robot problems.

2001

"... In PAGE 8: ... For example, SBL assumes that collisions may occur between any two bodies of any two robots, while many pairs of bodies cannot col- lide. Table4 gives averages over 100 runs of SBL on 9 problems. Fig.... In PAGE 8: ... Fig. 5 shows the initial and final configura- tions for the problem named PIII-6 in Table4 . PIII-2 and PIII-4 are the same problem, but reduced to robots 1 and 2, and robots 1 through 4, respectively.... ..."

Cited by 51

### Table 1 summarizes the multi-robot Markov localization algorithm. The time index a29 and the state

"... In PAGE 7: ... Table1 : Multi-robot Markov localization algorithm for robot number a1 . it makes certain independence assumptions (e.... ..."

### TABLE II FAULT SIGNATURES FOR MULTI-ROBOT BOX-PUSHING SYSTEM, WITH LEADING ZEROS REMOVED

2006

Cited by 4

### Table 1. Performance of bidding rules against optimal in known environments.

2005

"... In PAGE 8: ... The NP-hardness of optimizing the performance did not allow us to solve larger multi-robot exploration tasks. Table1... ..."

Cited by 11

### Table 1 summarizes the multi-robot Markov localization algorithm. The time index a29 and the state variable a43

"... In PAGE 7: ... Table1 : Multi-robot Markov localization algorithm for robot number a1 . it makes certain independence assumptions (e.... ..."

### TABLE II PERCEPTUAL SCHEMAS, COMMUNICATION SCHEMAS, AND MOTOR SCHEMAS IN MULTI-ROBOT TRANSPORTATION TASK Schema Description Input Output

2005

Cited by 15

### TABLE IV PERCEPTUAL SCHEMAS, COMMUNICATION SCHEMAS, AND MOTOR SCHEMAS IN MULTI-ROBOT BOX PUSHING Schema Description Input Output

2005

Cited by 15

### Table 1 summarizes the multi-robot Markov localization algorithm. The time index D8 and the state variable C4 is omitted whenever possible. Of course, this algorithm is only an approximation, since

"... In PAGE 7: ... Table1 : Multi-robot Markov localization algorithm for robot number D2. it makes certain independence assumptions (e.... ..."

### Table 1 summarizes the multi-robot Markov localization algorithm. The time index t and the state variable L is omitted whenever possible. Of course, this algorithm is only an approximation, since

"... In PAGE 7: ... Table1 : Multi-robot Markov localization algorithm for robot number n. it makes certain independence assumptions (e.... ..."

### Table 2. Performance values stored in the GOT for the Searching Task tree in a multi-robot experiment. Alternative-behavior evalGOT (%) Number of behavior use

"... In PAGE 20: ... One or two stable strategies \won out quot; in most runs. Figure 14 shows a tree learned by the robot after 68 trials, and Table2 presents the performance stored in the corresponding GOT. Table 2.... ..."