Abstract
A static world assumption is often used when considering the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">simultaneous localization and mapping</i> (SLAM) problem. In reality, especially when long-term autonomy is the objective, this is not valid. This paper studies a scenario where uniquely identifiable landmarks can attend multiple discrete positions, not known <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">a priori</i> . Based on a feature based multi-hypothesis map representation, a multi-hypothesis SLAM algorithm is developed inspired by target tracking theory. The creation of such a map is merged into the SLAM framework allowing any available SLAM method to solve the underlying mapping and localization problem for each hypothesis. A recursively updated hypothesis score allows for hypothesis rejection and prevents exponential growth in the number of hypotheses. The developed method is evaluated in an underground mine application, where physical barriers can be moved in between multiple distinct positions. Simulations are conducted in this environment showing the benefits of the multi-hypothesis approach compared to executing a standard SLAM algorithm. Practical considerations as well as suitable approximations are elaborated upon and experiments on real data further validates the simulated results and show that the multi-hypothesis approach has similar performance in reality as in simulation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.