Suppose you are a hunter that doesn’t have information about the distance from the prey. For instance a blind dog with very precise smelling which can be mapped to a distance from the potential prey. How can this dog locate and eventually reach its prey?

The algorithms are not documented yet, but a simulation is provided. If you are interested contact me for more information.


simulation parameters:

  • \( V_{prey} \approx V_{predator} \)
  • Prey changes direction with small probability
  • Predator adopts the strategy we have assigned it (not explained here).

Web simulation found online

Previous attempts

A less sophisticated approach and its results

web simulation

Results for multiple predators starting from the same location, with varying initial velocity angles:

hugo even showcase


For varying distances and varying angles:

hugo even showcase
hugo even showcase

Random shifts

web simulation