Application of Hungarian Algorithm for Assignment Problem
Ventseslav Shopov, Vanya Markova
Abstract
In this study, we consider the application of the Hungarian algorithm for allocating positions in robotic formations. Two modifications of the Hungarian algorithm are compared. The time dependence for determining bipartite matching for different number of agents was investigated..
Topics & Concepts
Bipartite graphHungarian algorithmMatching (statistics)Assignment problemComputer scienceAlgorithmBlossom algorithmMathematical optimizationTheoretical computer scienceMathematicsStatisticsGraphOptimization and Search ProblemsRobotic Path Planning AlgorithmsAdvanced Manufacturing and Logistics Optimization