 |
Since the elderly are not flexible enough, some of them could not drive or ride bikes. Especially the elderly who need high-care level. So we set the movement mode of the elderly to walk. This mode is set on the map application to calculate the shortest path.
We also set weights for the elderly according to their care levels.
For each police station's jurisdiction, we use the weighted K-means to cluster the elderly so that the cluster's center (population center) is close to the elderly who need high-care level.
For each activity venue in a police station's jurisdiction, we perform the following 4 steps.
In the first step, the shortest paths are calculated from the elderly population center to the activity venue.
In the second step, the shortest paths are then overlapped to form a shortest path tree.
In the third step, we use the breadth-first search to accumulate the number of the elderly possibly passing through each intersection.
Finally, the intersection points are set to the police deployment reference points according to the number of the elderly that may pass through.
|
IEEE/ICACT20230036 Slide.04
[Big Slide]
[YouTube]