Framework for multi-agent path finding A framework for multi-agent path finding with focus on transport systems
| dc.contributor.author | Kuszli, Andreas | |
| dc.contributor.author | Åberg, Jesper | |
| dc.contributor.department | Chalmers tekniska högskola / Institutionen för data och informationsteknik | sv |
| dc.contributor.examiner | Piterman, Nir | |
| dc.contributor.supervisor | Schiller, Elad | |
| dc.date.accessioned | 2021-01-29T07:22:23Z | |
| dc.date.available | 2021-01-29T07:22:23Z | |
| dc.date.issued | 2020 | sv |
| dc.date.submitted | 2020 | |
| dc.description.abstract | It is desirable to apply multi agent path finding (MAPF) algorithms to vehicles in transport systems, as it has the potential to reduce transit time and fuel consumption. However, the application is hampered by the high level of abstraction that these problems are typically solved at. This work contributes to the field by introducing a method that lowers the level of abstraction as a post processing phase. We also evaluate a recently developed algorithm that considers mobile agents in continuous time with discrete speeds, and measure its performance when compared to other algorithms. Further, we provide a framework containing these algorithms and the tools required to evaluate and develop them. | sv |
| dc.identifier.coursecode | MPSCN | sv |
| dc.identifier.uri | https://hdl.handle.net/20.500.12380/302178 | |
| dc.language.iso | eng | sv |
| dc.setspec.uppsok | Technology | |
| dc.subject | Computer | sv |
| dc.subject | science | sv |
| dc.subject | computer science | sv |
| dc.subject | engineering | sv |
| dc.subject | project | sv |
| dc.subject | thesis | sv |
| dc.subject | Multi agent path finding | sv |
| dc.subject | Framework | sv |
| dc.title | Framework for multi-agent path finding A framework for multi-agent path finding with focus on transport systems | sv |
| dc.type.degree | Examensarbete för masterexamen | sv |
| dc.type.uppsok | H | |
| local.programme | Computer systems and networks (MPCSN), MSc |