• ETRI Journal
• /
• v.31 no.5
• /
• pp.534-544
• /
• 2009

Finding link-disjoint or node-disjoint paths under multiple constraints is an effective way to improve network QoS ability, reliability, and so on. However, existing algorithms for such scheme cannot ensure a feasible solution for arbitrary networks. We propose design principles of an algorithm to fill this gap, which we arrive at by analyzing the properties of optimal solutions for the multi-constrained link-disjoint path pair problem. Based on this, we propose the link-disjoint optimal multi-constrained paths algorithm (LIDOMPA), to find the shortest link-disjoint path pair for any network. Three concepts, namely, the candidate optimal solution, the contractive constraint vector, and structure-aware non-dominance, are introduced to reduce its search space without loss of exactness. Extensive simulations show that LIDOMPA outperforms existing schemes and achieves acceptable complexity. Moreover, LIDOMPA is extended to the node-disjoint optimal multi-constrained paths algorithm (NODOMPA) for the multi-constrained node-disjoint path pair problem.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.10
• /
• pp.116-126
• /
• 2001

This paper suggests a numerical method to find optimal geometric path and minimum-time motion for a spatial 6-link manipulator arm (PUMA 560 type). To find a minimum-time motion, the optimal geometric paths minimizing 2 different dynamic performance indices are searched first, and the minimum-time motions are searched on these optimal paths. In the algorithm to find optimal geometric paths, the objective functions (performance indices) are selected to minimize joint velocities, actuator forces or the combinations of them as well as to avoid one static obstacle. In the minimum-time algorithm the traveling time is expressed by the power series including 21 terms. The coefficients of the series are obtained using nonlinear programming to minimize the total traveling time subject to the constraints of velocity-dependent actuator forces.

• The KIPS Transactions:PartC
• /
• v.14C no.7
• /
• pp.583-588
• /
• 2007

It is easy to implement a temporary network with a mobile ad-hoc network in which mobile nodes have without using a infrastructure network. They depend on their limited power. Recently, it is a hot issue to save the energy in a mobile ad-hoc network because a mobile nodes have a limited energy. Research of IEEE 802.11 PSM was proposed in a single hop ad-hoc assumption. If IEEE 802.11 PSM is applied to multi hop ad-hoc network, non-optimal paths will be generated by the mobile nodes which didn't receive a message of routing request. Non-optimal paths increase not only a network latency but also energy consumption of mobile nodes. Reconfiguring algorithm of non-optimal paths caused by the mobile nodes which didn't receive a message of routing request is proposed in this paper. A mobile node can overhear the data in his range. A wireless medium is shared by all mobile nodes using the same bandwidth. All mobile nodes lookout the non-optimal paths with these properties of a medium, if non-optimal path is generated, optimal reconfiguring will be accomplished by modifying routing table of itself or sending a request message of routing update to nearby nodes. By reconfiguring the non-optimal paths to optimized ones, network latency and energy consumption was decreased. It is confirmed to ignore the overhead caused by a algorithm presented in this paper through the result of the simulation.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.11 no.3
• /
• pp.49-56
• /
• 2011

This paper deals with a methodology for searching optimal route of hazard material (hazmat) vehicles. When we make a decision of hazmat optimal paths, there is a conflict between the public aspect which wants to minimize risk and the private aspect which has a goal of minimizing travel time. This paper presents Efficient Vector Labeling algorithm as a methodology for searching optimal path of hazmat transportation, which is intrinsically one of the multi-criteria decision making problems. The output of the presented algorithm is a set of Pareto optimal paths considering both risk and travel time at a time. Also, the proposed algorithm is able to identify non-dominated paths which are significantly different from each other in terms of links used. The proposed Efficient Vector Labeling algorithm are applied to test bed network and compared with the existing k-shortest path algorithm. Analysis of result shows that the proposed algorithm is more efficient and advantageous in searching reasonable alternative routes than the existing one.

• Korean Management Science Review
• /
• v.15 no.2
• /
• pp.229-237
• /
• 1998

