Abstract: In this article, we focus on the cooperative path planning for unmanned surface vehicles (USVs) composed of single-USV path planning and multi-USVs task assignment. First, the Glasius ...

Abstract: In this paper, a novel decentralized task allocation algorithm based on the Hungarian approach is proposed. The proposed algorithm guarantees an optimal solution as long as the agent network ...

Centre for Social Sciences, Institute for Political Science, Hungarian Academy of Sciences; Corvinus University of Budapest, Institute of International Studies; Cold War History Research Center, ...

This is the readme file for the Paper "Accelerating the Hungarian Algorithm: Computing Linear Assignments on CPUs, GPUs, and IPUs". IPU: We run our algorithm on the 1.325GHz Mk2 GC200 IPU. GPU: All ...

Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...