Research on Global Path Planning of Robot Based on Ant Colony Algorithm and Gaussian Sampling

Table 7

Simulation results of PSO, GA, and S-IACO algorithms.

Map environment	Algorithm	Path length (m)	Iterations	Simulation time (s)
30 × 30 environment map (Figure 8(a))	PSO	52.65	49	11.89
	GA	51.87	53	12.63
	S-IACO	49.36	35	9.10
30 × 30 environment map (Figure 8(b))	PSO	52.79	48	12.07
	GA	54.87	53	13.43
	S-IACO	49.36	35	9.51
30 × 30 environment map (Figure 8(c))	PSO	53.29	46	11.17
	GA	54.63	50	12.56
	S-IACO	44.52	40	9.70