A transformation of the Position Based Visual Servoing Problem into a convex optimization problem

Here we address the problem of moving a camera from an initial pose to a final pose. The trajectory between the two poses is subject to constraints on the camera motion and the visibility, where we have bounds on the allowed velocities and accelerations of the camera and require that a set of point features are visible for the camera. We assume that the pose is possible to retrieve from the observations of the point features, i.e., we have a Position Based Visual Servoing Problem with constraints. We introduce a two step method that transforms the problem into a convex optimization problem with linear constraints. In the first step the rotational motion is restricted to be of a certain type. This restriction allows us to retrieve an explicit solution of the rotational motion that is optimal in terms of minimizing geodesic distance. Furthermore, this restriction guarantees that the rotational motion satisfies the constraints. Using the explicit solution, we can formulate a convex optimization problem for the translational motion, where we include constraints on workspace and visibility.