Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    Estimation with random finite sets

    Access Status
    Fulltext not available
    Authors
    Mullane, J.
    Vo, Ba-Ngu
    Adams, M.
    Vo, B.
    Date
    2011
    Type
    Book Chapter
    
    Metadata
    Show full item record
    Citation
    Mullane J. and Vo B.N. and Adams M., Vo B.T. (2011) Estimation with random finite sets, in Random Finite Sets for Robot Mapping and SLAM. Springer Tracts in Advanced Robotics, vol 72, pp. 27-42. Berlin: Springer.
    Source Title
    Springer Tracts in Advanced Robotics
    DOI
    10.1007/978-3-642-21390-8_3
    School
    School of Electrical Engineering and Computing
    URI
    http://hdl.handle.net/20.500.11937/61281
    Collection
    • Curtin Research Publications
    Abstract

    The previous chapter provided the motivation to adopt an RFS representation for the map in both FBRM and SLAM problems. The main advantage of the RFS formulation is that the dimensions of the measurement likelihood and the predicted FBRM or SLAM state do not have to be compatible in the application of Bayes theorem, for optimal state estimation. The implementation of Bayes theorem with RFSs (equation 2.15) is therefore the subject of this chapter. It should be noted that in any realistic implementation of the vector based Bayes filter, the recursion of equation 2.13 is, in general, intractable. Hence, the well known extended Kalman filter (EKFs), unscented Kalman filter (UKFs) and higher order filters are used to approximate multi-feature, vector based densities. Unfortunately, the general RFS recursion in equation 2.15 is also mathematically intractable, since multiple integrals on the space of features are required. This chapter therefore introduces principled approximations which propagate approximations of the full multi-feature posterior density, such as the expectation of the map. Techniques borrowed from recent research in point process theory known as the probability hypothesis density (PHD) filter, cardinalised probability hypothesis density (C-PHD) filter, and the multi-target, multi-Bernoulli (MeMBer) filter, all offer principled approximations to RFS densities. A discussion on Bayesian RFS estimators will be presented, with special attention given to one of the simplest of these, the PHD filter. In the remaining chapters, variants of this filter will be explained and implemented to execute both FBRM and SLAM with simulated and real data sets. The notion of Bayes optimality is equally as important as the Bayesian recursion of equation 2.15 itself. The following section therefore discusses optimal feature map estimation in the case of RFS based FBRM and SLAM, and once again, for clarity, makes comparisons with vector based estimators. Issues with standard estimators are demonstrated, and optimal solutions presented.

    Related items

    Showing items related by title, author, creator and subject.

    • A Random-Finite-Set Approach to Bayesian SLAM
      Mullane, J.; Vo, Ba-Ngu; Adams, M.; Vo, Ba Tuong (2011)
      This paper proposes an integrated Bayesian frame work for feature-based simultaneous localization and map building (SLAM) in the general case of uncertain feature number and data association. By modeling the measurements ...
    • Rao-Blackwellised RFS Bayesian SLAM
      Mullane, J.; Vo, Ba-Ngu; Adams, M.; Vo, Ba Tuong (2011)
      This chapter proposes an alternative Bayesian framework for feature-based SLAM, again in the general case of uncertain feature number and data association. As in Chapter 5, a first order solution, coined the probability ...
    • An RFS theoretic for Bayesian feature-based robotic mapping
      Mullane, J.; Vo, Ba-Ngu; Adams, M.; Vo, B. (2011)
      Estimating a FB map requires the joint propagation of the FB map density encapsulating uncertainty in feature number and location. This chapter addresses the joint propagation of the FB map density and leads to an optimal ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin would like to pay respect to the Aboriginal and Torres Strait Islander members of our community by acknowledging the traditional owners of the land on which the Perth campus is located, the Whadjuk people of the Nyungar Nation; and on our Kalgoorlie campus, the Wongutha people of the North-Eastern Goldfields.