The role of Bayesian bounds in comparing SLAM algorithms performance.
Andrea CensiPublished in: PerMIS (2008)
Keyphrases
- worst case
- learning algorithm
- upper and lower bounds
- data structure
- upper bound
- orders of magnitude
- computational complexity
- bayesian networks
- computationally efficient
- theoretical analysis
- lower bound
- significant improvement
- mobile robot
- markov random field
- convergence rate
- data dependent
- genetic algorithm
- perceptron algorithm
- pac bayesian