• Journal of Industrial Technology
• /
• v.21 no.A
• /
• pp.241-249
• /
• 2001

The objective of this paper is to develop the optimal path algorithm for dynamic route guidance system in advanced traveler information system (ATIS). The travel time is forecasted in each path between network nodes. Floyd-Warshall algorithm is used to find the optimal route based on this forecasted travel time in dynamic traffic network. This algorithm is modified to apply the real traffic network that has left-turn restriction, U-turn, and P-turn. A big value is assigned to one of arcs in turn restriction and a virtual node is used to consider U-turn and P-turn for Floyd-Warshall algorithm.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.189-194
• /
• 2004

This paper describes method to distribute much high-dimensional facial expression motion data to 2 dimensional space, and method to create facial expression animation by select expressions that want by realtime as animator navigates this space. In this paper composed expression space using about 2400 facial expression frames. The creation of facial space is ended by decision of shortest distance between any two expressions. The expression space as manifold space expresses approximately distance between two points as following. After define expression state vector that express state of each expression using distance matrix which represent distance between any markers, if two expression adjoin, regard this as approximate about shortest distance between two expressions. So, if adjacency distance is decided between adjacency expressions, connect these adjacency distances and yield shortest distance between any two expression states, use Floyd algorithm for this. To materialize expression space that is high-dimensional space, project on 2 dimensions using Sammon's Mapping. Facial animation create by realtime with animators navigating 2 dimensional space using user interface.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.149-154
• /
• 2024

This paper proposes an algorithm that remedy Floyd's the tortoise and the hare algorithm (THA) shortcomings which is specialized in singly linked list (SLL), so this algorithm fails to detect the cycle in undirected graph, digraph, and tree with multiple inputs or outputs. The proposed algorithm simply pruning the source and sink with only one edge using cycle detection of single edge node pruning. As a result of the experimental of various list, undirected graph, digraph, and tree, the proposed algorithm can be successively detect the cycle all of them. Thus, the proposed algorithm has the simplest and fastest advantage in the field of cycle detection.

• Proceedings of the CALSEC Conference
• /
• 2001.08a
• /
• pp.457-465
• /
• 2001

■ 필요성 1. 교통 혼잡으로 인한 물류비 상승으로 국가 경쟁력 약화 2. 기존 최단경로 알고리즘(Dijkstra, Floyd-Warshall 등)의 한계 3. 대규모 네트워크(NP-hard문제)→정보 사용자가 제시하는 시간 내에 정보를 제공 필요 4. 교통 제약(회전금지, U턴, U턴 금지, P-턴) → 실제 교통 상황과 순환 노드 고려가 필요 ■목적 1. 교통제약을 포함한 대규모 교통네트워크에서 실시간 교통정보를 바탕으로 제한된 시간 내에 차별화 된 다수 최적경로 산출 함 2. 유전자알고리즘(GA)을 적용한 동적경로안내시스템 개발(중략)

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.667-667
• /
• 2004

We must design the buffer algorithm that protects traffic congestion and decreasing throughput at satellite communication network. It is important that buffer algorithm is satisfied with the good performance of transmission packet, responsibility of many connecting traffic and the QOS for connecting character. Old buffer algorithms are not the suitable algorithms when we have the satellite communication network environment. RED buffer algorithm is proposed by Floyd. It has a better performance than old buffer algorithm. But this algorithm is not well adapted a number of connecting TCP packet and changing network, so this algorithm has a bad performance on satellite communication network that is many of connecting user at same time. This paper propose the TARED(Target Adaptive RED). It has a good performance, adaptation and stability on satellite communication network and has not overflow and underflow of the buffer level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.666-676
• /
• 2004

We must design the buffer algorithm that protects traffic congestion and decreasing throughput at satellite communication network. It is important that buffer algorithm is satisfied with the good performance of transmission packet, responsibility of many connecting traffic and the 005 for connecting character. Old buffer algorithms are not the suitable algorithms when we have the satellite communication network environment. RED buffer algorithm is proposed by Floyd. It has a better performance than old buffer algorithm. But this algorithm is not well adapted a number of connecting TCP packet and changing network, so this algorithm has a bad Performance on satellite communication network that is many of connecting user at same time. This paper Propose the TARED(Target Adaptive RED). It has a good performance, adaptation and stability on satellite communication network and has not overflow and underflow of the buffer level.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.181-188
• /
• 2005

