Ant trail java simulation

Home
Movies
Images
Java
PHP
Micro controllers
Fractals
Vector graphics
Projects
Links
Blog
Meta

My java applets were developed a long time ago and have not been digitally signed. Nowadays a browser will typically not allow a java applet to run unless it is signed. Getting the applets signed is somewhat expensive, and since I no longer do any java development it is unlikely that I will get the applets signed. It it still possible to run the applets, but in that case you will need to change the security policy of your browser to allow unsigned applets to run.
Java port of an old C-program I once made.
In nature ants will search for food more or less randomly, but collectively their foraging is still efficient. Ants can communicate with each other by releasing pheromones. When an ant happens to find a food source the ant will lay out a trail of pheromones as it returns to the colony. If other ants finds this trail they will follow it to the food source, and when they return to the colony they will also lay out a pheromone trail thereby strengthening the existing trail. In this way information about food sources can spread and lead to effecient use of the food sources. When a particular food source has been depleted there will be no more ants reinforcing that pheromone trail when returning with food. When the trail is no longer being reinforced it will eventually disappear.

In the java simulation below the ants are represented by purple dots, while food sources are shown in dark blue. The two sliders regulate the number of ants in the simulation and the dissipation rate of the pheromones. With the default settings the ants will have exhaused all of the food sources in the simulation after a couple of minutes.


Simulations of this kind are closely related to Ant Colony Optimization (ACO) algorithms, although the purpose here is not really optimization.