• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.199-202
• /
• 2009

The optimal path on real road network has been changed by traffic flow of roads frequently. Therefore a path finding system to find the optimal path on real network should consider traffic flow of roads that is changed on real time. The most of existing path finding methods do not consider traffic flow of roads and do not also perform efficiently if they use traffic information. In this paper, we propose an abstraction method of real road network based on the Terminal Based Navigation System (TBNS) with technique such as TPEG. TBNS can be able to provides quality of path better than before as using traffic information that is transferred by TPEG. The proposed method is to abstract real network as simple graph in order to use traffic information. It is composed boundary nodes based on real nodes, all boundary nodes that have the same of connection are merged together. The result of path finding on an abstract graph diminishes the search space.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.12 no.5
• /
• pp.125-135
• /
• 2004

The validity of simulation has been well-established for decades in areas such as computer and communication system. Recently, the technique has become entrenched in specific areas such as transportation and traffic forecasting. Several methods have been proposed for investigating complex traffic flows. However, the dynamics of vehicles and their driver's characteristics, even though it is known that they are important factors for any traffic flow analysis, have never been considered sufficiently. In this paper, the traffic simulation using a multi-agent approach with considering vehicle dynamics is proposed. The multi-agent system is constructed with the traffic environment and the agents of vehicle and driver. The traffic environment consists of multi-lane roads, nodes, virtual lanes, and signals. To ensure the fast calculation, the agents are performed on the based of the rules to regulate their behaviors. The communication frameworks are proposed for the agents to share the information of vehicles' velocity and position. The model of a driver agent which controls a vehicle agent is described in the companion paper. The vehicle model contains the nonlinear subcomponents of engine, torque converter, automatic transmission, and wheels. The simulation has proceeded for an interrupted and uninterrupted flow model. The result has shown that the driver agent performs human-like behavior ranging from slow and careful to fast and aggressive driving behavior, and that the change of the traffic state is closely related with the distance and the signal delay between intersections. The system developed shows the effectiveness and the practical usefulness of the traffic simulation.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.161-167
• /
• 2004

While most or fixed-time control systems such as UTCS produce the signal timing plans that either maximizing bandwidth or minimizing a disutility index of delay and stops, cannot consider the fluctuation of traffic flow. One category of the traffic-response control systems, which make small changes on a predefined signal plan such as SCOOT, cannot be easily modified for feedback real-time control schemes based on observation of variables other than traffic flow. The other category, which decide to whether switch the traffic lights or not at each step of time as in PRODYN, does not adequately consider the relations between traffic flows and traffic lights at each step of time. In this paper we present a complete formulation that adequately consider the relations between traffic flows and traffic lights at each step of time. The formulation is a binary mixed integer linear programing (BMILP) that obtain traffic lights at each step for minimizing delay. Since numarical examples for application of the proposed model illustrated that the model adequately produced dynamic traffic signal plans minimizing delay at each step, the model may be expected to contribute to advanced transportation management systems (ATMS) for dynamic traffic signal control.

• Journal of Korean Society of Transportation
• /
• v.20 no.3
• /
• pp.149-158
• /
• 2002

For the purpose of preciously describing real time traffic pattern in urban road network, dynamic network loading(DNL) models able to simulate traffic behavior are required. A number of different methods are available, including macroscopic, microscopic dynamic network models, as well as analytical model. Equivalency minimization problem and Variation inequality problem are the analytical models, which include explicit mathematical travel cost function for describing traffic behaviors on the network. While microscopic simulation models move vehicles according to behavioral car-following and cell-transmission. However, DNL models embedding such travel time function have some limitations ; analytical model has lacking of describing traffic characteristics such as relations between flow and speed, between speed and density Microscopic simulation models are the most detailed and realistic, but they are difficult to calibrate and may not be the most practical tools for large-scale networks. To cope with such problems, this paper develops a new DNL model appropriate for dynamic traffic assignment(DTA), The model is combined with vertical queue model representing vehicles as vertical queues at the end of links. In order to compare and to assess the model, we use a contrived example network. From the numerical results, we found that the DNL model presented in the paper were able to describe traffic characteristics with reasonable amount of computing time. The model also showed good relationship between travel time and traffic flow and expressed the feature of backward turn at near capacity.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.10
• /
• pp.995-999
• /
• 2010

