• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1338-1341
• /
• 2004

In this paper, we have proposed a new approach of routing and wavelength assignment algorithms, called Possible Available Wavelength (PAW) algorithm. The weight of a link is used as the main factor for routing decision in PAW algorithm. The weight of a link is defined as a function of hop count and available wavelengths. This function includes a determination factor of the number of wavelengths that are being used currently and are supposed to be available after a certain time. The session requests from users will be routed on the links that has the greatest number of link weight by using Dijkstra's shortest path algorithm. This means that the selected lightpath will has the least hop count and the greatest number of possible available wavelengths. The impact of proposed link weight computing function on the blocking probability and link utilization is investigated by means of computer simulation and comparing with the traditional mechanism. The results show that the proposed PAW algorithm can achieve the better performance in terms of the blocking probability and link utilization.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.11
• /
• pp.1578-1586
• /
• 2015

Personal rapid transit (PRT) is getting attention as a new form of transportation. It is energy efficient and provides the high level of passenger service. In this study, the dynamic PRT dispatching and routing problem is dealt with. Passengers request transportation service on a complex network, and an operating system monitors passenger arrivals and coordinates vehicles in real time. A new online dispatching and routing algorithm is proposed, which minimizes the total travel distance of vehicles and the waiting time of passengers. The algorithm dispatches vehicles by considering multiple vehicles' state and multiple passengers at the same time. In particular, finding the shortest-time path is attempted by taking into account the future congestion on lanes. Discrete-event simulation is employed to validate the performance of the proposed algorithm. The results show the algorithm in this study outperforms others.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.3
• /
• pp.187-195
• /
• 2017

The operation planning of transports used to move blocks is the one of key factors. Furthermore, reducing the running time through the effective plan contributes to pulling forward the whole logistic process of the shipyard and substantially saving the fuel consumption of itself as well. The past researches of the transporter focused on finding only the shortest distances, so called, Manhattan distance. However, these searching approaches cannot help having the significant difference in the real operational time and distance with the minimum cost approach which considers the speed retardation for turns or safety at the intersection. This study suggests the noble transporter's operational model which could take account of the consuming operational time around the crossroads on the shipyard. Concretely, the proposed method guarantees the minimization of transporters' turns and passage number which are huge burdensome to the operation time and the whole planning of transports with the given period. Resultantly, this paper is willing to explain the appropriateness of our approach, compared with the previous ones.

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

In this paper, we introduce a Y/T(Yard Tractor) Multi-Cycle System on the basis of RTLS that improves a low efficient loading and unloading. In the proposed approach, we apply the best suited algorithm looking for seeking of the optimum path and the shortest movement distance. In this paper, Our experiment results show that rate of a driving distance is reduced more than 12% compared to the average value, and that is reduced more than 23% compared to the maximum value.

• Journal of Advanced Navigation Technology
• /
• v.26 no.5
• /
• pp.304-311
• /
• 2022

Although the SEAD(suppression to enemy air defenses) mission is a strategically important task in modern warfare, the high risk of direct exposure to enemy air defense assets forces to use of unmanned aerial vehicles. this paper proposes a path planning algorithm for SEAD mission for an unmanned aerial vehicle and a method for calculating the mission effectiveness on the planned path. Based on the RRT-based path planning algorithm, a low-altitude ingress/egress flight path that can consider the enemy's short-range air defense threat was generated. The Dubins path-based Intercept path planning technique was used to generate a path that is the shortest path while avoiding the enemy's short-range anti-aircraft threat as much as possible. The ingress/intercept/egress paths were connected in order. In addition, mission effectiveness consisting of fuel consumption, the survival probability, the time required to perform the mission, and the target destruction probability was calculated based on the generated path. The proposed techniques were verified through a scenario.

• Journal of the Korean association of regional geographers
• /
• v.13 no.5
• /
• pp.563-575
• /
• 2007

This study aims to investigate a possibility of using topographic information by web mapping in open environments. Web mapping intends to focus on a map analysis and application of the function and geo-visualization. Functions of Web topographic info-map include a spatial analysis, enlargement and minimization, movement, landuse information, user-controling 3 dimension map, landform cross-section analysis, shortest path analysis. The web system adopts SVG(scalable vector graphics), MYSQL, PHP, XML for mapping. SVG has open source policy, so everyone can use it, as well, it is effective on flexible database linkage, cartographic representation. 3D map is intended to represent 3D map by user-controlled sunshine putting pixel opacity by elevation values after making DEM. Landform is designed to show a cross-section analysis and statistics by retrieving height information from database engine with clicking two points on the map. Shortest path analysis within regions uses Dijkstra's algorithm. Near future, resultantly, the area of WebGIS will have to meet more social demands for use-created geo-information and application, so more researches are needed to be web mapping more applicable for users.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.6
• /
• pp.21-28
• /
• 2016

This paper presents a cooperative transmission scheme for underwater acoustic sensor networks to improve packet transmission rate and reduce energy consumption. Source node transmits duplicated information relayed by distributed antennas called a virtual antenna array. Destination node combines that information to reduce packet error rate. The suggested cooperative scheme enhances the reliability by providing high diversity gains through intermediate relay nodes to overcome the distinct characteristics of the underwater channel, such as high transmission loss, propagation delay, and ambient noises. It is suggested that the algorithm select destinations and potential relays from a set of neighboring nodes that utilize distance cost, the residual energy of each node and local measurement of the channel conditions into calculation. Simulation results show that the proposed scheme reduces average energy consumption, response time, and increases packet delivery ratio compared with the SPF(Shortest Path First) and non-cooperative scheme using OPNET Moduler.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1048-1058
• /
• 1999

This paper compares some architectures to achieve the optimized WDM architecture for all optical transport network, the comparison is presented in terms of the number of required wavelength and LT. These architecture types are PPWDM, SHWDM, DHWDM and fully optical WDM. Topology is a static ring network where the routing pattern is fixed and traffic pattern has uniform demand. This paper also proposes an algorithm for the wavelength assignment for a folly optical WDM ring network which has full mesh traffic pattern. The algorithm is based on heuristic algorithm which assigns traffic connections according to their respective shortest path. Traffic described here that is to be passed through can be routed directly within the optical layer instead of having the higher layer to handle it.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.1
• /
• pp.105-111
• /
• 2004

DNA computing has been using to solve TSP (Traveling Salesman Problems). However, when the typical DNA computing is applied to TSP, it can`t efficiently express vertices and weights of between vertices. In this paper, we proposed ACO (Algorithm for Code Optimization) that applies DNA coding method to DNA computing to efficiently express vertices and weights of between vertices for TSP. We applied ACO to TSP and as a result ACO could express DNA codes which have variable lengths and weights of between vertices more efficiently than Adleman`s DNA computing algorithm could. In addition, compared to Adleman`s DNA computing algorithm, ACO could reduce search time and biological error rate by 50% and could search for a shortest path in a short time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.33-42
• /
• 2013

This paper presents a multihop range-free localization algorithm to estimate the physical location of a normal node with local connectivity information in anisotropic sensor networks. In the proposed algorithm, a normal node captures the detour degree of the shortest path connecting an anchor pair and itself by comparing the measured hop count and the expected hop count, and the node estimates the distances to the anchors based on the detour degree. The normal node repeats this procedure with all anchor combinations and pinpoints its location using the obtained distance estimates. The proposed algorithm requires fewer anchors and less communication overhead compared to existing range-free algorithms. We showed the superiority of the proposed algorithm over existing range-free algorithms through MATLA simulations.