Shortest Path Finding in Mazes by Active and Passive Particles
- 695 Downloads
Maze solving and finding the shortest path or all possible exit paths in mazes can be interpreted as mathematical problems which can be solved algorithmically. These algorithms can be used by both living entities (such as humans, animals, cells) and non-living systems (computer programs, simulators, robots, particles). In this chapter we summarize several chemistry-based concepts for maze solving in two-dimensional standard mazes which rely on surface tension driven phenomena at the air-liquid interface. We show that maze solving can be implemented by using: (i) active (self-propelled) droplets and/or (ii) passive particles (chemical entities).
J. Č. was financially supported by the Czech Science Foundation (Grant No. 17-21696Y). Other authors acknowledge the financial support of the Hungarian Research Fund (OTKA K104666). Financial support for R. T. by the Marie Heim-Vogtlin Program under project no PMPDP2-139698 is gratefully acknowledged. D. U. and I. L. gratefully acknowledge the financial support of the National Research, Development and Innovation Office of Hungary (TÉT12JP-1-2014-0005).
- 3.A. Adamatzky, Physical maze solvers. All twelve prototypes implement 1961 Lee algorithm, in Emergent Computation: A Festschrift for Selim G. Akl, ed. by A. Adamatzky (Cham, Springer International Publishing, 2017), pp. 489–504Google Scholar
- 7.J. Čejková, S. Holler, N.T. Quyen, C. Kerrigan, F. Štěpánek, M.M. Hanczyc, Chemotaxis and chemokinesis of living and non-living objects, in Advances in Unconventional Computing, ed. by A. Adamatzky (Springer, 2017), pp. 245–260Google Scholar
- 19.Y. Yu, G. Pan, Y. Gong, K. Xu, N. Zheng, W. Hua, X. Zheng, Z. Wu, Intelligence-augmented rat cyborgs in maze solving. PLoS ONE 11, e014775 (2016)Google Scholar