Planning algorithms are impacting technical disciplines and industries around the world, including robotics, computer-aided design, manufacturing, computer graphics, aerospace applications, drug design, and protein folding. This coherent and comprehensive book unifies material from several sources, including robotics, control theory, artificial intelligence, and algorithms. The treatment is centered on robot motion planning but integrates material on planning in discrete spaces. A major part of the book is devoted to planning under uncertainty, including decision theory, Markov decision processes, and information spaces, which are the “configuration spaces” of all sensor-based planning problems. The last part of the book delves into planning under differential constraints that arise when automating the motions of virtually any mechanical system. Developed from courses taught by the author, the book is intended for students, engineers, and researchers in robotics, artificial intelligence, and control theory as well as computer graphics, algorithms, and computational biology.

Planning Algorithms: Introductory Material

We present a real-time algorithm which can recover the 3D trajectory of a monocular camera, moving rapidly through a previously unknown scene. Our system, which we dub MonoSLAM, is the first successful application of the SLAM methodology from mobile robotics to the "pure vision" domain of a single uncontrolled camera, achieving real time but drift-free performance inaccessible to structure from motion approaches. The core of the approach is the online creation of a sparse but persistent map of natural landmarks within a probabilistic framework. Our key novel contributions include an active approach to mapping and measurement, the use of a general motion model for smooth camera movement, and solutions for monocular feature initialization and feature orientation estimation. Together, these add up to an extremely efficient and robust algorithm which runs at 30 Hz with standard PC and camera hardware. This work extends the range of robotic systems in which SLAM can be usefully applied, but also opens up new areas. We present applications of MonoSLAM to real-time 3D localization and mapping for a high-performance full-size humanoid robot and live augmented reality with a hand-held camera

/pdf/monoslam-real-time-single-camera-slam-ydmj8dc1vj.pdf

MonoSLAM: Real-Time Single Camera SLAM

This paper describes the simultaneous localization and mapping (SLAM) problem and the essential methods for solving the SLAM problem and summarizes key implementations and demonstrations of the method. While there are still many practical issues to overcome, especially in more complex outdoor environments, the general SLAM method is now a well understood and established part of robotics. Another part of the tutorial summarized more recent works in addressing some of the remaining issues in SLAM, including computation, feature representation, and data association

/pdf/simultaneous-localization-and-mapping-part-i-22ofxwafhj.pdf

Simultaneous localization and mapping: part I

Dynamic Bayesian Networks: Representation, Inference and Learning by Kevin Patrick Murphy Doctor of Philosophy in Computer Science University of California, Berkeley Professor Stuart Russell, Chair Modelling sequential data is important in many areas of science and engineering. Hidden Markov models (HMMs) and Kalman filter models (KFMs) are popular for this because they are simple and flexible. For example, HMMs have been used for speech recognition and bio-sequence analysis, and KFMs have been used for problems ranging from tracking planes and missiles to predicting the economy. However, HMMs and KFMs are limited in their “expressive power”. Dynamic Bayesian Networks (DBNs) generalize HMMs by allowing the state space to be represented in factored form, instead of as a single discrete random variable. DBNs generalize KFMs by allowing arbitrary probability distributions, not just (unimodal) linear-Gaussian. In this thesis, I will discuss how to represent many different kinds of models as DBNs, how to perform exact and approximate inference in DBNs, and how to learn DBN models from sequential data. In particular, the main novel technical contributions of this thesis are as follows: a way of representing Hierarchical HMMs as DBNs, which enables inference to be done in O(T ) time instead of O(T ), where T is the length of the sequence; an exact smoothing algorithm that takes O(log T ) space instead of O(T ); a simple way of using the junction tree algorithm for online inference in DBNs; new complexity bounds on exact online inference in DBNs; a new deterministic approximate inference algorithm called factored frontier; an analysis of the relationship between the BK algorithm and loopy belief propagation; a way of applying Rao-Blackwellised particle filtering to DBNs in general, and the SLAM (simultaneous localization and mapping) problem in particular; a way of extending the structural EM algorithm to DBNs; and a variety of different applications of DBNs. However, perhaps the main value of the thesis is its catholic presentation of the field of sequential data modelling.

/pdf/dynamic-bayesian-networks-representation-inference-and-yy4fhfxdcj.pdf

Dynamic bayesian networks: representation, inference and learning

Simultaneous Localization and Mapping (SLAM) is an essential capability for mobile robots exploring unknown environments. The Extended Kalman Filter (EKF) has served as the de-facto approach to SLAM for the last fifteen years. However, EKF-based SLAM algorithms suffer from two well-known shortcomings that complicate their application to large, real-world environments: quadratic complexity and sensitivity to failures in data association. I will present an alternative approach to SLAM that specifically addresses these two areas. This approach, called FastSLAM, factors the full SLAM posterior exactly into a product of a robot path posterior, and N landmark posteriors conditioned on the robot path estimate. This factored posterior can be approximated efficiently using a particle filter. The time required to incorporate an observation into FastSLAM scales logarithmically with the number of landmarks in the map. 
In addition to sampling over robot paths, FastSLAM can sample over potential data associations. Sampling over data associations enables FastSLAM to be used in environments with highly ambiguous landmark identities. This dissertation will describe the FastSLAM algorithm given both known and unknown data association. The performance of FastSLAM will be compared against the EKF on simulated and real-world data sets. Results will show that FastSLAM can produce accurate maps in extremely large environments, and in environments with substantial data association ambiguity. Finally, a convergence proof for FastSLAM in linear-Gaussian worlds will be presented.

