A comparative study between algorithms solving Ants Nearby Treasure Search problem for multiple treasures
Kasim Taskin, Mustafa Dinler · KTH Publication Database DiVA (KTH Royal Institute of Technology) · 2018
There is a need for fast and resource effective algorithms that can find people in need. This can be achieved using bio-inspired autonomous agents. One problem that is similar to the one of a rescue mission is Ants Nearby Treasure Search (ANTS). In this problem, a number of ants work together towards a common goal on a grid, for example finding a treasure. To make the problem more similar to a rescue mission, it is expanded to include multiple treasures. We name this problem Ants Nearby Treasures Search (ANTSS). ANTSS is solved using Parallel Diamond Search algorithm. We propose an addition to this solution. By changing the search origin we see if our algorithm performs better, mostly in cases where treasures are grouped up. Results show how changing the origin has a significant advantage in cases were treasures are grouped up. However, there is also huge disadvantages in general test cases.