• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.671-674
• /
• 2005

This paper describes the development of an optimal maze path game as web-based game contents. Client suer using web can access and run java applet program with download of java byte code with the independence of hardware system. The optimal maze path game developed in this paper consists of random maze path generation module, selected path input module, weighted optimal path search module, and path comparison module, selected path input module, weighted optimal path search module, and path comparison module. It enhances the cognition faculty of game users with the comparison of the maze path searched by optimal path search algorithm and the selected maze path by game users.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.1
• /
• pp.115-122
• /
• 2014

Mobile robot has been studied for long time due to its simple structure and easy modeling. Regarding path planning of the mobile robot, we suggest real-time hybrid path planning algorithm which is the combination of optimal path planning and real-time path planning in this paper. Real-time hybrid path planning algorithm modifies, finds best route, and saves calculating time. It firstly plan the route with real-time path planning then robot starts to move according to the planned route. While robot is moving, update the route as the best outcome which found by optimal path planning algorithm. Verifying the performance of the proposed method through the comparing real-time hybrid path planning with optimal path planning will be done.

• Journal of the Semiconductor & Display Technology
• /
• v.20 no.4
• /
• pp.134-140
• /
• 2021

This study investigates the flow efficiency and temperature based on flow path shape. Five models are designed to the no flow path, one flow path, two flow path, three flow path, add inlet flow path and add interior space gradient. Results show that two flow model(add inlet flow path and add interior space gradient), It was confirmed that model(add inlet flow path) is the optimal shape for coolant heat transfer, and model(add interior space gradient) is the optimal shape for coolant flow, demonstrates optimal design among the five models. The results of this study can be utilized to efficiently control the coolant flow through various types of flow paths.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.1004-1014
• /
• 2007

In sensor networks, it is crucial to reliably and energy-efficiently deliver sensed information from each source to a sink node. Specifically, in mobile sink (user) applications, due to the sink mobility, a stationary dissemination path may no longer be effective. The path will have to be continuously reconfigured according to the current location of the sink. Moreover, the dynamic optimal path from each source to the sink is required in order to reduce end-to-end delay and additional energy wastage. In this paper, an Adaptive Reversal Optimal path Tree (AROT) protocol is proposed. Information delivery from each source to a mobile sink can be easily achieved along the AROT without additional control overhead, because the AROT proactively performs adaptive sink mobility management. In addition, the dynamic path is optimal in terms of hop counts and the AROT can maintain a robust tree structure by quickly recovering the partitioned tree with minimum packet transmission. Finally, the simulation results demonstrate that the AROT is a considerably energy-efficient and robust protocol.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.569-571
• /
• 1995

This paper compares the simulated annealing and the Hopfield neural network method for an optimal routing in a multistage interconnection network(MIN). The MIN provides a multiple number of paths for ATM cells to avoid cell conflict. Exhaustive search always finds the optimal path, but with heavy computation. Although greedy method sets up a path quickly, the path found need not be optimal. The simulated annealing can find an sub optimal path in time comparable with the greedy method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.113-116
• /
• 2007

This paper describes the development of an optimal 3D maze path game as web-based game contents. Client user using web can access and run java applet program with download of java byte code with the independence of hardware system. The optimal 3D maze path game developed in this paper consists of random maze path generation module, selected path input module, weighted optimal path search module, and path comparison module. It enhances the cognition faculty of game users with the comparison of the maze path searched by optimal path search algorithm and the selected maze path by game users.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.2
• /
• pp.176-184
• /
• 2000

Possible representation methods for the product structure have been compared and analyzed to determine optimal disassembly path of a product. Petri net is selected as the most optimal method to represent disassembly path of the product. In this method, a reachability tree for the product is generated and disassembly time for each path is calculated. A path with the smallest disassembly time is selected as the optimal path. A software far DPN(Disassembly Petri Net) has been developed and applied to search the optimal disassembly path for a ballpoint pen disassembly process as an example.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3100-3116
• /
• 2016

With the rapid development of urban traffic system and fast increasing of vehicle numbers, the traditional centralized ways to generate the source-destination shortest path in terms of travel time(the optimal path) encounter several problems, such as high server pressure, low query efficiency, roads state without in-time updating. With the widespread use of smart cameras in the urban traffic and surveillance system, this paper maps the optimal path finding problem in the dynamic road network to the shortest routing problem in the smart camera networks. The proposed distributed optimal path generation algorithm employs the delay routing and caching mechanism. Real-time route update is also presented to adapt to the dynamic road network. The test result shows that this algorithm has advantages in both query time and query packet numbers.

• Journal of Biosystems Engineering
• /
• v.33 no.1
• /
• pp.51-57
• /
• 2008

The purpose of this study was to develop an optimal path planning program for autonomous speed sprayer in orchard. A digital map which contained coordinate information and entity information including height, width, radius of main stem, and disease of a trees was developed to build an optimal path. The digital map, dynamic programming and order-picking algorithm were used for planning an optimal path for autonomous speed sprayers. When this algorithm applied to rectangular-shaped orchards to travel whole trees, the developed program planned the same working path and same traveling distance as those of created by conventional method. But for irregular-shaped orchards, developed program planned differently and 5.06% shorter path than conventional method. When applied to create path for multi-selected trees, irregular-shaped orchards showed 13.9% shorter path and also rectangular-shaped orchards showed 9.1% shorter path. The developed program always planned shorter path than the path created by conventional method despite of variation of shape of orchards.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.565-569
• /
• 2007

To find optimal path is killer application in the telematics system. The shortest path of conventional system, however, isn't always optimal path. That is, the path with minimum travelling time could be defined as optimal path in the road networks. There are techniques and algorithms for finding optimal path. Hierarchical path algorithm categorizes road networks into major layer and minor layer so that the performance of operational time increases. The path searched is accurate as much as optimal path. At above 2 system, a method to allocate minor roads to major road region influences the performance extremely. This paper proposes methods to determine search space for selecting major roads in the hierarchical path algorithm. In addition, methods which apply the proposed methods to hierarchical route algorithm is presented.