Sensor localization from distance and orientation constraints

Citations of this article
Mendeley users who have this article in their library.


The sensor localization problem can be formalized using distance and orientation constraints, typically in 3D. Local methods can be used to refine an initial location estimation, but in many cases such estimation is not available and a method able to determine all the feasible solutions from scratch is necessary. Unfortunately, existing methods able to find all the solutions in distance space can not take into account orientations, or they can only deal with one- or two-dimensional problems and their extension to 3D is troublesome. This paper presents a method that addresses these issues. The proposed approach iteratively projects the problem to decrease its dimension, then reduces the ranges of the variable distances, and back-projects the result to the original dimension, to obtain a tighter approximation of the feasible sensor locations. This paper extends previous works introducing accurate range reduction procedures which effectively integrate the orientation constraints. The mutual localization of a fleet of robots carrying sensors and the position analysis of a sensor moved by a parallel manipulator are used to validate the approach.




Porta, J. M., Rull, A., & Thomas, F. (2016). Sensor localization from distance and orientation constraints. Sensors (Switzerland), 16(7).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free