/pdf/fastslam-a-factored-solution-to-the-simultaneous-4abc0zd0d4.pdf

Fastslam: a factored solution to the simultaneous localization and mapping problem with unknown data association

The simultaneous localization and map building (SLAM) problem asks if it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and then to incrementally build a map of this environment while simultaneously using this map to compute absolute vehicle location. Starting from estimation-theoretic foundations of this problem, the paper proves that a solution to the SLAM problem is indeed possible. The underlying structure of the SLAM problem is first elucidated. A proof that the estimated map converges monotonically to a relative map with zero uncertainty is then developed. It is then shown that the absolute accuracy of the map and the vehicle location reach a lower bound defined only by the initial vehicle uncertainty. Together, these results show that it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and, using relative observations only, incrementally build a perfect map of the world and to compute simultaneously a bounded estimate of vehicle location. The paper also describes a substantial implementation of the SLAM algorithm on a vehicle operating in an outdoor environment using millimeter-wave radar to provide relative map observations. This implementation is used to demonstrate how some key issues such as map management and data association can be handled in a practical environment. The results obtained are cross-compared with absolute locations of the map landmarks obtained by surveying. In conclusion, the paper discusses a number of key issues raised by the solution to the SLAM problem including suboptimal map-building algorithms and map management.

/pdf/a-solution-to-the-simultaneous-localization-and-map-building-2pp3i7uhdj.pdf

A solution to the simultaneous localization and map building (SLAM) problem

The simultaneous localisation and map building (SLAM) problem asks if it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and then to incrementally build a map of this environment while simultaneously using this map to compute absolute vehicle location. Starting from the estimation-theoretic foundations of this problem developed in [5, 4, 2], this paper proves that a solution to the SLAM problem is indeed possible. The underlying structure of the SLAM problem is first elucidated. A proof that the estimated map converges monotonically to a relative map with zero uncertainty is then developed. It is then shown that the absolute accuracy of the map and the vehicle location reach a lower bound defined only by the initial vehicle uncertainty. Together, these results show that it is possible for an autonomous vehicle to start in an unknown location in an unknown environment and, using relative observations only, incrementally build a perfect map of the world and simultaneously to compute a bounded estimate of vehicle location.

An Experimental and Theoretical Investigation into Simultaneous Localisation and Map Building

A new approach for the autonomous navigation of a load-haul-dump (LHD) truck in an underground mine is presented. The development of a minimal-structure combined ICP-EKF algorithm utilizing a scanning-laser range-finder for the localization of the vehicle is described. The iterative closest point (ICP) algorithm is employed for matching the scanned data to an existing map in the form of a poly-line. This combined approach efficiently deals with the uncertainty present in the range data. An extended Kalman filter (EKF) algorithm is employed, that exploits a nonlinear kinematic model incorporating the vehicle-slip, a nonlinear observation model based on the vertices of the poly-line map, and the bearing of the laser-observations. This provides reliable vehicle estimates. Real data gathered during a trial run in the mine is employed in testing the efficiency of this approach which is found to be robust with respect to occlusions and outliers, demonstrating the successful navigation of the LHD.

Autonomous underground navigation of an LHD using a combined ICP-EKF approach

An automatic system for polishing an unknown three-dimensional surface using a passively compliant end-effector mounted on the wrist of an industrial robot is described. As polishing proceeds, the end-effector uses position sensors to measure the misalignment of the robot's wrist from the local surface normal. A personal computer is used to acquire sensory data, to compute the desired configuration of the robot wrist, and to control the robot in a point-to-point mode. Low bandwidth point-to-point control is possible because of the passive compliant movement of the end-effector. Contact with the work surface can be maintained within an angular range of ±8° and a ±10 mm range of normal translational movement. Experimental performance tests show that the polishing system can function well under a variety of working conditions.

Automated polishing of an unknown three-dimensional surface

Planning appropriate trajectories can significantly increase the productivity of robot systems. To plan realistic time-optimal trajectories, the robot dynamics have to be described precisely. In this paper, a neural network based algorithm for tim e-optimal trajectory planning is introduced. This method utilises neural networks for representing the inverse dynamics of the robot. As the proposed neural networks can be trained with data obtained from exciting the robot with given torque inputs, they will capture the complete dynamics of the robot system. Threfore, the trajectories generated will be mo re realistic than those obtained by using nominal dynamic equations based on nominal parameters. Time-optimal trajectories are generated for a PUMA robot to demonstrate the proposed method.

M.W.M.G. Dissanayake

Papers

A solution to the simultaneous localization and map building (SLAM) problem

An Experimental and Theoretical Investigation into Simultaneous Localisation and Map Building

Autonomous underground navigation of an LHD using a combined ICP-EKF approach

Automated polishing of an unknown three-dimensional surface

A neural network-based method for time-optimal trajectory planning