This is a reference implementation and will not be actively maintained in the future. The code in this repository is a refactored version of the codebase we used to produce the results in the paper ...

Abstract: In this article, the problem of online distributed optimization subject to a convex set is studied by employing a network of agents, where the objective functions allocated to agents are ...

Abstract: Polygonal collision avoidance (PCA) is short for the problem of collision avoidance between two polygons (i.e., polytopes in planar) that own their dynamic equations. This problem suffers ...