Every year, traffic accidents and traffic congestion have been rapidly increasing, Although the roadway design and signal system have been improved to relieve traffic accidents, traffic casualties and property damage do not decrease. This paper develops a real-time traffic accident detection and analysis system (RTADAS): In the proposed system, we aim to precisely detect traffic accidents at different design and flow of intersections, However, because the data collected from intersections have uncertainty and complicated causal dependency between them, we construct probability-based networks for correct accident detection.

• Journal of the Korea Society for Simulation
• /
• v.29 no.3
• /
• pp.41-48
• /
• 2020

In this paper, a dynamic prediction algorithm using the cumulative distribution function for traffic volume is presented as a new method for predicting highway traffic rate more accurately, where an approximation function of the cumulative distribution function is obtained through numerical methods such as natural cubic spline interpolation and Levenberg-Marquardt method. This algorithm is a new structure of random number generation algorithm using the cumulative distribution function used in financial mathematics to be suitable for predicting traffic flow. It can be confirmed that if the highway traffic rate is simulated with this algorithm, the result is very similar to the actual traffic volume. Therefore, this algorithm is a new one that can be used in a variety of areas that require traffic forecasting as well as highways.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.68-82
• /
• 2011

Wireless mesh networks (WMNs) provide high-speed backbone networks without any wired cable. Many researchers have tried to increase network throughput by using multi-channel and multi-radio interfaces. A multi-radio multi-channel WMN requires channel assignment algorithm to decide the number of channels needed for each link. Since the channel assignment affects routing and interference directly, it is a critical component for enhancing network performance. However, the optimal channel assignment is known as a NP complete problem. For high performance, most of previous works assign channels in a centralized manner but they are limited in being applied for dynamic network environments. In this paper, we propose a simple flow estimation algorithm and a hybrid channel assignment algorithm. Our flow estimation algorithm obtains aggregated flow rate information between routers by packet sampling, thereby achieving high scalability. Our hybrid channel assignment algorithm initially assigns channels in a centralized manner first, and runs in a distributed manner to adjust channel assignment when notable traffic changes are detected. This approach provides high scalability and high performance compared with existing algorithms, and they are confirmed through extensive performance evaluations.

• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.135-150
• /
• 2002

The basic assumption of analytical Dynamic Traffic Assignment models is that traffic demand and network conditions are known as a priori and unchanging during the whole planning horizon. This assumption may not be realistic in the practical traffic situation because traffic demand and network conditions nay vary from time to time. The rolling horizon implementation recognizes a fact : The Prediction of origin-destination(OD) matrices and network conditions is usually more accurate in a short period of time, while further into the whole horizon there exists a substantial uncertainty. In the rolling horizon implementation, therefore, rather than assuming time-dependent OD matrices and network conditions are known at the beginning of the horizon, it is assumed that the deterministic information of OD and traffic conditions for a short period are possessed, whereas information beyond this short period will not be available until the time rolls forward. This paper introduces rolling horizon implementation to enable a multi-class analytical DTA model to respond operationally to dynamic variations of both traffic demand and network conditions. In the paper, implementation procedure is discussed in detail, and practical solutions for some raised issues of 1) unfinished trips and 2) rerouting strategy of these trips, are proposed. Computational examples and results are presented and analyzed.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

• Journal of Korean Society of Transportation
• /
• v.13 no.4
• /
• pp.79-103
• /
• 1995

The elasticity of a model is considered most important. Without showing the proper elasticity any model cannot provide useful information for decision making. This paper demonstrates a macro model which can generate dynamic transport informations every 15 minutes. Without the Wardrop principles and the monotonicity assumptions for the link travel time and link volume relationship, the basic elements of this new modeling approache are composed of link density simulation, stochastic incremental route choice, departure time choice, destination choice and mode choice. The elasticity of the proposed model is examined based on elasticity equations and simulation results. Also the transferability from a mega city like Seoul to a big city like Daejon is demonstrated for the choice model. The issues centering around the dynamic relations among density(k), speed(u), and flow rate(v) are also discussed for the modeling of highly congested situations.