Multi-agent pathfinding with discrete speeds - and its application for vehicle road networks

dc.contributor.authorGerdin, Johan
dc.contributor.departmentChalmers tekniska högskola / Institutionen för data och informationstekniksv
dc.contributor.examinerPiterman, Nir
dc.contributor.supervisorSchiller, Elad Michael
dc.date.accessioned2020-09-18T13:54:10Z
dc.date.available2020-09-18T13:54:10Z
dc.date.issued2020sv
dc.date.submitted2020
dc.description.abstractThis work contributes to the multi-agent path-finding problem (MAPF) by extending existing algorithms with optimal and efficient routing for roads with multiple lanes and intersections. It also considers the continuous case, where agents are forbidden from performing actions during a non-discrete interval of time. Further, a method to plan for the speed of agents is introduced. In order to create a strong base for this problem, rigorous mathematical models are defined and proved to have properties of both completeness and optimality. Experiments are used to validate the abstract models.sv
dc.identifier.coursecodeDATX05sv
dc.identifier.urihttps://hdl.handle.net/20.500.12380/301738
dc.language.isoengsv
dc.setspec.uppsokTechnology
dc.subjectMulti-agent path-findingsv
dc.subjectkinematic constraintssv
dc.subjectspeedsv
dc.titleMulti-agent pathfinding with discrete speeds - and its application for vehicle road networkssv
dc.type.degreeExamensarbete för masterexamensv
dc.type.uppsokH
Ladda ner
Original bundle
Visar 1 - 1 av 1
Bild (thumbnail)
Namn:
CSE 20-97 Gerdin.pdf
Storlek:
2 MB
Format:
Adobe Portable Document Format
Beskrivning:
Multi-agent pathfinding with discrete speeds
License bundle
Visar 1 - 1 av 1
Bild saknas
Namn:
license.txt
Storlek:
1.14 KB
Format:
Item-specific license agreed upon to submission
Beskrivning: