MuTraff: A Smart-City Multi-Map Traffic Routing Framework

. 2019 Dec 4;19(24):0. doi: 10.3390/s19245342

Algorithm 1

g e t T W M A r o u n d E d g e (Θ, [i n c i d e n t (n a m e, l a t, l o n g)], Π_{l i n} (k_{1}, k_{2})) \to {[μ_{k, m}]}_{x}

Require:

[i n c i d e n t (n a m e, l a t, l o n g)], Θ, Π_{l i n} (k_{1}, k_{2}),

1:
$[ϵ_{i, j}] \leftarrow r e a d N e t w o r k M a p (Θ)$
2:
${[ϵ_{i, j}]}_{i n c i d e n t} \leftarrow l o c a t e I n c i d e n t E d g e s ([i n c i d e n t (n a m e, l a t, l o n g)], Θ)$
3:
for all $ϵ_{k} \in {[ϵ_{i, j}]}_{i n c i d e n t}$ do
4:
${[ϵ_{i, j}]}_{T W M} \leftarrow g e t E d g e s A r o u n d R a d i u s ([ϵ_{i, j}], ϵ_{k}, R_{x})$
5:
end for
6:
for all $ϵ_{k} \in {[ϵ_{i, j}]}_{T W M}$ do
7:
$t t_{i, j} \leftarrow g e t E d g e S p e e d ([ϵ_{i, j}], ϵ_{k})$
8:
${[μ_{k, m}]}_{x} (ϵ_{k}) \leftarrow Π_{l i n} (t t_{i, j}, k_{1}, k_{2})$
9:
end for