• Title/Summary/Keyword: 운전자부하

Search Result 75, Processing Time 0.018 seconds

The Comparative Study on Travel Behavior and Traffic Accident Characteristics on a Community Road - With Focus on Seoul Metropolitan City (생활도로에서의 교통행태와 교통사고특성에 관한 연구 - 서울특별시를 중심으로)

  • Lim, Joonbeom;Lee, Sooil;Choi, Jongchul;Joo, Sungkab
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.36 no.1
    • /
    • pp.97-104
    • /
    • 2016
  • In Korea, the number of crash accident victims per 100,000 population is three times higher than the average of OECD. In particular, 60% of it occurs on the community road. Thus, this study intends to analyze the causes of such accidents through a pedestrian and vehicle traffic survey. The purpose is to establish practical safety enhancement measures for community roads. In recent years, lots of changes have occurred in the pedestrian environment. A traffic survey shows that 65% of pedestrians walk on the right and 17% of people use smart-phones while walking. An eye camera experiment shows that the operation load of drivers on the community roads is more than 4 times higher than those in urban roads. According to a speed survey, 62% of vehicles drive at 30km/h or above. The characteristics of accidents on community roads are as follows. First, the ratio of accidents on the edge of the road is 2.3 times as high as those on other roads. Second, when people walk on the right, the ratio of accidents is 2.5 times as high as that of walking on the left. Third, it becomes more dangerous when people cross the road from the right to the left. The majority of accidents is caused by unsafe driving (84.4%). When a vehicle makes a left turn, the likelihood of accidents is 2.3 times as high as those caused by a right turn. The ratio of accidents caused by vehicles going backwards is 14% among all accidents. In community roads, the focus of drivers should be at least 4 times higher than those on urban roads. Thus, walking in the opposite direction of vehicles and careless behaviors are highly likely lead to accidents.

A User Optimer Traffic Assignment Model Reflecting Route Perceived Cost (경로인지비용을 반영한 사용자최적통행배정모형)

  • Lee, Mi-Yeong;Baek, Nam-Cheol;Mun, Byeong-Seop;Gang, Won-Ui
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.2
    • /
    • pp.117-130
    • /
    • 2005
  • In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.

The Development of Predictive Multiclass Dynamic Traffic Assignment Model and Algorithm (예측적 다중계층 동적배분모형의 구축 및 알고리즘 개발)

  • Kang, Jin-Gu;Park, Jin-Hee;Lee, Young-Ihn;Won, Jai-Mu;Ryu, Si-Kyun
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.5
    • /
    • pp.123-137
    • /
    • 2004
  • The study on traffic assignment is actively being performed which reflect networks status using time. Its background is increasing social needs to use traffic assignment models in not only hardware area of road network plan but also software area of traffic management or control. In addition, multi-class traffic assignment model is receiving study in order to fill a gap between theory and practice of traffic assignment model. This model is made up of two, one of which is multi-driver class and the other multi-vehicle class. The latter is the more realistic because it can be combined with dynamic model. On this background, this study is to build multidynamic model combining the above-mentioned two areas. This has been a theoretic pillar of ITS in which dynamic user equilibrium assignment model is now made an issue, therefore more realistic dynamic model is expected to be built by combining it with multi-class model. In case of multi-vehicle, FIFO would be violated which is necessary to build the dynamic assignment model. This means that it is impossible to build multi-vehicle dynamic model with the existing dynamic assignment modelling method built under the conditions of FIFO. This study builds dynamic network model which could relieve the FIFO conditions. At the same time, simulation method, one of the existing network loading method, is modified to be applied to this study. Also, as a solution(algorithm) area, time dependent shortest path algorithm which has been modified from existing shortest path algorithm and the existing MSA modified algorithm are built. The convergence of the algorithm is examined which is built by calculating dynamic user equilibrium solution adopting the model and algorithm and grid network.

An Adaptive Relay Node Selection Scheme for Alert Message Propagation in Inter-vehicle Communication (차량간 통신에서 긴급 메시지 전파를 위한 적응적 릴레이 노드 선정기법)

  • Kim, Tae-Hwan;Kim, Hie-Cheol;Hong, Won-Kee
    • The KIPS Transactions:PartC
    • /
    • v.14C no.7
    • /
    • pp.571-582
    • /
    • 2007
  • Vehicular ad-hoc networks is temporarily established through inter-vehicle communication without any additional infrastructure aids. It requires a immediate message propagation because it mainly deals with critical traffic information such as traffic accidents. The distance-based broadcast scheme is one of the representative broadcast schemes for vehicular ad-hoc network. In this scheme, a node to disseminate messages is selected based on a distance from a source node. However, a message propagation delay will be increased if the relay nodes are not placed at the border of transmission range of the source node. In particular, when the node density is low, the message propagation delay is getting longer. In this paper, we propose a time-window reservation based relay node selection scheme. A node receiving the alert message from the source node has its time-window and randomly selects its waiting time within the given time-window range. A proportional time period of the given time-window is reserved in order to reduce the message propagation delay. The experimental results show that the proposed scheme has shorter message propagation delay than the distance-based broadcast scheme irrespective of node density in VANET. In particular, when the node density is low, the proposed scheme shows about 26% shorter delay and about 46% better performance in terms of compound metric, which is a function of propagation latency and network traffic.

Development of an Evaluation Method for a Driver's Cognitive Workload Using ECG Signal (ECG 기반의 운전자별 인지 부하 평가 방법 개발)

  • Hong, Wongi;Lee, Wonsup;Jung, Kihyo;Lee, Baekhee;Park, Jangwoon;Park, Suwan;Park, Yunsuk;Son, Joonwoo;Park, Seikwon;You, Heecheon
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.40 no.3
    • /
    • pp.325-332
    • /
    • 2014
  • High cognitive workload decreases a driver's ability of judgement and response in traffic situation and could result in a traffic accident. Electrocardiography (ECG) has been used for evaluation of drivers' cognitive workload; however, individual differences in ECG response corresponding to cognitive workload have not been fully considered. The present study developed an evaluation method of individual driver's cognitive workload based on ECG data, and evaluated its usefulness through an experiment in a driving simulator. The evaluation method developed by the present study determined the optimal ECG evaluation condition for individual participant by analysis of area under the receiver operating characteristic curve (AUC) for various conditions (total number of conditions = 144) in terms of four aspects (ECG measure, window span, update rate, and workload level). AUC analysis on the various conditions showed that the optimal ECG evaluation condition for each participant was significantly different. In addition, the optimal ECG evaluation condition could accurately detect changes in cognitive workload for 47% of the total participants (n = 15). The evaluation method proposed in the present study can be utilized in the evaluation of individual driver's cognitive workload for an intelligent vehicle.