A comparative study between algorithms solving Ants Nearby Treasure Search problem for multiple treasures
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 toward...
Main Authors: | , |
---|---|
Format: | Others |
Language: | English |
Published: |
KTH, Skolan för elektroteknik och datavetenskap (EECS)
2018
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229748 |
id |
ndltd-UPSALLA1-oai-DiVA.org-kth-229748 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-UPSALLA1-oai-DiVA.org-kth-2297482018-07-11T05:25:21ZA comparative study between algorithms solving Ants Nearby Treasure Search problem for multiple treasuresengEn jämförelse mellan algoritmer som löser Ants Nearby Treasure Search för flera skatterTaskin, KasimDinler, MustafaKTH, Skolan för elektroteknik och datavetenskap (EECS)KTH, Skolan för elektroteknik och datavetenskap (EECS)2018Computer SciencesDatavetenskap (datalogi)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. Det finns ett behov av snabba och resurseffektiva algoritmer som kan hitta personer i nöd. Detta kan uppnås med hjälp av biologiskt inspirerade autonoma agenter. Ett problem som liknar det utav ett räddningsuppdrag är Ants Nearby Treasure Search (ANTS). I detta problem arbetar myror mot ett gemensamt mål på ett rutnät, till exempel att hitta en skatt. För att göra problemet mer likt ett räddningsuppdrag utvidgas det till att omfatta flera skatter. Vi döper det nya problemet Ants Nearby Treasures Search (ANTSS). För att lösa ANTSS används Parallel Diamond Search-algoritmen. Vi föreslår en utvidgning till denna algoritm. Genom att ändra sökningens ursprung undersöks ifall vår algoritm fungerar bättre, mestadels i fall där skatter är grupperade. Resultaten visar hur förändringen av ursprunget har en stor fördel i de fall där skatter grupperas. Det finns däremot också stora nackdelar i allmänna testfall. Student thesisinfo:eu-repo/semantics/bachelorThesistexthttp://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229748TRITA-EECS-EX ; 2018:212application/pdfinfo:eu-repo/semantics/openAccess |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
Computer Sciences Datavetenskap (datalogi) |
spellingShingle |
Computer Sciences Datavetenskap (datalogi) Taskin, Kasim Dinler, Mustafa A comparative study between algorithms solving Ants Nearby Treasure Search problem for multiple treasures |
description |
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. === Det finns ett behov av snabba och resurseffektiva algoritmer som kan hitta personer i nöd. Detta kan uppnås med hjälp av biologiskt inspirerade autonoma agenter. Ett problem som liknar det utav ett räddningsuppdrag är Ants Nearby Treasure Search (ANTS). I detta problem arbetar myror mot ett gemensamt mål på ett rutnät, till exempel att hitta en skatt. För att göra problemet mer likt ett räddningsuppdrag utvidgas det till att omfatta flera skatter. Vi döper det nya problemet Ants Nearby Treasures Search (ANTSS). För att lösa ANTSS används Parallel Diamond Search-algoritmen. Vi föreslår en utvidgning till denna algoritm. Genom att ändra sökningens ursprung undersöks ifall vår algoritm fungerar bättre, mestadels i fall där skatter är grupperade. Resultaten visar hur förändringen av ursprunget har en stor fördel i de fall där skatter grupperas. Det finns däremot också stora nackdelar i allmänna testfall. |
author |
Taskin, Kasim Dinler, Mustafa |
author_facet |
Taskin, Kasim Dinler, Mustafa |
author_sort |
Taskin, Kasim |
title |
A comparative study between algorithms solving Ants Nearby Treasure Search problem for multiple treasures |
title_short |
A comparative study between algorithms solving Ants Nearby Treasure Search problem for multiple treasures |
title_full |
A comparative study between algorithms solving Ants Nearby Treasure Search problem for multiple treasures |
title_fullStr |
A comparative study between algorithms solving Ants Nearby Treasure Search problem for multiple treasures |
title_full_unstemmed |
A comparative study between algorithms solving Ants Nearby Treasure Search problem for multiple treasures |
title_sort |
comparative study between algorithms solving ants nearby treasure search problem for multiple treasures |
publisher |
KTH, Skolan för elektroteknik och datavetenskap (EECS) |
publishDate |
2018 |
url |
http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-229748 |
work_keys_str_mv |
AT taskinkasim acomparativestudybetweenalgorithmssolvingantsnearbytreasuresearchproblemformultipletreasures AT dinlermustafa acomparativestudybetweenalgorithmssolvingantsnearbytreasuresearchproblemformultipletreasures AT taskinkasim enjamforelsemellanalgoritmersomloserantsnearbytreasuresearchforfleraskatter AT dinlermustafa enjamforelsemellanalgoritmersomloserantsnearbytreasuresearchforfleraskatter AT taskinkasim comparativestudybetweenalgorithmssolvingantsnearbytreasuresearchproblemformultipletreasures AT dinlermustafa comparativestudybetweenalgorithmssolvingantsnearbytreasuresearchproblemformultipletreasures |
_version_ |
1718711779416080384 |