Mobile Robotics in a Random Finite Set Framework
MetadataShow full item record
This paper describes the Random Finite Set approach to Bayesian mobile robotics, which is based on a natural multi-object filtering framework, making it well suited to both single and swarm-based mobile robotic applications. By modeling the measurements and feature map as random finite sets (RFSs), joint estimates the number and location of the objects (features) in the map can be generated. In addition, it is shown how the path of each robot can be estimated if required. The framework differs dramatically from existing approaches since both data association and feature management routines are integrated into a single recursion. This makes the framework well suited to multi-robot scenarios due to the ease of fusing multiple map estimates from swarm members, as well as mapping robustness in the presence of other mobile robots which may induce false map measurements. An overview of developments thus far is presented, with implementations demonstrating the merits of the framework on simulated and experimental datasets.
Showing items related by title, author, creator and subject.
Adams, M.; Mullane, J.; Vo, Ba-Ngu (2011)Perceptive laser and radar sensors provide information from the surrounding environment and are a critical aspect of many robotics applications. These sensors are generally subject to many sources of uncertainty, namely ...
Adams, M.; Mullane, J.; Ebi, J.; Vo, Ba-Ngu (2012)Focusing on autonomous robotic applications, this cutting-edge resource offers you a practical treatment of short-range radar processing for reliable object detection at the ground level. This unique book demonstrates ...
Moratuwage, D.; Vo, Ba-Ngu; Wang, D (2013)Although simultaneous localization and mapping (SLAM) algorithms are widely appreciated in mobile robot navigation, they can be further improved to suit practical applications in dynamic environmental conditions. One such ...