Skip to main content

InfoTech conference

2022 IEEE International Conference on Information Technologies

Application of Hungarian Algorithm for Assignment Problem

Ventseslav Shopov
Vanya Markova
Institute of Robotics, Bulgarian Academy of Sciences, Plovdiv

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.

Key words:
Robot formation
Assignment problem Hungarian algorithm