This package contains structures and algorithms necessary to replicate the experiments in Thin junction tree filters for simultaneous localization and mapping.

See:
Description

Packages

javaslam.filter	Contains data structures and algorithms for linear-Gaussian filtering and linearizing nonlinear functions.
javaslam.prob	Contains data structures and algorithms relating to probability theory.
javaslam.slam	Contains data structures and algorithms for filtering approaches to the Simultaneous Localization and Mapping (SLAM) problem (with known data association).
javaslam.tjt	Contains data structures and algorithms for incremental junction tree maintenance and junction tree thinning.
javaslam.tjt.graph	Contains a simple graph data structure and methods for search.
javaslam.util	Contains generic data structures and algorithms.

This package contains structures and algorithms necessary to replicate the experiments in Thin junction tree filters for simultaneous localization and mapping. Mark A. Paskin. Computer Science Division Technical Report CSD-02-1198, University of California, Berkeley. 2002.