Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Extending multi-agent pathfindingtowards item transportation, with comparisons between heuristics indifferent settings
KTH, School of Electrical Engineering and Computer Science (EECS).
KTH, School of Electrical Engineering and Computer Science (EECS).
2018 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesisAlternative title
Vägplanering för agenter medutvidgning mot objekttransport, med jämförelsermellan heuristiker i olika omgivningar (Swedish)
Abstract [en]

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.

Abstract [sv]

I en allt mer automatiserad värld har planeringen av transport allt större betydelse.Denna studie har jämfört olika heuristiker för vägplanering med agentersom transporterar objekt. Denna studie har utökat MAPF problemet för att inkluderaobjekttransport, samt föreslagit nya heuristiker till problemet och jämförtdessa. Studien ämnade undersöka hur användbara olika heuristiker varaoch hur deras lösningsinstanser berodde på omgivning. Resultaten visar tvålovande mätetal som är användbara som tillägg till basheuristiken som användesi studien. Sist, visar även resultaten trender på hur avslutningstid beror påprobleminstanserna.

Place, publisher, year, edition, pages
2018.
Series
TRITA-EECS-EX ; 2018:207
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:kth:diva-229962OAI: oai:DiVA.org:kth-229962DiVA, id: diva2:1215805
Subject / course
Computer Science
Educational program
Master of Science in Engineering - Computer Science and Technology
Supervisors
Examiners
Available from: 2018-07-10 Created: 2018-06-09 Last updated: 2018-07-10Bibliographically approved

Open Access in DiVA

fulltext(536 kB)2 downloads
File information
File name FULLTEXT01.pdfFile size 536 kBChecksum SHA-512
20ae6a06329f61d39961ba47dcdb254c5cf4c46024a740ba936ded6de7a49725800a47bf804ceb6db67031d0fec2df0653cfa9ebda0e2b64ecce786d2d2553c5
Type fulltextMimetype application/pdf

By organisation
School of Electrical Engineering and Computer Science (EECS)
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 8 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf