QUESTIONS AND CORRECT ANSWERS
Time & Space Complexity for Histogram Filters - CORRECT ANSWER Exponential -
O(n^m), where n is the resolution of our bins and m is our number of dimensions.
Bayes' Rule - CORRECT ANSWER P(A|B)=P(B|A)P(A)/P(B)
Properties of Kalman Filters - CORRECT ANSWER Continuous, Unimodal, Symmetric,
Approximate
Properties of Particle Filters - CORRECT ANSWER Continuous, Multimodal, Approximate
Properties of Histogram Filters - CORRECT ANSWER Discrete, Multimodal, Approximate
Time & Space Complexity of Particle Filters - CORRECT ANSWER ??? - Can be exponential,
can be better in some applications.
Time & Space Complexity of Kalman Filters - CORRECT ANSWER Quadratic - O(N^2)?
When do we use convolutions in the motion/measure cycle? - CORRECT ANSWER Motion
When do we use multiplication in the motion/measure cycle? - CORRECT
ANSWER Measurement
When do we use the Law of Total Probability in the motion/measure cycle? - CORRECT
ANSWER Motion
When do we use Bayes' Rule in the motion/measure cycle? - CORRECT
ANSWER Measurement