Table of Results

Data presented here is for 400 runs of the simulation. Each run is for the same network graph (figure 1), but a different random initial placement of agents. We carried out simulations for three different agent movement algorithms, and eight population sizes each. Preliminary results on partially-randomized agents are also summarized here.



 

Pop. Average Average
Agent Type Size Finishing Time Std. Dev. Meetings/Step Std. Dev.
Random 1 5314.81 3468.99 - -
2 3108.18 1801.54 0.0085 0.0035
4 1670.12 1019.39 0.0521 0.0111
7 1018.94 465.74 0.1848 0.0267
10 737.41 416.09 0.3993 0.0460
25 323.38 159.51 2.6614 0.1839
50 167.86 68.79 10.8943 0.5157
100 85.25 29.29 44.1069 1.2899
Conscientious 1 479.63 101.43 - -
2 459.70 91.66 0.0082 0.0057
4 404.51 81.25 0.0489 0.0164
7 321.46 64.73 0.1717 0.0333
10 270.50 55.02 0.3742 0.0513
25 150.79 28.48 2.4997 0.1782
50 94.33 15.17 10.3580 0.4648
100 57.89 8.72 42.4973 1.2728
Superconsc. 1 476.44 95.10 - -
2 425.62 98.32 0.0606 0.1115
4 356.44 85.57 0.3812 0.3017
7 288.91 64.60 1.3609 0.7144
10 245.09 54.02 2.6783 1.2991
25 154.93 32.84 14.7959 5.1667
50 107.06 23.30 53.8820 17.4123
100 74.00 15.33 191.7927 58.3752
Conscientious/
20% Random 100 61.19 10.75 42.6930 1.3199
Superconsc./
20% Random 100 56.61 8.86 79.2550 7.5048
Table 1: Table of results of all simulation runs


next up previous
Next: About this document Up: Cooperating Mobile Agents for Previous: References

Formatted: Sun May 24 17:37:20 EDT 1998
Nelson Minar