Localization with Few Distance Measurements
Wednesday, March 30th, 5:10pm Tel Aviv time (4:10pm CET, 10:10am NY time)
Barak Ugav, Tel Aviv University
Abstract:
The robot localization problem has been researched for many years with many
variants, but what if the robot is limited in the number of distance
measurements it is able to perform?
In this talk I will present a variant with only a few (one or two) distance
measurements, and an algorithm to address this case, which preprocesses the
scene to support queries given a few distance measurement values.
This is joint work with Dan Halperin and Steven M. LaValle.