Abstract
A well-known, crucial problem for indoor positioning of mobile agents (e.g., robots) equipped with exteroceptive sensors is related to the need to deploy reference landmarks in a given environment. Normally, anytime a landmark is detected, an agent estimates its own location and attitude with respect to landmark position and/or orientation in the chosen reference frame. When instead no landmark is recognized, other sensors (e.g., odometers in the case of wheeled robots) can be used to track the agent position and orientation from the last detected landmark. At the moment, landmark placement is usually based just on common-sense criteria, which are not formalized properly. As a result, positioning uncertainty tends to grow unpredictably. On the contrary, the purpose of this paper is to minimize the number of landmarks, while ensuring that localization uncertainty is kept within wanted boundaries. The developed approach relies on the following key features: a dynamic model describing agents’ motion, a model predicting the agents’ paths within a given environment and, finally, a conjunctive normal form formalization of the optimization problem, which can be efficiently (although approximately) solved by a greedy algorithm. The effectiveness of the proposed landmark placement technique is first demonstrated through simulations in a variety of conditions and then it is validated through experiments on the field, by using non-Bayesian and Bayesian position tracking algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Instrumentation and Measurement
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.