• Journal of KIISE:Software and Applications
• /
• v.26 no.1
• /
• pp.80-80
• /
• 1999

As Temporal DataBase Systems(TDBSs) manages both the historical versions and the current version of each data item, a temporal transaction may access more data records than atransaction in traditional database systems. Hence, the concurrency control subsystem of temporaldatabase management system should be able to correctly and efficiently detect actual conflicts amongconcurrent temporal transactions while the cost of detecting conflicts is maintained in low levelwithout detecting false conflicts which cause severe degradation of system throughput.In this paper, Two-Level Conflict Detection(TLCD) scheme is proposed for efficient conflictdetection between concurrent temporal transactions in TDBs. In the proposed TLCD scheme, sincechecking conflict between concurrent temporal transactions is performed at two levels, i, e., logicallevel and physical level, conflicts between concurrent temporal transactions are efficiently and correctlydetected,Furthermore, we also evaluate the performance of the proposed TLCD scheme with those oftraditional conflict detection schemes, logical-level conflict detection scheme and physical-level conflictdetection scheme by simulation approach, The result of the simulation study shows that the proposedTLCD scheme outperforms the previous conflict detection schemes with respect to the averageresponse time.

• International Journal of Aeronautical and Space Sciences
• /
• v.13 no.3
• /
• pp.377-385
• /
• 2012

The Automatic Dependent Surveillance Broadcast (ADS-B) system is a key component of CNS/ATM recommended by the International Civil Aviation Organization (ICAO) as the next generation air traffic control system. ADS-B broadcasts identification, positional data, and operation information of an aircraft to other aircraft, ground vehicles and ground stations in the nearby region. This paper explores the ADS-B based trajectory prediction and the conflict detection algorithm. The multiple-model based trajectory prediction algorithm leads accurate predicted conflict probability at a future forecast time. We propose an efficient and accurate algorithm to calculate conflict probability based on approximation of the conflict zone by a set of blocks. The performance of proposed algorithms is demonstrated by a numerical simulation of two aircraft encounter scenarios.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.19 no.4
• /
• pp.83-90
• /
• 2011

The evaluation of Conflict detection and Resolution Algorithms require the use of analytical that describe encounter flight safety and the costs and benefits of optimization maneuver. A number of such algorithms have been applied in the past to the free flight. Each algorithm has benefits and limitations, and flight safety may be facilitated by combining the best features of various techniques. This paper studied a summary of conflict detection and resolution algorithm approaches. Algorithm techniques are categorized and the fundamental assumptions, capabilities, and limitations of each approach are described. The Algorithms are evaluated and compared based on their applicability to free flight airspace conflict situations.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.18 no.3
• /
• pp.27-33
• /
• 2010

The goal for the CD&R system is to predict that a conflict is going to occur in the future, communicate the detected conflict to a human operator, and, in some cases, assist in the resolution of the conflict situation. To provide insight into different methods of conflict detection and resolution, a literature review of previous research models and current developmental and operational systems was performed. This paper focuses only on the specific attributes of each model, not on the depth to which a model has been analyzed, validated, or accepted. Thus, care should be taken to remember that a model that seems to be simple according to our categorization scheme may be significantly more viable than an apparently sophisticated model.

• Journal of Computing Science and Engineering
• /
• v.9 no.2
• /
• pp.98-107
• /
• 2015

Hierarchical constraints and constraint satisfaction were analyzed in order to solve the problem of conflict detection in collaborative design. The constraints were divided into two sets: one set consisted of known constraints and the other of unknown constraints. The constraints of the two sets were detected with corresponding methods. The set of the known constraints was detected using an interval propagation algorithm, a back propagation (BP) neural network was proposed to detect the set with the unknown constraints. An immune algorithm (IA) was utilized to optimize the weights and the thresholds of the BP neural network, and the steps were designed for the optimization process. The results of the simulation indicated that the BP neural network that was optimized by IA has a better performance in terms of convergent speed and global searching ability than a genetic algorithm. The constraints were described using the eXtensible Markup Language (XML) for computers to be able to automatically recognize and establish the constraint network. The implementation of the conflict detection system was designed based on constraint satisfaction. A wind planetary gear train is taken as an example of collaborative design with a conflict detection system.

