| Algorithm 1 | |
| Purpose: | obtaining a safe route to go from an origin point to a destination point |
| Inputs: | origin and destination points |
| Output: | representation of the route on a city map and guidance of the user’s safe route |
| 1: | routePoints ← get the default route (origin, destination) |
| 2: | pedestrianPoints ← pedestrian areas near to the route (routePoints) |
| 3: | if size (pedestrianPoints) ≠ 0 |
| 4: | optimizedRoute = false |
| 5: | repeat |
| 6: | routePoints ← route optimization (origin, destination, pedestrianPoints) |
| 7: | pedestrianPoints ← calculation of new pedestrian points near to the route (routePoints) |
| 8: | if size(pedestrianPoints) = 0 |
| 9: | optimizedRoute = true |
| 10: | end if |
| 11: | until (!optimizedRoute) |
| 12: | end if |
| 13: | trace safe route on city map |
| 14: | highlight the safe pedestrian points included in the route by means of a special icon |