Show simple item record

dc.contributor.authorHolmberg, Linnéa
dc.contributor.authorLemann, Emelie
dc.contributor.authorSörstrand, Elias
dc.contributor.authorWärnsäter, Alfred
dc.date.accessioned2022-07-05T12:47:14Z
dc.date.available2022-07-05T12:47:14Z
dc.date.issued2022-07-05
dc.identifier.urihttps://hdl.handle.net/2077/72680
dc.description.abstractThe purpose of this report is to derive and implement a solver for a multimarginal optimal transport problem. This type of multimarginal optimal transport problem can be used to model and calculate how a swarm of agents should be controlled in an optimal way. Interpolation, entropic regularization and Sinkhorn iterations are used in order to do this. We applied the solver to two different cases. In the first case, the agents started according to a certain distribution inside a 100 × 100 grid and their goal was to evenly spread out. Furthermore, an obstacle was placed in the model that moved through the grid for each time step. In the last case, the algorithm was required to find an optimal way out through a maze.en
dc.language.isosween
dc.subjectoptimal transport; matching problem; assignment problem; agents; interpolation; multimarginal; entropy regularization; Sinkhorn iterationsen
dc.titleOptimaltransport för styrning av en svärm av agenteren
dc.typeText
dc.setspec.uppsokPhysicsChemistryMaths
dc.type.uppsokM2
dc.contributor.departmentUniversity of Gothenburg/Department of Mathematical Scienceeng
dc.contributor.departmentGöteborgs universitet/Institutionen för matematiska vetenskaperswe
dc.type.degreeStudent essay


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record