Iterative algorithms for minimizing the Hausdorff distance between convex polyhedrons

The problem of finding the optimal location of moving bodies in three-dimensional Euclidean space is considered. We study the problem of finding such a position for two given polytopes $ A $ and $ B $ at which the Hausdorff distance between them would be minimal. To solve it, the apparatus of convex and nonsmooth analysis is used, as well as methods of computational geometry. Iterative algorithms have been developed and justification has been made for the correctness of their work. A software package has been created, its work is illustrated with specific examples.