Shortest Path Finding in Mazes by Active and Passive Particles

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F18%3A43916956" target="_blank" >RIV/60461373:22340/18:43916956 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-77510-4_15" target="_blank" >http://dx.doi.org/10.1007/978-3-319-77510-4_15</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-77510-4_15" target="_blank" >10.1007/978-3-319-77510-4_15</a>

Result language
angličtina
Original language name
Shortest Path Finding in Mazes by Active and Passive Particles
Original language description
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).
Czech name
—
Czech description
—

Project
<a href="/en/project/GJ17-21696Y" target="_blank" >GJ17-21696Y: Towards the understanding of evaporation induced pattern formation of decanol droplets</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)