• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.759-762
• /
• 2005

Recently, Intelligent Transportation System(ITS) has been applied to satisfy increasing traffic demand every year and to solve many traffic problems. Especially, Advanced Traveller Information System(ATIS) is a transportation system to optimize the trip of each other vehicle. It is important to provide the driver with quick and comfortable path from source to destination. However, it is difficult to provide a shortest path in a road network with dynamic cost. Because the existing research has a static cost. Therefore, in this paper we propose an operator for searching traffic dependent shortest path. The proposed operator finds the shortest path from source to destination using a current time cost and a difference cost of past time cost. Such a method can be applied to the road status with time. Also, we can expect a predicted arrival time as well as the shortest path from source to destination. It can be applied to efficiently application service as ITS and have the advantages of using the road efficiently, reducing the distribution cost, preparing an emergency quickly, reducing the trip time, and reducing an environmental pollution owing to the saving the fuel.

• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2007

The development of efficient Qualify of Service (QoS) routing algorithms in high speed networks is extremely difficult to achieve, because in order to operate, divergent services require various quality conditions. If the parameter of concern is to measure the delay on a specific link, the routing algorithm obtains the Least Delay (LD) path. Meanwhile, if the parameter is to measure the link cost, the Least Cost (LC) path is calculated. The Delay Constrained Least Cost (DCLC) path problem of the mixed issues on the LD and LC has been shown to be NP-hard. The path cost of LD path is relatively more expensive than that of the LC path, and the path delay of the LC path is relatively higher than that of the LD path in the DCLC problem. In this paper, we introduce the new factor for balancing cost and delay. The simulation result shows that our introduced factor is satisfied to solve the DCLC problem.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.25-31
• /
• 2007

The development of efficient Quality of Service (QoS) routing algorithms in high speed networks is very difficult since divergent services require various quality conditions, If the QoS parameter we concern is to measure the delay on that link, then the routing algorithm obtains the Least Delay (LD) path, Meanwhile, if the parameter is to measure of the link cast, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cast (DCLC) path problem of the mixed issues on LD and LC has been shown to be NP-hard. The path cost of LD path is relatively mere expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper. we propose the algorithm based on estimated path for the DCLC problem and investigate its performance, It employs a new parameter which is probabilistic combination of cost and delay, We have performed empirical evaluation that compares our proposed algorithm with the DCUR in various network situations.

• The Journal of Korea Robotics Society
• /
• v.7 no.2
• /
• pp.150-159
• /
• 2012

In this paper, we propose a cost-aware Rapidly-exploring Random Tree (RRT) path planning algorithm for mobile robots. A mobile robot is presented with a cost map of the field of interest and assigned to move from one location to another. As a robot moves, the robot is penalized by the cost at its current location according to the cost map. The overall cost of the robot is determined by the trajectory of the robot. The goal of the proposed cost-aware RRT algorithm is to find a trajectory with the minimal cost. The cost map of the field can represent environmental parameters, such as temperature, humidity, chemical concentration, wireless signal strength, and stealthiness. For example, if the cost map represents packet drop rates at different locations, the minimum cost path between two locations is the path with the best possible communication, which is desirable when a robot operates under the environment with weak wireless signals. The proposed cost-aware RRT algorithm extends the basic RRT algorithm by considering the cost map when extending a motion segment. We show that the proposed algorithm gives an outstanding performance compared to the basic RRT method. We also demonstrate that the use of rejection sampling can give better results through extensive simulation.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.5D
• /
• pp.649-654
• /
• 2008

