130 likes | 244 Vues
This paper explores a refined implementation of FastSLAM using known correspondences to improve path estimation accuracy. Integrating a particle filter, it estimates the posterior path while employing EKF for feature location estimation. Each particle encompasses the path and an EKF for every feature position, allowing for dynamic updates to both the robot's pose and the features. The methodology includes systematic resampling and new feature initialization, yielding robust performance in various environments. This approach enhances kernel methods and significantly advances state-of-the-art probabilistic robotics.
E N D
Probabilistic Robotics FastSLAM with known correspondences Richard Mauldin
Path posterior estimated by a particle filter • Feature locations estimated by EKFs
M particles • M*N EKFs
Each particle contains: • Path estimation • EKF for each feature location
Pose estimate • 1-4 • Update features • 5-24 • Resampling • 25-30
3.Retrieves information for particle k • 4.Samples new robot pose based on control • Pose added to particle k’s path estimation
Determine if the observed feature is new • 7.Initialize mean using measurement function h