• Journal of the Korean Society for Railway
• /
• v.7 no.2
• /
• pp.71-76
• /
• 2004

In this paper, we propose a pilot study to deploy the Railway Conflict Detection and Resolution System(RCDRS) in the context of Korean Railway(KORAIL). KORAIL plans to deploy in near future RCDRS, which is a decision support module placed on the top level of the Railway Traffic Management System(RTMS). This study entails the review of the state-of-art researches and projects in the field of the railway traffic management, as well as the analysis of the traffic characteristics of the major railroad lines in KORAIL. The analysis provides a basis to choose a solution approach for the railway conflict detection and resolution problem that each individual line faces. This study plays a role as a pilot study for a full systematic approach, in which interactions between lines require further advanced analysis to take the entire KORAIL lines into consideration rather than a myopic approach.

• International Journal of Aeronautical and Space Sciences
• /
• v.10 no.1
• /
• pp.37-45
• /
• 2009

A method of conflict detection and resolution is described by using simple geometric approach. Two VAVs are dealt with and considered as point masses with constant velocity. This paper discusses en route aircraft which are assumed to be linked by real time data bases like ADS-B. With this data base, all DAVs share the information each other. Calculating PCA (Point of Closest Approach), we can evaluate the worst conflict condition between two VAVs. This paper proposes one resolution maneuvering logic, which can be called 'Vector Sharing Resolution'. In case of conflict, using miss distance vector in PCA, we can decide the directions for two VAVs to share the conflict region. With these directions, VAVs are going to maneuver cooperatively. First of all, this paper describes some '2-D' conflict scenarios and then extends to '3-D' conflict scenarios.

• Journal of Advanced Navigation Technology
• /
• v.23 no.1
• /
• pp.1-7
• /
• 2019

Thisstudy presentsthe development of a fast-time airport surface simulator. The simulator usesthe output from a first-come first-served (FCFS) scheduler and has adopted one-dimensional dynamic model to simulate the movement of the aircraft on the surface. Higher collision risks situations in the airport surface traffic are analyzed to classify those situations into six cases. A conflict detection and resolution algorithm is implemented to maintain separation distance and to prevent deadlock. The simulator was tested with a scenario at the Incheon International Airport that contains 72 aircraft. Without the conflict detection and resolution, various conflict situations are identified. When the conflict detection and resolution algorithm is managing the traffic, it is confirmed that the conflicts are removed at the price of additional delays. In the conflict resolution algorithm, three prioritization strategies are implemented, and delayed aircraft count and average additional delays are compared. Prioritization based on remaining time or distance showed smaller total additional delay compared to choosing minimum delay priority for each situation.

• Journal of Advanced Navigation Technology
• /
• v.16 no.2
• /
• pp.197-203
• /
• 2012

In this paper, study the substantial issues which occurs upon free flight environment by performing separation assurance under multiple conflict(over 3 Aircraft), recovery en route under the terms of time constrains and fixed way point after the conflict avoidance, correlations between conflict detection distance and separation assurance by utilizing Autonomous flight algorithm. Result of this experiment demonstrates that the extension of detection distance is advantageous to solution of separation assurance and enhancing of flight efficiency, choose to maneuver by applying time constrain terms and fixed way point according to the situation of conflict prediction in case of recovery maneuver after the conflict avoidance. And separation assurance can be solved by applying 2 degrees or more of bank angle. When choosing the optimal bank angle could be drastically improved flight efficiency.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.5
• /
• pp.64-76
• /
• 2008

To increase road safety at blackspots, it is needed to develop a new method that can process before accident occurrence. Accident situation could result from traffic conflict. Traffic conflict decision technique has an advantage that can acquire and analyze data in time and confined space that is less through investigation. Therefore, traffic conflict technique is highly expected to be used in many application of road safety. This study developed traffic conflict decision program that can analyze and process from signalized intersection image. Program consists of the following functional modules: an image input module that acquires images from the CCTV camera, a Save-to-Buffer module which stores the entered images by differentiating them into background images, current images, difference images, segmentation images, and a conflict detection module which displays the processed results. The program was developed using LabVIEW 8.5 (a graphic language) and the VISION module library.