Solving Common Goal Conflicts in a Graph-based Multi-agent System
Examensarbete för masterexamen
Please use this identifier to cite or link to this item:
Bibliographical item details
|Type: ||Examensarbete för masterexamen|
|Title: ||Solving Common Goal Conflicts in a Graph-based Multi-agent System|
|Authors: ||Håkansson, Liam|
|Abstract: ||We attempt to improve the throughput of graph-based multi-agent AGV system by
solving the issue of common goal conflicts. The conflicts are solved by by assigning
queue positions based on statistical properties of the graph. These properties include
commonly used paths, as well as common fetch and drop locations for orders.
These assignments allow agents, which would otherwise remain stationary due to the
MAPP algorithm’s inability to find a path to occupied goals, to instead be directed
to a suitable intermediate position until the goal becomes available.
|Issue Date: ||2019|
|Publisher: ||Chalmers tekniska högskola / Institutionen för matematiska vetenskaper|
|Collection:||Examensarbeten för masterexamen // Master Theses|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.