Abstract:
If behavior networks, which use spreading activation to select actions, are analogous to connectionist methods of pattern recognition, then recurrent behavior networks, which use energy minimization, are analogous to Hopfield networks. Hopfield networks memorize patterns by making them attractors. Similarly, each behavior of a recurrent behavior network should be an attractor of the network, to inhibit fruitless, repeated switching between different behaviors in response to small changes in the environment and in motivations. I overcome two major objections to this view, and demonstrate that the performance in a test domain of the Do the Right Thing recurrent behavior network is improved by redesigning it to create desirable attractors and basins of attraction. I further show that this performance increase is correlated with an increase in persistence and a decrease in undesirable behavior-switching. On a more general level, this work encourages the study of action selection as a dynamics problem. Key Words: action selection; decision making; attractors; behavior networks; pattern recognition; nonlinearity ii Acknowledgments My advisor, Deborah Walters, gave me guidance and encouragement, and was on my side throughout the writing of this dissertation. William Rapaport advised me in the early stages of this work, and made many helpful suggestions that improved this document's readability and forcefulness. Patricia Eberlein helped me through several unpleasant mathematical quandaries. Erwin Segal was my outside reader on short notice. I thank the SNePS Research Group for ideas about knowledge representation, reasoning, and acting, that, although they did not appear in this research, played a major part in defining its direction. I also want to thank Pattie Maes and Bradley Rhodes of MIT for e-mail discussions of behavior networks, and especially Toby Tyrrell of the Southampton Oceanography Centre for making his software available and for many lengthy e-mail discussions concerning his work. Comments by
Citations
|
2489
|
Induction of Decision Trees
– Quinlan
- 1986
|
|
2141
|
A robust layered control system for a mobile robot
– Brooks
- 1986
|
|
2140
|
Learning Internal Representations by Error Propagation
– Rumelhart, Hinton, et al.
- 1986
|
|
1397
|
STRIPS: A new approach in the application of theorem proving to problem solving
– Fikes, Nilsson
- 1971
|
|
1390
|
Introduction to the theory of neural computation
– Hertz, Krogh, et al.
- 1991
|
|
1007
|
Neural networks and physical systems with emergent collective computational abilities
– Hopfield
- 1982
|
|
822
|
Unified Theories of Cognition
– Newell
- 1990
|
|
764
|
The Sciences of the Artificial
– Simon
- 1998
|
|
653
|
Intelligence without reason
– Brooks
- 1991
|
|
501
|
Pengi: an implementation of a theory of activity
– Agre, Chapman
- 1987
|
|
481
|
An analysis of time-dependent planning
– Dean, Boddy
- 1988
|
|
458
|
The architecture of cognition
– Anderson
- 1983
|
|
438
|
Origins of Order: Self-Organization and Selection in Evolution
– Kauffman
- 1993
|
|
417
|
A logical calculus of the ideas immanent in nervous activity
– McCulloch, Pitts
- 1943
|
|
405
|
The Society of Mind
– Minsky
- 1986
|
|
376
|
Reactive reasoning and planning
– Georgeff, Lansky
- 1987
|
|
374
|
Integrated Architecture for Learning, Planning, and Reacting Based on Approximating Dynamic Programming
– Sutton
- 1990
|
|
348
|
Learning and executing generalized robot plans
– Fikes, Hart, et al.
- 1972
|
|
341
|
Generating project networks
– Tate
- 1977
|
|
306
|
Automatic programming of behavior-based robots using reinforcement learning
– Mahadevan, Connell
- 1991
|
|
260
|
Rules of the mind
– Anderson
- 1993
|
|
248
|
Elephants don’t play chess
– Brooks
- 1990
|
|
230
|
Understanding Natural Language
– Winograd
- 1972
|
|
209
|
Situated Agents Can Have Goals
– Maes
- 1990
|
|
182
|
Parallel distributed processing
– Rumelhart, McClelland
- 1986
|
|
182
|
Learning to coordinate behaviors
– Maes, Brooks
- 1990
|
|
179
|
A Theory of Cognitive Dissonance
– Festinger
- 1957
|
|
178
|
ELIZA—a computer program for the study of natural language communication between man and machine
– Weizenbaum
- 1965
|
|
167
|
The nonlinear nature of plans
– Sacerdoti
- 1975
|
|
165
|
What are plans for
– Agre, Chapman
- 1990
|
|
156
|
How to Do the Right Thing
– Maes
- 1990
|
|
151
|
Modelling adaptive autonomous agents
– Maes
- 1995
|
|
139
|
Sparse Distributed Memory
– Kanerva
- 1988
|
|
131
|
Domain-independent planning: Representation and plan generation
– Wilkins
- 1984
|
|
126
|
Planning in Time: Windows and Durations for Activities and Goals
– Vere
- 1981
|
|
118
|
The Dynamics of Action Selection
– Maes
- 1989
|
|
117
|
Modeling brain function: The world of attractor neural networks
– Amit
- 1989
|
|
115
|
How brain makes chaos in order to make sense of the world
– Skarda, Freeman
- 1987
|
|
109
|
SSS: A hybrid architecture applied to robot navigation
– Connell
- 1992
|
|
106
|
SNePS Considered as a Fully Intensional Propositional Semantic Network
– Shapiro, Rapaport
- 1987
|
|
105
|
G.: Life at the Edge of Chaos
– Langton
- 1991
|
|
95
|
Artificial Intelligence: The Very Idea
– Haugeland
- 1985
|
|
92
|
Perceptrons
– Minsky, Papert
- 1969
|
|
90
|
Action-selection in hamsterdam: Lessons from ethology
– Blumberg
- 1994
|
|
84
|
A finegrained alternative to the subsumption architecture for mobile robot control
– Rosenblatt, Payton
- 1989
|
|
72
|
The SNePS semantic network processing system
– Shapiro
- 1979
|
|
69
|
The capacity of the Hopfield associative memory
– McEliece, Posner, et al.
- 1987
|
|
68
|
The modularity of Mind: An Essay on Faculty Psychology
– Fodor
- 1983
|
|
68
|
Planning and acting
– McDermott
- 1978
|
|
62
|
Integrating execution, planning, and learning in Soar for external environments
– Laird, Rosenbloom
- 1990
|