TY - JOUR
T1 - A safe and comprehensive route finding algorithm for pedestrians based on lighting and landmark conditions
AU - Bao, Siya
AU - Nitta, Tomoyuki
AU - Yanagisawa, Masao
AU - Togawa, Nozomu
PY - 2017/11/1
Y1 - 2017/11/1
N2 - In this paper, we propose a safe and comprehensive route finding algorithm for pedestrians based on lighting and landmark conditions. Safety and comprehensiveness can be predicted by the five possible indicators: (1) lighting conditions, (2) landmark visibility, (3) landmark effectiveness, (4) turning counts along a route, and (5) road widths. We first investigate impacts of these five indicators on pedestrians' perceptions on safety and comprehensiveness during route findings. After that, a route finding algorithm is proposed for pedestrians. In the algorithm, we design the score based on the indicators (1), (2), (3), and (5) above and also introduce a turning count reduction strategy for the indicator (4). Thus we find out a safe and comprehensive route through them. In particular, we design daytime score and nighttime score differently and find out an appropriate route depending on the time periods. Experimental simulation results demonstrate that the proposed algorithm obtains higher scores compared to several existing algorithms. We also demonstrate that the proposed algorithm is able to find out safe and comprehensive routes for pedestrians in real environments in accordance with questionnaire results.
AB - In this paper, we propose a safe and comprehensive route finding algorithm for pedestrians based on lighting and landmark conditions. Safety and comprehensiveness can be predicted by the five possible indicators: (1) lighting conditions, (2) landmark visibility, (3) landmark effectiveness, (4) turning counts along a route, and (5) road widths. We first investigate impacts of these five indicators on pedestrians' perceptions on safety and comprehensiveness during route findings. After that, a route finding algorithm is proposed for pedestrians. In the algorithm, we design the score based on the indicators (1), (2), (3), and (5) above and also introduce a turning count reduction strategy for the indicator (4). Thus we find out a safe and comprehensive route through them. In particular, we design daytime score and nighttime score differently and find out an appropriate route depending on the time periods. Experimental simulation results demonstrate that the proposed algorithm obtains higher scores compared to several existing algorithms. We also demonstrate that the proposed algorithm is able to find out safe and comprehensive routes for pedestrians in real environments in accordance with questionnaire results.
KW - Anxiety
KW - Comprehensiveness
KW - Landmark
KW - Lighting
KW - Pedestrian
KW - Road width
KW - Safety
KW - Turning point
UR - http://www.scopus.com/inward/record.url?scp=85033453450&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85033453450&partnerID=8YFLogxK
U2 - 10.1587/transfun.E100.A.2439
DO - 10.1587/transfun.E100.A.2439
M3 - Article
AN - SCOPUS:85033453450
VL - E100A
SP - 2439
EP - 2450
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
SN - 0916-8508
IS - 11
ER -