SUMMARYThis paper presents an improved Rao-Blackwellized particle filtering framework with consideration of the particle swarm characteristics in FastSLAM, called Relational FastSLAM or R-FastSLAM. The R-FastSLAM seeks to cope with the inherent problems of FastSLAM, i.e., a particle depletion problem and an error accumulation problem in large environments. The R-FastSLAM uses the particle swarm characteristics in calculating the importance weight and maintaining a particle formation. We assign more accurate weights to particles by clustering them using the Expectation-Maximization (EM) algorithm according to an adaptive weight compensation scheme. In addition, particles constitute an adaptive triangular mesh formation to maintain multiple data association hypotheses without any resampling step. Its outstanding accomplishments are verified on simulations and a test using the Victoria Park dataset by comparing the standard FastSLAM 2.0 with the particle swarm optimization based FastSLAM.