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.