Chinese Postman Problem (CPP) is a problem that finds a shortest tour traversing all edges or arcs at least once in a given network. The Chinese Postman Problem on Mixed networks (MCPP) is a Practical generalization of the classical CPP and it has many real-world applications. The MCPP has been shown to be NP-complete. In this paper, we transform a mixed network into a symmetric network using virtual arcs that are shortest paths by Floyd's algorithm. With the transformed network, we propose a Genetic Algorithm (GA) that converges to a near optimal solution quickly by a multi-directional search technique. We study the chromosome structure used in the GA and it consists of a path string and an encoding string. An encoding method, a decoding method, and some genetic operators that are needed when the MCPP is solved using the Proposed GA are studied. . In addition, two scaling methods are used in proposed GA. We compare the performance of the GA with an existing Modified MDXED2 algorithm (Pearn et al. , 1995) In the simulation results, the proposed method is better than the existing methods in case the network has many edges, the Power Law scaling method is better than the Logarithmic scaling method.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.10
• /
• pp.115-120
• /
• 2009

In this parer, we design the artificial intelligent direction escape light control system to improve/complete the defects of the existing fire fighting system, and sketch an optimum escape guide algorithm for its implementation. It intends to minimize human casualties and injuries by calculating/predicting moving line of the optimum emergency escape, by means of interlocking the sensor and the reception group and analyzing the data of the combustion point and the smoke movement. The optimum escape algorithm is designed by FLOYD algorithm which calculates the shortest distance. It consists of the measuring method which calculates the shortest distance by using hazardous factors for each condition in danger which is judged by the sensor installed in each area.

• The Journal of the Korea Contents Association
• /
• v.7 no.3
• /
• pp.9-16
• /
• 2007

This paper describe methodology that is distributed on 2-dimensional plane to much high-dimensional facial motion datas using Isomap algorithm, and user interface techniques to control facial expressions by selecting expressions while user navigates this space in real-time. Isomap algorithm is processed of three steps as follow; first define an adjacency expression of each expression data, and second, calculate manifold distance between each expressions and composing expression spaces. These facial spaces are created by calculating of the shortest distance(manifold distance) between two random expressions. We have taken a Floyd algorithm for it. Third, materialize multi-dimensional expression spaces using Multidimensional Scaling, and project two dimensions plane. The smallest adjacency distance to define adjacency expressions uses Pearson Correlation Coefficient. Users can control facial expressions of 3-dimensional avatar by using user interface while they navigates two dimension spaces by real-time.

• Journal of the Society of Naval Architects of Korea
• /
• v.53 no.2
• /
• pp.115-126
• /
• 2016

In the process of ship building, it is known that the maintenance of working period and saving cost are one of the important part during the logistics of blocks transportation. Precise operational planning inside the shipyard plays a big role for a smooth transportation of blocks. But many problems arise in the process of block transportation such as the inevitable road damage during the transportation of the blocks, unpredictable stockyard utilization of the road associated with a particular lot number, addition of unplanned blocks. Therefore, operational plan needs to be re-established frequently in real time for an efficient block management. In order to find the shortest path between lot numbers, there are several representative methods such as Floyd algorithm that has the characteristics of many-to-many mapping, Dijkstra algorithm that has the characteristic of one-to-many mapping, and the A* algorithm which has the one-to-one mapping, but many authors have published without the mutual comparisons of these algorithms. In this study, some appropriate comparison have been reviewed about the advantages and disadvantages of these algorithms in terms of precision and cost analysis of calculating the paths and planning system to operate the transporters. The flexible operating plan is proposed to handle a situation such as damaged path, changing process during block transportation. In addition, an operational algorithm of a vacant transporter is proposed to cover the shortest path in a minimum time considering the situation of transporter rotation for practical use.