## Calibration

Calibration by correlation using metric embedding from non-metric similarities.
*IEEE Transactions on Pattern Analysis and Machine Intelligence*, 35:2357–2370, 10 2013.
pdfdoi supp. materialbibtex

Davide and I explain how to calibrate a generic single-view-point camera by only waving it around.

Motion planning in observations space with learned diffeomorphism models.
In *Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)*, 2860–2867. Karlsruhe, Germany, 5 2013.
pdfdoi supp. materialbibtex

Using learned diffeomorphism models of the dynamics of cameras and range-finders, we formulate motion planning as a planning problem in the observations space. Nodes/states are (uncertain) images; actions/edges are (uncertain) diffeomorphisms.

## Localization/SLAM

Coherent measurements selection via l1 relaxation: an approach to robust estimation over graphs.
In *IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)*. October 2014.
bibtex

From Angular Manifolds to the Integer Lattice: Guaranteed Orientation Estimation with Application to Pose Graph Optimization.
*IEEE Transactions on Robotics*, April 2014.
pdfdoi supp. materialbibtex

Pose optimization is what is used in SLAM to optimize the map after pose-pose and pose-features correspondences have been established. The variables in this problem are poses living on the nodes of a graph, and measurements are relative measurements along the graph edges. The problem is hard because orientations live on a manifold with nontrivial topology, which makes the problem nonlinear, nonconvex, and with multiple minima. Luca and I try to solve the subproblem of orientation estimation. We find a way to convert the problem to an unconstrained optimization problem on integers. This makes it possible to solve the problem globally and return all likely guesses for the orientation.

Dense map inference with user-defined priors: from priorlets to scan eigenvariations.
In Cyrill Stachniss, Kerstin Schill, and David Uttal, editors, *Spatial Cognition VIII*, volume 7463 of Lecture Notes in Computer Science, 94–113. Springer Berlin Heidelberg, August 2012.
pdfdoibibtex

Paloma and I
study how to integrate in the mapping problem
"rich" information about the environment structure. We use the concept
of *priorlets* to capture a variety of environment priors. We recover
the map by optimizing at the same time for continuous and discrete
variables (measurements and topology, respectively).

Exploiting motion priors in visual odometry for vehicle-mounted cameras with non-holonomic constraints.
In *IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)*. San Francisco, CA, September 2011.
pdfdoibibtex

Fast and precise visual odometry by exploiting the motion priors specific to the dynamics of a car.

On achievable accuracy for pose tracking.
In *Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)*. Kobe, Japan, May 2009.
pdfdoi supp. materialbibtex

In principle, how precise can a scan-matching method be? This paper
gives a very simple relation between the achievable accuracy for
localization (when the map is known) and the accuracy for scan-matching
(when the map is *not* known).

An experimental assessment of the hsm3d algorithm for sparse and colored data.
In *Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)*, 3595–3600. St. Louis, MO, October 2009.
doibibtex

Adding color to HSM3D.

HSM3D: feature-less global 6DOF scan-matching in the Hough/Radon domain.
In *Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)*. Kobe, Japan, May 2009.
pdfdoi supp. materialbibtex

An ICP variant using a point-to-line metric.
In *Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)*. Pasadena, CA, May 2008.
pdfdoi supp. materialbibtex

An extremely fast and precise ICP variant for range-finder scan matching, which converges quadratically in a finite number of steps. The implementation is available and included also in ROS.

Lazy localization using the Frozen-Time Smoother.
In *Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)*. Pasadena, CA, May 2008.
pdfdoi supp. materialbibtex

Global localization without the worries and anxiety of filtering.

An accurate closed-form estimate of ICP's covariance.
In *Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)*, 3167–3172. Rome, Italy, April 2007.
pdfdoi supp. materialbibtex

This paper describes a *proper* way to compute the covariance of
an ICP estimate, which is shown to be superior to the existing algernatives.

On achievable accuracy for range-finder localization.
In *Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)*, 4170–4175. Rome, Italy, April 2007.
pdfdoi supp. materialbibtex

How precise can a localization method be? This paper derives the Cramer-Rao lower bound for localization with range finders.

Scan matching in a probabilistic framework.
In *Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)*, 2291–2296. Orlando, Florida, May 2006.
pdfdoi supp. materialbibtex

Scan matching in the Hough domain.
In *Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)*, 2739–2744. Barcelona, Spain, 2005.
pdfdoi supp. materialbibtex

A global, complete algorithm for scan matching based on the Hough/Radon transform. This was my Bachelor's thesis.