no code implementations • 25 Jul 2024 • Max Emerick, Stacy Patterson, Bassam Bamieh
Assignments have costs related to the distances between mutually assigned agents, and the overall cost of an assignment is quantified by a Wasserstein distance between the densities of the two agent classes.
no code implementations • 23 Mar 2024 • Max Emerick, Jared Jonas, Bassam Bamieh
Optimal solutions to this problem are non-causal and require knowing the time-trajectory of the reference distribution in advance.
no code implementations • 27 Mar 2023 • Max Emerick, Bassam Bamieh
We consider a setting in which one swarm of agents is to service or track a second swarm, and formulate an optimal control problem which trades off between the competing objectives of servicing and motion costs.