Optimal random search using limited spatial memory
Lévy walks are known to be efficient movements because Lévy walkers search wide areas while restricting returns to previously visited sites. A self-avoiding walk (SAW) is a series of moves on a lattice that visit the same place only once. As such, SAWs can also be effective search algorithms. Howeve...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
The Royal Society
2018-01-01
|
| Series: | Royal Society Open Science |
| Subjects: | |
| Online Access: | https://royalsocietypublishing.org/doi/pdf/10.1098/rsos.171057 |