Improved Optimal Path Finding Algorithm of Multistorey Car Park Based on MCP Protocol

Table 3

Comparison of two algorithm results.

	Recommended parking space	Path	Path distance (m)	Time-consuming (ms)
Dijkstra	P1	M ⟶ D1 ⟶ D4 ⟶ P1	45.72	88.79
ParkIG	P1	M ⟶ D1 ⟶ D4 ⟶ P1	45.72	55.82