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

dc.contributor.author	Gerdin, Johan
dc.contributor.department	Chalmers tekniska högskola / Institutionen för data och informationsteknik	sv
dc.contributor.examiner	Piterman, Nir
dc.contributor.supervisor	Schiller, Elad Michael
dc.date.accessioned	2020-09-18T13:54:10Z
dc.date.available	2020-09-18T13:54:10Z
dc.date.issued	2020	sv
dc.date.submitted	2020
dc.description.abstract	This 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.coursecode	DATX05	sv
dc.identifier.uri	https://hdl.handle.net/20.500.12380/301738
dc.language.iso	eng	sv
dc.setspec.uppsok	Technology
dc.subject	Multi-agent path-finding	sv
dc.subject	kinematic constraints	sv
dc.subject	speed	sv
dc.title	Multi-agent pathfinding with discrete speeds - and its application for vehicle road networks	sv
dc.type.degree	Examensarbete för masterexamen	sv
dc.type.uppsok	H

Visar 1 - 1 av 1

Visar 1 - 1 av 1