Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T13:02:00.418Z Has data issue: false hasContentIssue false

Adaptive computational SLAM incorporating strategies of exploration and path planning

Published online by Cambridge University Press:  02 December 2019

Jacky Baltes
Affiliation:
Department of Electrical Engineering, National Taiwan Normal University, Taipei, Taiwan e-mail: jhsu@ntnu.edu.tw
Da-Wei Kung
Affiliation:
Department of Electrical Engineering, National Taiwan Normal University, Taipei, Taiwan e-mail: jhsu@ntnu.edu.tw
Wei-Yen Wang
Affiliation:
Department of Electrical Engineering, National Taiwan Normal University, Taipei, Taiwan e-mail: jhsu@ntnu.edu.tw
Chen-Chien Hsu
Affiliation:
Department of Electrical Engineering, National Taiwan Normal University, Taipei, Taiwan e-mail: jhsu@ntnu.edu.tw
Rights & Permissions [Opens in a new window]

Abstract

Simultaneous localization and mapping (SLAM) is a well-known and fundamental topic for autonomous robot navigation. Existing solutions include the FastSLAM family-based approaches which are based on Rao–Blackwellized particle filter. The FastSLAM methods slow down greatly when the number of landmarks becomes large. Furthermore, the FastSLAM methods use a fixed number of particles, which may result in either not enough algorithms to find a solution in complex domains or too many particles and hence wasted computation for simple domains. These issues result in reduced performance of the FastSLAM algorithms, especially on embedded devices with limited computational capabilities, such as commonly used on mobile robots. To ease the computational burden, this paper proposes a modified version of FastSLAM called Adaptive Computation SLAM (ACSLAM), where particles are predicted only by odometry readings, and are updated only when an expected measurement has a maximum likelihood. As for the states of landmarks, they are also updated by the maximum likelihood. Furthermore, ACSLAM uses the effective sample size (ESS) to adapt the number of particles for the next generation. Experimental results demonstrated that the proposed ACSLAM performed 40% faster than FastSLAM 2.0 and also has higher accuracy.

Information

Type
Robot Athletes and Entertainers
Copyright
© Cambridge University Press 2019 
Figure 0

Figure 1Flow chart of the proposed SLAM system

Figure 1

Figure 2Flow chart of the ACSLAM

Figure 2

Figure 3Relationship between the number of particles and ESS

Figure 3

Figure 4Flow chart of frontier-based exploration

Figure 4

Figure 5Set the current frontiers from the laser

Figure 5

Figure 6Frontiers curr and Frontiers temp

Figure 6

Figure 7Delete the known frontiers

Figure 7

Figure 8Diagrams of (a) the goal vector and (b) the obstacle vector

Figure 8

Figure 9Flow chart of the potential field method incorporated in the proposed SLAM system

Figure 9

Figure 10A bit map with resolution of 500 × 500 for simulations

Figure 10

Figure 11Dynamic number of particles

Figure 11

Figure 12Simulations of various SLAM algorithms

Figure 12

Figure 13Mean and covariance of x error

Figure 13

Figure 14Mean and covariance of y error

Figure 14

Table 1Simulation results

Figure 15

Figure 15Two different maps for the simulation

Figure 16

Figure 16The process of ACSLAM for mapping

Figure 17

Figure 17The process of setting the frontiers

Figure 18

Figure 18The potential field nearing the robot

Figure 19

Figure 19The process of ACSLAM for mapping

Figure 20

Figure 20The process of setting the frontiers

Figure 21

Figure 21The potential field nearing the robot

Figure 22

Table 2Runtime efficiency of the exploration adaptive computational simultaneous localization and mapping with different maps

Figure 23

Figure 22Experimental environment of case I

Figure 24

Figure 23Experimental results in case I

Figure 25

Table 3Experimental results in case I

Figure 26

Figure 24Experimental map in case II

Figure 27

Figure 25Experimental results in case II

Figure 28

Table 4Experimental results in case II