Evolving a team of asymmetric predator agents that do not compute in predator-prey pursuit problem

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We herein revisit the predator-prey pursuit problem – using very simple predator agents. The latter – intended to model the emerging micro- and nano-robots – are morphologically simple. They feature a single line-of-sight sensor and a simple control of their two thrusters. The agents are behaviorally simple as well – their decision-making involves no computing, but rather – a direct mapping of the few perceived environmental states into the corresponding pairs of thrust values. We apply genetic algorithms to evolve such a mapping that results in the successful behavior of the team of these predator agents. To enhance the generality of the evolved behavior, we propose an asymmetric morphology of the agents – an angular offset of their sensor. Our experimental results verify that the offset of both 20° and 30° yields efficient and consistent evolution of successful behaviors of the agents in all tested initial situations.

Cite

CITATION STYLE

APA

Tanev, I., Georgiev, M., Shimohara, K., & Ray, T. (2018). Evolving a team of asymmetric predator agents that do not compute in predator-prey pursuit problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11089 LNAI, pp. 240–251). Springer Verlag. https://doi.org/10.1007/978-3-319-99344-7_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free