ing gophers as our agents and gopher traps as their en-
vironments, we tested whether gophers equipped with
the ability to detect intended configurations would
have measurably higher survival rates than those lack-
ing such an ability. We show that they do, and that
such detection is possible (and highly accurate) when
based on the statistical analysis of artifacts. Further-
more, given that intention perception gophers fare sig-
nificantly better than cautious gophers, this gives ev-
idence of objective “signal” in the configurations in
this context (Silver, 2012), exploitable through statis-
tical methods. Such information could potentially be
leveraged by other artificial decision-making systems.
Through our experiments, we found that not only
were there cases where such perception was helpful,
but that it was helpful in the majority of cases tested.
Our results show that gophers with intention percep-
tion tend to survive significantly longer and consume
more food on average than those without intention
perception. We also saw that the benefit of intention
perception is greater when prioritizing safety over
food, as the gap between intention and baseline go-
phers grows with larger MFI values. These findings
are consistent with other forthcoming work by our re-
search group on intention perception, which show sig-
nificant survival advantages for intention perception
agents in predator-prey scenarios and game-theoretic
adversarial situations.
Our results clearly establish that there exist cases
in which intention perception significantly benefits an
artificial agent’s chances of survival and suggest the
existence of perhaps many more.
ACKNOWLEDGEMENTS
Special thanks to Jerry Liang, Aditya Khant, Kyle
Rong, and Tim Buchheim for assistance in experi-
mental set-up. This research was supported in part
by the National Science Foundation under Grant No.
1950885. Any opinions, findings or conclusions ex-
pressed are the authors’ alone, and do not necessarily
reflect the views of the National Science Foundation.
REFERENCES
Brown, W. L. and Humphrey, C. E. (1955). Generalization
in spatial learning. The American Journal of Psychol-
ogy, 68(3):396–408.
Crawford, L. E. and Cacioppo, J. T. (2002). Learning where
to look for danger: Integrating affective and spatial
information. Psychological Science, 13(5):449–453.
De Vries, H. (1904). Species and Varieties, Their Origin
by Mutation: Lectures Delivered at the University of
California. Open Court Publishing Company.
D
´
ıaz-Pach
´
on, D. A., S
´
aenz, J. P., and Rao, J. S. (2020). Hy-
pothesis Testing with Active Information. Statistics &
Probability Letters, 161:108742.
Hazen, R. M., Griffin, P. L., Carothers, J. M., and Szostak,
J. W. (2007). Functional information and the emer-
gence of biocomplexity. Proceedings of the National
Academy of Sciences, 104(1):8574–8581.
Lowrance, W. W. (1980). The nature of risk. In Societal
risk assessment, pages 5–17. Springer.
Monta
˜
nez, G. D. (2018). A unified model of complex spec-
ified information. BIO-Complexity, 2018(4).
Nogueira, S. S. d. C., Fernandes, I. K., Costa, T. S. O.,
Nogueira-Filho, S. L. G., and Mendl, M. (2015). Does
trapping influence decision-making under ambiguity
in white-lipped peccary (tayassu pecari)? PloS one,
10(6):e0127868.
Norman, L. J., Heywood, C. A., and Kentridge, R. W.
(2013). Object-based attention without awareness.
Psychological Science, 24(6):836–843.
Silver, N. (2012). The Signal and the Noise: Why So Many
Predictions Fail–But Some Don’t. Penguin.
Thorvaldsen, S. and H
¨
ossjer, O. (2020). Using Statistical
Methods to Model the Fine-Tuning of Molecular Ma-
chines and Systems. Journal of Theoretical Biology,
501:110352.
Vorhees, C. V. and Williams, M. T. (2014). Assessing spa-
tial learning and memory in rodents. ILAR journal,
55(2):310–332.
Wagner, A. (2014). Arrival of the Fittest: Solving Evolu-
tion’s Greatest Puzzle. Simon and Schuster.
APPENDIX
A.1 Computing M
g
(X)
To calculate M
g
(x), we use combinatorics together
with numerical computation methods. Note that there
are 9 variable cells in each trap, and thus 10 possible
coherent (well-matched) connections. Computation-
ally, we first loop through every possible combination
of coherent connections. For each combination, we
assign a number to each of the 9 variable cells, de-
noting the number of possible different trap pieces it
can contain if the trap has at least c coherent connec-
tions in total. Some cells are limited in their freedom
to connect to adjacent cells, having required connec-
tions for a specific orientation and component type.
Cells that have no required connections have 91 pos-
sibilities, cells with one required connection have 9,
and cells with two required connections have only 1.
For a visual explanation, see Figure 10.
Let n denote the total number of cells in a config-
uration that are assigned the number 91. For each cell
assigned 91, one out of 91 possible trap pieces for that
ICAART 2021 - 13th International Conference on Agents and Artificial Intelligence
214