In the definition of non additive path, the sum of travel costs of links making up the path is not equal to the path cost. There are a variety of cases that non-additivity assumption does not hold in transportation fields. Nonetheless, traffic equilibrium models are generally built up on the fundamental hypothesis of additivity assumption. In this case traffic equilibrium models are only applicable within restrictive conditions of the path cost being linear functions of link cost. Area-wide road pricing is known as an example of realistic transportation situations, which violates such additivity assumption. Because travel fare is charged at the moment of driver's passing by exit gate while identified at entry gate, it may not be added linearly proportional to link costs. This research proposes a novel Wordrop type of traffic equilibrium model in terms of area-wide road pricing schemes. It introduces binary indicator variable for the sake of transforming non-additive path cost to additive. Since conventional shortest path and Frank-Wolfe algorithm can be applied without route enumeration and network representation is not required, it can be recognized more generalized model compared to the pre-proposed approaches. Theoretical proofs and case studies are demonstrated.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.263-268
• /
• 2004

The end-to-end characteristic Is an important factor for QoS support. Since network users and required bandwidths for applications increase, the efficient usage of networks has been intensively investigated for the better utilization of network resources. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The DCLC(Delay Constrained 1.east Cost) path problem has been shown to be NP-hard problem. The path cost of LD path is relatively more expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper, we investigate the performance of heuristic algorithm for the DCLC problem with new factor which is probabilistic combination of cost and delay. Recently Dr. Salama proposed a polynomial time algorithm called DCUR. The algorithm always computes a path, where the cost of the path is always within 10% from the optimal CBF. Our evaluation showed that heuristic we propose is more than 38% better than DCUR with cost when number of nodes is more than 200. The new factor takes in account both cost and delay at the same time.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.299-299
• /
• 2000

In this paper, a determination method of number of AGVs fer introducing to the multi-path material handling systems is presented by using genetic algorithm. For serving the raw material to each work stations automatically, there needs to introduce a AGVs for transfer the raw martial. To reduce the overall production cost in the material handling systems, however, a trade off exists between the amount of inventory hold on the shop floor and the number of AGVs needed to provide adequate service. In this paper, firstly a objective function which included the net present fixed costs of each stations and each purchased AGVs, delivering cost. stock inventory cost, and safety stock inventory cost is presented. Secondly by using genetic algorithm, the optimal reorder quantity at each stations is decided, where the number of AGVs is increased step by step. From a simulation with different GA parameters, we can determine a optimal number of AGVs to reduce the overall production cost. Thus, the effectiveness of GA for determining the number of AGVs is verified in automated material handling systems.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.11 no.1
• /
• pp.606-623
• /
• 2019

The path following problem of a ship sailing in restricted waters under wind effect is investigated based on Robust $H_{\infty}$ Guaranteed Cost Control (RHGCC). To design the controller, the ship maneuvering motion is modeled as a linear uncertain system with norm-bounded time-varying parametric uncertainty. To counteract the bank and wind effects, the integral of path error is augmented to the original system. Based on the extended linear uncertain system, sufficient conditions for existence of the RHGCC are given. To obtain an optimal robust $H_{\infty}$ guaranteed cost control law, a convex optimization problem with Linear Matrix Inequality (LMI) constraints is formulated, which minimizes the guaranteed cost of the close-loop system and mitigates the effect of external disturbance on the performance output. Numerical simulations have confirmed the effectiveness and robustness of the proposed control strategy for the path following goal of a ship sailing in restricted waters under wind effect.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.12
• /
• pp.547-552
• /
• 2002

In this paper, the path loss in domestic terrain environments for IMT-2000 are measured and considered. Domestic terrain environments are classified and received power is measured at 1.9201GHz. In addition, the Path loss is calculated with consideration of the radiation pattern of antennas based on the results of measurement. For the consideration of path loss in domestic terrain environments, each path loss are fitted with the same slope of a reference model as "COST-231 HATA Urban Model", and then both are compared. As a result, all of the path loss in domestic terrain environments are lower than the path loss of a reference model as "COST-231 HATA Urban Model". We found that a difference of path loss in domestic terrain environments and a reference model is 5dB in urban, 8dB in sparse urban, 12dll in dense suburban, 13dB in suburban, 19dB in sparse suburban, and 29dB in road.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.11-16
• /
• 1998

The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem