The ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Artificial ants stand for multi-agent methods inspired by the behavior of real ants. It helps to solve various tasks, including vehicle routing, internet routing [Wiki].

Finding an optimal path with brute force on the other hand would require a lot of computer power: (n-1)!/2 variant to compare, where n is the number of agents. For 15 points it would require to compare 43,589,145,600 paths.

With this plugin will be able to find the route for the same amount of points without notice.

Videos:

• Finding an optimal path in changing environment using Ant Algorithm link;
• How changing obstacles affects path, calculated using Ant Algorithm link;
• Ant Algorithm in action for round objects on a moving platform: link;
• Ant Algorithm represents Eiffel Tower made of different paths: link;
• Ant Algorithm runtime path calculations for round objects link;
• Drawing a path with Ant Algorithm using the editor in Unreal Engine 4 link.