• International Journal of Control, Automation, and Systems
• /
• v.5 no.6
• /
• pp.674-680
• /
• 2007

The probabilistic roadmap (PRM) method, which is a popular path planning scheme, for a manipulator, can find a collision-free path by connecting the start and goal poses through a roadmap constructed by drawing random nodes in the free configuration space. PRM exhibits robust performance for static environments, but its performance is poor for dynamic environments. On the other hand, reinforcement learning, a behavior-based control technique, can deal with uncertainties in the environment. The reinforcement learning agent can establish a policy that maximizes the sum of rewards by selecting the optimal actions in any state through iterative interactions with the environment. In this paper, we propose efficient real-time path planning by combining PRM and reinforcement learning to deal with uncertain dynamic environments and similar environments. A series of experiments demonstrate that the proposed hybrid path planner can generate a collision-free path even for dynamic environments in which objects block the pre-planned global path. It is also shown that the hybrid path planner can adapt to the similar, previously learned environments without significant additional learning.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.4
• /
• pp.777-783
• /
• 2007

In this paper, we present a novel control approach for linear motor-based transfer systems in which friction reduction and enhancement of control performance are considered. In general, in such systems friction effects from rails and wheels, and internal bearings complicate control scheme since in particularly its dynamics are arbitrarily changed due to mass variation, detent force of motor systems, and gaps among stators. Our control approach is achieved to reduce this undesired friction dynamics using fuzzy system. We construct hybrid control approach for this control system which Is composed of a nominal control and a vertical control against friction. Fuzzy parameter vector is optimally determined from iterative simulation experiments. We demonstrate its superiority via numerical simulations comparing with a traditional control method.

• Kyungpook Mathematical Journal
• /
• v.61 no.3
• /
• pp.523-558
• /
• 2021

In this paper, we study some fixed point properties of n-generalized Bregman nonspreading mappings in reflexive Banach space. We introduce a hybrid iterative scheme for finding a common solution for a countable family of equilibrium problems and fixed point problems in reflexive Banach space. Further, we give some applications and numerical example to show the importance and demonstrate the performance of our algorithm. The results in this paper extend and generalize many related results in the literature.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.906-914
• /
• 2009

SC-FDMA is employed in the 3GPP-LTE standard as the uplink transmission scheme. SC-FDMA has advantages that the signal has a low PAPR property and a simple equalizer such as FD-LE can be implemented. But FD-LE has inferior performance to Hybrid-DFE composed of frequency-domain feedforward filter and time-domain feedback filter. Recently, several IB-DFE algorithms have been proposed to overcome the disadvantages of implementation and processing complexity of Hybrid-DFE and to obtain superior performance to FD-LE. In this paper, we apply several IB-DFE algorithms to 3GPP-LTE uplink system and compare their performance by calculating BER. We investigate the effects of channel estimation errors and Doppler shift on performance. Finally, by analyzing computational complexity of IB-DFEs, we present some criteria to choose appropriate algorithm and to decide the number of iterative processes.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.1
• /
• pp.32-38
• /
• 2012

Each sensor node can know its location in several ways, if the node process the information based on its geographical position in sensor networks. In the localization scheme using GPS, there could be nodes that don't know their locations because the scheme requires line of sight to radio wave. Moreover, this scheme is high costly and consumes a lot of power. The localization scheme without GPS uses a sophisticated mathematical algorithm estimating location of sensor nodes that may be inaccurate. AHLoS(Ad Hoc Localization System) is a hybrid scheme using both GPS and location estimation algorithm. In AHLoS, the GPS node, which can receive its location from GPS, broadcasts its location to adjacent normal nodes which are not GPS devices. Normal nodes can estimate their location by using iterative triangulation algorithms if they receive at least three beacons which contain the position informations of neighbor nodes. But, there are some cases that a normal node receives less than two beacons by geographical conditions, network density, movements of nodes in sensor networks. We propose an indirect localization scheme for low-density sensor nodes which are difficult to receive directly at least three beacons from GPS nodes in wireless network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.12
• /
• pp.1250-1260
• /
• 2014

In this paper, a novel resource scheduling, which is used for hub network based long distance airborne tactical communication, is proposed. Recently, some countries of the world has concentrated on developing data rate and networking performance of CDL, striving to keep pace with modern warfare, which is changed into NCW. And our government has also developed the next generation high capacity CDL. In hub network, a typical communication structure of CDL, hybrid FDMA/TDMA can be considered to exchange high rate data among multiple UAVs simultaneously, within limited bandwidth. However, due to different RTT and traffic size of UAV, idle time resource and unnecessary packet transmission delay can occur. And these losses can reduce entire efficiency of hub network in long distance communication. Therefore, in this paper, we propose RTT and data traffic size based UAV scheduling, which selects time/frequency resource of UAVs by using iterative sorting algorithm. The simulation results verified that the proposed scheme improves data rate and packet delay performance in low complexity.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.

• Journal of the Korean Geotechnical Society
• /
• v.22 no.6
• /
• pp.51-61
• /
• 2006

An efficient and accurate hybrid reliability analysis method is proposed in this paper to quantify the risk of an axially loaded single pile considering pile-soil interaction behavior and uncertainties in various design variables. The proposed method intelligently integrates the concepts of the response surface method, the finite difference method, the first-order reliability method, and the iterative linear interpolation scheme. The load transfer method is incorporated into the finite difference method for the deterministic analysis of a single pile-soil system. The uncertainties associated with load conditions, material and section properties of a pile and soil properties are explicitly considered. The risk corresponding to both serviceability limit state and strength limit state of the pile and soil is estimated. Applicability, accuracy and efficiency of the proposed method in the safety assessment of a realistic pile-soil system subjected to axial loads are verified by comparing it with the results of the Monte Carlo simulation technique.