Curating Long-term Vector Maps
Samer Nashed, Joydeep Biswas

TL;DR
This paper presents a recursive algorithm for building and updating long-term vector maps for mobile robots, improving localization robustness in changing environments by filtering dynamic features and reasoning over multiple deployments.
Contribution
It introduces a novel recursive method to construct and update Long-Term Vector Maps using visibility constraints and SDF filtering, enhancing long-term localization accuracy.
Findings
Accurate and robust LTVMs built from multiple deployments.
Effective filtering of dynamic features improves localization.
LTVMs are compact and suitable for long-term use.
Abstract
Autonomous service mobile robots need to consistently, accurately, and robustly localize in human environments despite changes to such environments over time. Episodic non-Markov Localization addresses the challenge of localization in such changing environments by classifying observations as arising from Long-Term, Short-Term, or Dynamic Features. However, in order to do so, EnML relies on an estimate of the Long-Term Vector Map (LTVM) that does not change over time. In this paper, we introduce a recursive algorithm to build and update the LTVM over time by reasoning about visibility constraints of objects observed over multiple robot deployments. We use a signed distance function (SDF) to filter out observations of short-term and dynamic features from multiple deployments of the robot. The remaining long-term observations are used to build a vector map by robust local linear…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotics and Sensor-Based Localization · Advanced Image and Video Retrieval Techniques · Robotic Path Planning Algorithms
