Past, Present, and Future of Simultaneous Localization And Mapping: Towards the Robust-Perception Age

Simultaneous Localization and Mapping (SLAM)consists in the concurrent construction of a model of the environment (the map), and the estimation of the state of the robot moving within it. The SLAM community has made astonishing progress over the last 30 years, enabling large-scale real-world applications, and witnessing a steady transition of this technology to industry. We survey the current state of SLAM. We start by presenting what is now the de-facto standard formulation for SLAM. We then review related work, covering a broad set of topics including robustness and scalability in long-term mapping, metric and semantic representations for mapping, theoretical performance guarantees, active SLAM and exploration, and other new frontiers. This paper simultaneously serves as a position paper and tutorial to those who are users of SLAM. By looking at the published research with a critical eye, we delineate open challenges and new research issues, that still deserve careful scientific investigation. The paper also contains the authors' take on two questions that often animate discussions during robotics conferences: Do robots need SLAM? and Is SLAM solved

Bayesian Maps: probabilistic and hierarchical models for mobile robot navigation

What is a map? What is its utility? What is a location, a behaviour? What are navigation, localization and prediction for a mobile robot facing a given task ? These questions have neither unique nor straightforward answer to this day, and are still the core of numerous research domains. Robotics, for instance, aim at answering them for creating successful sensori-motor artefacts. Cognitive sciences use these questions as intermediate goals on the road to un- derstanding living beings, their skills, and furthermore, their intelligence. Our study lies between these two domains. We first study classical probabilistic ap- proaches (Markov localization, POMDPs, HMMs, etc.), then some biomimetic approaches (Berthoz, Franz, Kuipers). We analyze their respective advantages and drawbacks in light of a general formalism for robot programming based on bayesian inference (BRP). We propose a new probabilistic formalism for modelling the interaction between a robot and its environment : the Bayesian map. In this framework, defining a map is done by specifying a particular probability distri- bution. Some of the questions above then amount to solving inference problems. We define operators for putting maps together, so that " hierarchies of maps " and incremental development play a central role in our formalism, as in biomimetic approaches. By using the bayesian formalism, we also benefit both from a unified means of dealing with uncertainties, and from clear and rigorous mathematical foundations. Our formalism is illustrated by experiments that have been implemented on a Koala mobile robot

Learning in Real-Time Search: A Unifying Framework

Real-time search methods are suited for tasks in which the agent is interacting with an initially unknown environment in real time. In such simultaneous planning and learning problems, the agent has to select its actions in a limited amount of time, while sensing only a local part of the environment centered at the agents current location. Real-time heuristic search agents select actions using a limited lookahead search and evaluating the frontier states with a heuristic function. Over repeated experiences, they refine heuristic values of states to avoid infinite loops and to converge to better solutions. The wide spread of such settings in autonomous software and hardware agents has led to an explosion of real-time search algorithms over the last two decades. Not only is a potential user confronted with a hodgepodge of algorithms, but he also faces the choice of control parameters they use. In this paper we address both problems. The first contribution is an introduction of a simple three-parameter framework (named LRTS) which extracts the core ideas behind many existing algorithms. We then prove that LRTA*, epsilon-LRTA*, SLA*, and gamma-Trap algorithms are special cases of our framework. Thus, they are unified and extended with additional features. Second, we prove completeness and convergence of any algorithm covered by the LRTS framework. Third, we prove several upper-bounds relating the control parameters and solution quality. Finally, we analyze the influence of the three control parameters empirically in the realistic scalable domains of real-time navigation on initially unknown maps from a commercial role-playing game as well as routing in ad hoc sensor networks