• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.221-227
• /
• 2019

It has long been known that weapon target assignment (WTA) problem is NP-hard. Nonetheless, an exact solution can be found using Brute-Force or branch-and bound method which utilize approximation. Many heuristic algorithms, genetic algorithm particle swarm optimization, etc., have been proposed which provide near-optimal solutions in polynomial time. This paper suggests polynomial time algorithm that can be obtain the optimal solution of WTA problem for the number of total weapons k, the number of weapon types m, and the number of targets n. This algorithm performs k times for O(mn) so the algorithm complexity is O(kmn). The proposed algorithm can be minimize the number of trials than brute-force method and can be obtain the optimal solution.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.4
• /
• pp.54-64
• /
• 2005

The study investigated genetic algorithms for the optimal control model of maximum height vertical jumping. The model includes forward dynamic simulations by the neural excitation-control variables. Convergence of genetic algorithms is very slow. In this paper the micro genetic algorithm(micro-GA) was used to reduce the computation time. Then a near optimal solution from micro-GA was an initial solution for VF02, which is one of well-developed and proven nonlinear programming algorithms. This approach provided the successful optimal solution for maximum-height jumping without a reasonable initial guess.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.44-47
• /
• 1996

Bang-bang control law provides the optimal solution for a minimum-time control problem, but ignores the intermediate path except for the initial and final points. In this paper, a near minimum-time suboptimal fuzzy logic controller is introduced that can control the intermediate path. A dynamic model for a system is established using the average dynamics method of linearization. System model is continuously updated over the control time periods. This makes it suitable for high speed or variable payload applications. Bang-bang control theory is modified and used to derive the preliminary control law. A fuzzy logic algorithm is then applied to adjust and find the best solution. The solution will provide the suboptimal minimum-time control law which can avoid obstacles in the workspace.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.1
• /
• pp.115-126
• /
• 1996

In the time optimal control problem, bang-bang control has been used becaese it is the theoretical time minimum solution. However, to improve tracking speed performance in the time optimal control, it is important to select a switching point accurately which makes the velocity zero near the target track. But it is not easy to select the swiching point accurately because of the damping coefficient variation and uncertainties of modeling an actual system. The Adaptive model following control(AMFC) is implemented to relieve the difficulty and inconvenience of this task. The AMFC and make the controlled plant follow as closely as possible to a desired reference model whose switching point can be calculated easily and accurately, assuring the error between the states of the reference model and those of the controlled plant appoaches zero. The hybrid control method composed of AMFC and PID is applied to a tracking actuator of the magneto optical disk drive(MODD) in random access devices to improve its slow tracking performance. According to the simulaion and experimental results, the average tracking time as small as 20ms is obtained for a 3.5 magneto-optical disk drive. The AMFC also can be applied for other random access devices to improve the average tracking performance.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.355-356
• /
• 2008

자율이동로봇의 기구학 및 동력학 모델을 통해 로봇의 특성을 고려하여 목표점까지 이동시간이 최소화 되는 경로 생성 방법을 제안한다. 본 논문에서는 초기 전역 경로를 골격선 그래프와 딕스트라알고리즘으로 설정하고, 로봇 기구학 및 동력학 제악조건을 고려하여 동적 프로그래밍으로 경로를 개선한다. 개선된 경로는 자율이동로봇이 이동하는데 걸리는 시간을 단축한다. 마지막으로 시뮬레이션을 통해 제안하는 방법의 성능을 검증한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.61
• /
• pp.33-39
• /
• 2000

In this paper, we present an algorithm for the multicast routing problem when there exit the cell replication limits of ATM switching nodes. This problem can be formulated as a Degree Constrained Minimum Steiner Tree Problem(DCSP). The proposed algorithm is a modification of the shortest path heuristic originally devised for minimum Steiner tree problem. From the experimental results, it can be seen that our algorithm is efficient to obtain a near optimal solution with comparatively low computational time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.3
• /
• pp.106-112
• /
• 2004

This paper presents a new heuristic algorithm for the machine cell(MC) formation problem. MC formation problem is represented as an unbalanced k-way network partition and the proposed algorithm uses four stage-approach to solve the problem. Four stages are natural sub-network formation, determination of intial vertexes for each sub-network, determination of initial partition, and improvement of initial partition. Results of experiments show that the suggested algorithm provides near optimal solutions within very short computational time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.645-651
• /
• 2002

we propose a k-nearest neighbors(k-NN) based pattern selection method. The method tries to select the patterns that are near the decision boundary and that are correctly labeled. The simulations over synthetic data sets showed promising results: (1) By converting a non-separable problem to a separable one, the search for an optimal error tolerance parameter became unnecessary. (2) SVM training time decreased by two orders of magnitude without any loss of accuracy. (3) The redundant SVM were substantially reduced.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.4
• /
• pp.205-211
• /
• 2003

In this paper we propose a disturbance design method to test a system's stability. It is shown that the time maximum disturbance is represented in bang-bang and state feedback form. To maximize the time severity index, the value of disturbance is determined by the associated switch curve. The original switch curve is vulnerable to model uncertainties and takes much calculation time. We propose an improved method to approximate the original switch curve. This reduces the computational time and implements sufficiently to test the stable system. Simulation results show how the approximate switch curve can be used to stress a system by driving it to oscillation along the maximum limit cycle.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.11 no.6
• /
• pp.31-37
• /
• 2002

This paper presents a new motion control strategy for singularity avoidance in 6 DOF articulated robot manipulators, based on a speed limiting algorithm for joint positions and velocities. For a given task, the robot is controlled so that the joints move with acceptable velocities and positions within the reachable range of each joint by considering the velocity limit. This paper aims at the development of a new efficient method to control robot motion near and at singularities. The proposed method has focused on generating the optimal joint trajectory for a Cartesian end-effector path within the speed limit of each joint by using the speed limit avoidance as well as the acceleration/deceleration scheme. The proposed method was verified using MATLAB-based simulations.