This paper presents a new algorithm for the K Shortest Paths Problem which is developed with a Double Shortest Arborescence and an inward arc breaking method. A Double Shortest Arborescence is made from merging a forward shortest arborescence and a backward one with Dijkstra algorithm. and shows us information about each shorter path to traverse each arc. Then K shorter paths are selected in ascending order of the length of each short path to traverse each arc, and some paths of the K shorter paths need to be replaced with some hidden shorter paths in order to get the optimal paths. And if the cross nodes which have more than 2 inward arcs are found at least three times in K shorter path, the first inward arc of the shorter than the Kth shorter path, the exposed path replaces the Kth shorter path. This procedure is repeated until cross nodes are not found in K shorter paths, and then the K shortest paths problem is solved exactly. This algorithm are computed with complexity o($n^3$) and especially O($n^2$) in the case K=3.

• Journal of the Korea Society for Simulation
• /
• v.6 no.1
• /
• pp.97-108
• /
• 1997

For the purpose of decreasing economic loss from the traffic jam, a car route guidance system efficiently utilizing the existing roads has attracted a great deal of attention. In this paper, the search algorithm for optimal path and alternative paths, which is the main function of a car route guidance system, was presented using evolution program. Search efficiency was promoted by changing the population size of path individuals in each generation, applying the concept of age and lifetime to path individuals. Through simulation on the virtual road-traffic network consisting of 100 nodes with various turn constraints and traffic volumes, not only the optimal path with the minimal cost was obtained, avoiding turn constraints and traffic congestion, but also alternative paths with similar costs and acceptable difference was acquired, compared with optimal path.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2006.04a
• /
• pp.387-392
• /
• 2006

3D-based information is needed increasingly as well as 2D Information as cities grow and buildings become large and complex, and use of 3D-models is getting attention to handle such problems. However, there are limitations in using 3D-models because most applications and research efforts using them have been for visual analysis. This study presents a method to find optimal paths in indoor spaces as an illustration for using 3D-models in spatial analysis. We modeled rooms, paths and other facilities in a building as individual 3D objects. We made it possible to find paths based on network structure by integrating the vector-based networks of 2D-GIS and 3D-model.

• Journal of the military operations research society of Korea
• /
• v.16 no.2
• /
• pp.105-117
• /
• 1990

In the transportation network problems, it is often more desirable to select multiple number of optimal parths to prepare for additional constratints being imposed than to choose single optimal path. This paper addresses 'the problem of finding the k-shortest paths visiting p-specified nodes in a network'. The solution method is derived and the example of application is shown. The keypoint for determining the k-shortest paths via p-specified nodes is to combine the Shier's k-shortest path algorithm and the principle of optimality of dynamic programming method. Finally, for a transportation network problem consisting of national main routes, the k-shortest paths via some specified cites are obtained by using the solution method developed here.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.6
• /
• pp.1023-1033
• /
• 2012

An underwater planar covering problem is studied where the coverage region consists of polygonal cells, and line sweep motion is used for coverage. In many subsea applications, sidescan sonar has become a common tool, and the sidescan sonar data is meaningful only when the sonar is moving in a straight line. This work studies the optimal line sweep coverage where the sweep paths of the cells consist of straight lines and no turn is allowed inside the cell. An optimal line sweep coverage solution is presented when the line sweep path is parallel to an edge of the cell boundary. The total time to complete the coverage task is minimized. A unique contribution of this work is that the optimal sequence of cell visits is computed in addition to the optimal line sweep paths and the optimal cell decomposition.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.4
• /
• pp.89-95
• /
• 2012

Recent planning for bicycle use is relatively low compared to other studies. Although studies for the bicycle roads accessibility are actively underway, those considering topographical elements and characteristics of the user behaviors are very limited. Choosing paths of cyclists is typically influenced by slopes and intersections as well as optimal distance. This study presents a method to find optimal paths considering topographical elements in case of choosing paths for school commuting using bicycles. Conversion formulae suggested here are tested on a Songpa area using round-trip directions and compared with traditional optimal path computation.