A Numerically Robust Algorithm to Solve the Five-Pose Burmester Problem

Introduced in this paper is a robust algorithm to solve the five-pose planar Burmester problem. The proposed algorithm functions even in the presence of special conditions of the prescribed poses that lead to algorithmic singularities otherwise. In order to show the applicability and to validate the robustness of the proposed algorithm, some examples are included.