• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.7
• /
• pp.76-82
• /
• 2004

The solutions of neighboring optimal control are typically obtained using the sweep method or transition matrices. Due to the numerical integration, however, the gain matrix can become infinite as time go to final one in the transition matrices, and the Riccati solution can become infinite when the final time free. To overcome these disadvantages, this paper proposes the pseudospectral Legendre method which is to first discreteize the linear boundary value problem using the global orthogonal polynomial, then transforms into an algebraic equations. Because this method is not necessary to take any integration of transition matrix or Riccati equation, it can be usefully used in real-time operation. Finally, its performance is verified by the numerical example for the space vehicle's orbit transfer.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.95-102
• /
• 2022

This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min values and third numbers, which are known polynomial algorithms in the past. In addition, the problem of MM applying the backtracking method was improved. The proposed algorithm partition the descending ordered set S into three and assigned to the forward, backward, and best-fit allocation method with maximum margin, and found an optimal solution for 50.00%, which is 5 out of 10 data in initial allocation phase. The remaining five data also showed performance to find the optimal solution by exchanging numbers between surplus boxes and shortage boxes at least once and up to seven times. The proposed algorithm that performs simple allocation and exchange optimization with less O(k) linear time performance complexity than the three-partition m=n/3 data, and it was shown that there could be a polynomial time algorithm in which TPP is a P-problem, not NP-complete.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.4
• /
• pp.171-176
• /
• 2020

This paper proposes polynomial-time algorithm for maximum weighted independent set(MWIS) problem that is well known as NP-hard. The known algorithms for MWIS problem are polynomial-time to specialized in particular graph type, distributed, or clustering method. But there is no unified algorithm is suitable to all kinds of graph types. Therefore, this paper suggests unique polynomial-time algorithm that is suitable to all kinds of graph types. The proposed algorithm merges the maximum weighted vertex v_i and maximum weighted vertex v_j that is not adjacent to v_i. As a result of apply to undirected graphs and trees, this algorithm can be get the optimal solution. This algorithm improves previously known solution to new optimal solution.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.4
• /
• pp.155-161
• /
• 2017

This paper suggests polynomial time solution algorithm for Sudoku puzzle problem. This problem has been known NP (non-deterministic polynomial time)-complete. The proposed algorithm set the initial value of blank cells to value range of [$1,2,{\cdots},9$]. Then the candidate set values in blank cells deleted by preassigned clue in row, column, and block. We apply the basic rules of Stuart, and proposes two additional rules. Finally we apply binary backtracking(BBT) technique. For the experimental Sudoku puzzle with various categories of solution, the BBT algorithm can be obtain all of given Sudoku puzzle regardless of any types of solution.

• 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.

• Structural Engineering and Mechanics
• /
• v.60 no.4
• /
• pp.547-565
• /
• 2016

In this work a new 3-unknown non-polynomial shear deformation theory for the buckling and vibration analyses of functionally graded material (FGM) sandwich plates is presented. The present theory accounts for non-linear in plane displacement and constant transverse displacement through the plate thickness, complies with plate surface boundary conditions, and in this manner a shear correction factor is not required. The main advantage of this theory is that, in addition to including the shear deformation effect, the displacement field is modelled with only 3 unknowns as the case of the classical plate theory (CPT) and which is even less than the first order shear deformation theory (FSDT). The plate properties are assumed to vary according to a power law distribution of the volume fraction of the constituents. Equations of motion are derived from the Hamilton's principle. Analytical solutions of natural frequency and critical buckling load for functionally graded sandwich plates are obtained using the Navier solution. The results obtained for plate with various thickness ratios using the present non-polynomial plate theory are not only substantially more accurate than those obtained using the classical plate theory, but are almost comparable to those obtained using higher order theories with more number of unknown functions.

• Smart Structures and Systems
• /
• v.11 no.4
• /
• pp.365-386
• /
• 2013

Monitoring systems currently applied to concrete bridges include strain gauges, inclinometers, accelerometers and displacement transducers. In general, vertical displacements are one of the parameters that more often need to be assessed because their information reflects the overall response of the bridge span. However, the implementation of systems to continuously and directly observe vertical displacements is known to be difficult. On the other hand, strain gauges and inclinometers are easier to install, but their measurements provide no more than indirect information regarding the bridge deflection. In this context, taking advantage of the information collected through strain gauges and inclinometers, and the processing capabilities of current computers, a procedure to evaluate bridge girder deflections based on polynomial functions is presented. The procedure has been implemented in an existing software system - MENSUSMONITOR -, improving the flexibility in the data handling and enabling faster data processing by means of real time visualization capabilities. Benefiting from these features, a comprehensive analysis aiming at assessing the suitability of polynomial functions as an approximate solution for deflection curves, is presented. The effect of boundary conditions and the influence of the order of the polynomial functions on the accuracy of results are discussed. Some recommendations for further instrumentation plans are provided based on the results of the present analysis. This work is supported throughout by monitoring data collected from a laboratory beam model and two full-scale bridges.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12C
• /
• pp.1082-1087
• /
• 2008

Maximum Likelihood (ML) detection is well known to exhibit better bit-error-rate (BER) than many other detectors for multiple-input multiple-output (MIMO) channel. However, ML detection has been shown a difficult problem due to its NP-hard problem. It means that there is no known algorithm which can find the optimal solution in polynomial-time. In this paper, Semi-Definite relaxation (SDR) is iteratively applied to ML detection problem. The probability distribution can be obtained by survival eigenvector out of the dominant eigenvalue term of the optimal solution. The probability distribution which is yielded by SDR is recurred to the received signal. Our approach can reach to nearly ML performance.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.1
• /
• pp.16-24
• /
• 2011

In this paper, we propose a new guidance law for target observability enhancement, which can control both terminal impact angle and acceleration. The proposed guidance law is simple form, combined conventional time-to-go polynomial guidance and a additional bias term which consists of relative position and proportional gain. The guidance law provides oscillatory flight trajectory and it maintains the conventional time-to-go polynomial guidance performance. To investigate the characteristics of the guidance law, we derive the closed-form solution, and various simulations are performed for proving the validity of the proposed guidance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.6
• /
• pp.33-41
• /
• 2021

This paper proposes heuristic greedy algorithm that can be find the solution within polynomial time with solution finding rule for the capacitated minimum spanning tree(CMST) problem, known as NP-hard. The CMST problem can be solved by computer-aided meta-heuristic because of the Esau-Williams heuristic polynomial time algorithm has a poor performance. Nevertheless the meta-heuristic methods has a limit performance that can't find optimal solution. This paper suggests visual by handed solution-finding rule for CMST. The proposed algorithm firstly construct MST, and initial feasible solution of CMST from MST, then optimizes the CMST with the subtree gates more adjacent to root node. As a result of total 30 cases of OR-LIB 10 data, Q=3,5,10, the proposed algorithm gets the best performance.