• Journal of the military operations research society of Korea
• /
• v.23 no.2
• /
• pp.103-119
• /
• 1997

This paper considers the shortest path problem combined with Min-Min-Sum objective for solving the problem of the military logistics. This paper develops a polynomial-time algorithm for the optimal solution. To analyze the real combat situation, the ability time and distance time of communication line are considered. The complexities of algorithm between previous study and the algorithm developed in this paper is presented. Finally we provide a simple example of application with randomly generated problem.

• Honam Mathematical Journal
• /
• v.38 no.1
• /
• pp.71-84
• /
• 2016

The aim of this work is to compute the volume of the graph polytope associated with various type of finite simple graphs composed of paths and stars. Recurrence relations are obtained using the recursive volume formula (RVF) which was introduced in Lee and Ju ([3]). We also discussed the relationship between the volume of the graph polytopes and the number of linear extensions of the associated posets for given bipartite graphs.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.72-79
• /
• 1989

In this paper we consider the problem of finding an optimal straight line path of moving facility which interacts with a set of existing facilities fixed within a given rectangular area. We present a simple algorithm for rectilinear metric which greatly improves the pervious method and also propose algorithms for Euclidean and squared Euclidean distances.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.699-703
• /
• 1993

When the error path can be modeled as a pure delay, an adaptive algorithm for slowly time varying system is proposed to minimize the sound pressure level. This algorithm makes it possible to use the fittered-x LMS algorithm with on-line delay modeling of the error path. Another simple adaptive algorithm for pure tone noise is proposed which eliminates the cross term in the multiple error filtered-x LMS algorithm.

• Structural Engineering and Mechanics
• /
• v.8 no.5
• /
• pp.439-452
• /
• 1999

A simple numerical scheme suitable for tracing the fracture propagation path for structures idealized by means of Hillerborg's classical cohesive crack model is presented. A direct collocation, multidomain boundary element method is adopted for the required space discretization. The algorithm proposed is necessarily iterative in nature since the crack itinerary is a priori unknown. The fracture process is assumed to be governed by a path-dependent generally nonlinear softening law. The potentialities of the method are illustrated through two examples.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.1057-1058
• /
• 2008

In this paper, the algorithm and the computer simulation of a effective homing navigation system are presented. it is a combination of Path integration by using population coding and neural network and simple avoidance obstacle algorithm. Also, through the computer simulation, we demonstrated the feasibility of the suggested method.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.109-124
• /
• 2003

Although most commercial relational DBMSs Provide a graphical query language for the user friendly interfaces of the databases, few research has been done for graphical query languages in object databases. Expressing complex query conditions in a concise and intuitive way has been an important issue in the design of graphical query languages. Since the object data model and object query languages are more complex than those of the relational ones, the graphical object query language should have a concise and intuitive representation method. We propose a graphical object query language called GOQL (Graphical Object Query Language) for object databases. By employing simple graphical notations, advanced features of the object queries such as path expressions including set attributes, quantifiers, and/or methods can be represented in a simple graphical notation. GOQL has an excellent expressive power compared with previous graphical object query languages. We show that path expressions in XSQL(1,2) can be represented by the simple graphical notations in GOQL. We also propose an algorithm that translates a graphical query in GOQL into the textual object query with the same semantics. We finally describe implementation results of GOQL in the Internet environments.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.39-46
• /
• 2009

Generally, Path-finding algorithms which use heuristic function may occur a problem of the increase of exploring cost in case of that there is no way determined by heuristic function or there are 2 way more which have almost same cost. In this paper, we propose an abstract graph for path-finding with dynamic information. The abstract graph is a simple graph as real road network is abstracted. The abstract graph is created by fixed-size cells and real road network. Path-finding with the abstract graph is composed of two step searching, path-finding on the abstract graph and on the real road network. We performed path-finding algorithm with the abstract graph against A* algorithm based on fixed-size cells on road network that consists of 106,254 edges. In result of evaluation of performance, cost of exploring in path-finding with the abstract graph is about 3~30% less than A* algorithm based on fixed-size cells. Quality of path in path-finding with the abstract graph is, However, about 1.5~6.6% more than A* algorithm based on fixed-size cells because edges eliminated are not candidates for path-finding.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.43 no.3 s.309
• /
• pp.31-40
• /
• 2006

Many researches on path planning and obstacle avoidance for the fundamentals of mobile robot have been done. Informations from various sensors can find obstacles and make path. In spite of many solutions of finding optimal path, each can be applied to only a constrained condition. This means that it is difficult to find a universal algorithm. A optimal path with a complicated computation generates a time delay which cannot avoid moving obstacles. In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. RAS method using obstacle information from variable sensors is useful to get minimum path length to goal.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1256-1275
• /
• 2014

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.