Route Anomaly Detection Using a Linear Route Representation

Algorithm 2

Route Checking for Ordered Routes

(1) Every stored route is an available route.

(2) Find the start location of the traveler in an available

 route 𝑖 and set the current line segment 𝑖_𝑐 to the first

 matched segment.

(3) 𝑑₀ = the distance between the current location and the

 current line segment 𝑖_𝑐.

 𝑑₁ = the distance between the current location and the next line

 segment 𝑖_𝑐+1.

 if [𝑑₀≤𝑒  (the allowable error)], then do nothing,

 else if [(𝑑₀>𝑒) and (𝑑₁≤𝑒)], then 𝑖_𝑐 = 𝑖_𝑐+1 and 𝑖_𝑐+1 = 𝑖_𝑐+2 (the next

 segment after 𝑖_𝑐+1),

 else remove the route from the available routes. If the

 available routes are empty, report an anomaly and stop.

(4) Repeat the above step for the next location of the

 traveler until the traveler ends the route checking.