Complexity Issues in Probabilistic Mapping

Thursday, December 5, 2002 - 3:30pm - 4:00pm
Keller 3-180
Joao Hespanha (University of California)
This talk addresses the issue of estimating the positions of a group of objects using a stream of noisy sensor measurements. This is often called probabilistic mapping. From a formal point of view, probabilistic maps are just the probability densities of object positions, conditioned to the available sensor measurements. In this talk we will explore issues related to the computational complexity of constructing probabilistic maps and also utilizing them in the context of path planning.