Extending multi-agent pathfindingtowards item transportation, with comparisons between heuristics indifferent settings

Detta är en Kandidat-uppsats från KTH/Skolan för elektroteknik och datavetenskap (EECS); KTH/Skolan för elektroteknik och datavetenskap (EECS)

Författare: Denny Lekic; Anton Hampus; [2018]

Nyckelord: ;

Sammanfattning: In an increasingly connected world problems of planning transport of differentkinds is becoming increasingly important. This study has proposed an extensionof the multi-agent pathfinding problem to include item transportation, aswell as providing possible cost-based heuristics with accompanying comparisons.The aim was to explore the usefulness of the heuristics together withhow the quality of their solutions depend on differences in the setting. Theresults are promising for two cost metrics explored that have shown benefitswhen adding them to a simple base heuristic. The study also indicates patternsin which the makespan of the solutions depend on the problem instancecharacteristics.

  HÄR KAN DU HÄMTA UPPSATSEN I FULLTEXT. (följ länken till nästa sida)