Table 2.

The shortest-path information vector when there are other agents on the nearest route

	$l_d$ distance	Input vector
${\alpha }_0$	$-$	$-T_{\mathrm{wait}}/\mathrm{C}$
${\alpha }_1$	$19.2+28.7=47.9$	$-7.9/\mathrm{C}$
${\alpha }_2$	$18.3+21.7=40.0$	$0/\mathrm{C}$
${\alpha }_3$	$26.4+17.1=38.5$	$-1$

C $\mathrm{Clipping}\mathrm{constant}$