Are Many Reactive Agents Better Than a Few Deliberative Ones?

Problem solvers fa l l along a wide spectrum ranging f r om highly del iberat ive to h igh ly reactive. H igh ly del iberat ive systems are able to design op t ima l l y efficient solut ions to problems, bu t they require complete wor ld models and consume inord inate computa t iona l resources. Reactive systems move in real t ime but cannot guarantee efficient solut ions. They are also subject to looping behavior. One way to generate incremental ly more efficient solut ions is to be incremental ly more del iberat ive, e.g., to increase the amount of menta l search between actions. Th is paper presents an alternat ive method for generat ing more efficient solut ions: increasing the number of reactive agents simultaneously a t tack ing a given problem. Th is method provides a second, orthogonal degree of f reedom. We f ind tha t in many domains, increasing agents is dramat ica l ly superior to increasing single-agent del iberat iveness. Th is is because solut ion qual i ty improves rap id ly as more reactive agents are added, but search t ime only increases l inearly. Th is contrasts w i t h add ing more deliberativeness, which incurs exponent ia l ly increasing t ime costs. A m ple empir ical evidence is presented to support our conclusions. 1 I n t r o d u c t i o n Th is paper considers two aspects of computa t iona l prob-

[1]  Richard E. Korf,et al.  Real-Time Heuristic Search , 1990, Artif. Intell..

[2]  Oren Etzioni,et al.  Explanation-Based Learning: A Problem Solving Perspective , 1989, Artif. Intell..

[3]  Laxmikant V. Kalé,et al.  Consistent Linear Speedups to a First Solution in Parallel State-Space Search , 1990, AAAI.

[4]  Edward F. Gehringer,et al.  Superlinear Speedup Through Randomized Algorithms , 1985, International Conference on Parallel Processing.

[5]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[6]  Simon Parsons,et al.  Do the right thing - studies in limited rationality by Stuart Russell and Eric Wefald, MIT Press, Cambridge, MA, £24.75, ISBN 0-262-18144-4 , 1994, The Knowledge Engineering Review.

[7]  Richard E. Korf,et al.  Single-Agent Parallel Window Search , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  P. Kline Models of man , 1986, Nature.

[9]  Jonathan M. Smith,et al.  Exploring "Multiple Worlds" in Parallel , 1989, ICPP.

[10]  Larry S. Davis,et al.  Parallel Iterative A* Search: An Admissible Distributed Heuristic Search Algorithm , 1989, IJCAI.

[11]  David R. Jefferson,et al.  Transparent Process Cloning: A Tool for Load Management of Distributed Programs , 1987, ICPP.

[12]  E. KorfRichard Depth-first iterative-deepening: an optimal admissible tree search , 1985 .

[13]  Stuart J. Russell,et al.  Do the right thing , 1991 .

[14]  R. Bisiani,et al.  BEAM. An accelerator for speech recognition , 1989, International Conference on Acoustics, Speech, and Signal Processing,.

[15]  Jonathan M. Smith,et al.  Transparent concurrent execution of mutually exclusive alternatives , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.

[16]  Vipin Kumar,et al.  Superlinear Speedup in Parallel State-Space Search , 1988, FSTTCS.

[17]  Vipin Kumar,et al.  On the Efficiency of Parallel Backtracking , 1993, IEEE Trans. Parallel Distributed Syst..

[18]  H. Simon,et al.  Models of Man. , 1957 .

[19]  Stuart J. Russell,et al.  Do the right thing - studies in limited rationality , 1991 .

[20]  Benjamin W. Wah,et al.  Parallel Iterative Refining A* Search , 1991, ICPP.

[21]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[22]  P. S. Thiagarajan Foundation of Software Technology and Theoretical Computer Science , 1994, Lecture Notes in Computer Science.

[23]  Dharma P. Agrawal,et al.  A Randomized Parallel Backtracking Algorithm , 1988, IEEE Trans. Computers.