• 대한기계학회논문집A
• /
• 제30권3호
• /
• pp.295-301
• /
• 2006

The wheel slip control systems are able to control the braking force more accurately and can be adapted to different vehicles more easily than conventional ABS systems. In order to achieve the superior braking performance through the wheel-slip control, real-time information such as the tire braking force at each wheel is required. In addition, the optimal target slip values need to be determined depending on the braking objectives such as minimum braking distance, stability enhancement, etc. In this paper, a robust wheel slip controller is developed based on the adaptive sliding mode control method and an optimal target slip assignment algorithm. An adaptive law is formulated to estimate the longitudinal braking force in real-time. The wheel slip controller is designed using the Lyapunov stability theory and considering the error bounds in estimating the braking force and the brake disk-pad friction coefficient. The target slip assignment algorithm is developed for the maximum braking force and searches the optimal target slip value based on the estimated braking force. The performance of the proposed wheel-slip control system is verified In simulations and demonstrates the effectiveness of the wheel slip control in various road conditions.

• 한국컴퓨터정보학회논문지
• /
• 제22권8호
• /
• pp.41-46
• /
• 2017

In this paper, we investigate the D2D Transmitter(Tx) and Receiver(Rx) pair assignment problem in the cellular system where D2D users share the uplink resource of the cellular system. Sharing the uplink resource of the cellular system may cause interference to the cellular system, though it is beneficial to improve the D2D user Capacity. Therefore, to protect the cellular users, D2D transmit power should be carefully controlled. In this work, we focus on optimal Tx-Rx assignment in such a way that the total transmit power of users is minimized. First, we consider the optimum Tx-Rx assignment in general and the corresponding complexity. Then, we propose an iterative D2D Tx-Rx assignment algorithm with low complexity that can minimize total transmit power of users. Finally, we present the numerical examples that show the complexity and the convergence to the unique transmit power level.

• 품질경영학회지
• /
• 제36권1호
• /
• pp.40-48
• /
• 2008

The purpose of this study is to rationally manage service facilities of convention center. This study is to develop the algorithm to consider optimal assignment and optimal operation system planning for convention center. The scheduling algorithm of this study develops through constructing the mathematical model and analyzing the mathematical structure of variables and constraints in model. The scheduling algorithm develops to consist eight stage of optimal operation planning and five stage of optimal assignment planning. Especially, this study indicates that optimum answer through mathematical model and results of algorithm is nondiscrimination.

• 한국경영과학회지
• /
• 제27권4호
• /
• pp.1-10
• /
• 2002

The ring routing and wavelength assignment problem arose in the planning of optical communication networks which use WDM rings. Traffic demands are given for each pair of nodes in an ring : each demand must be routed one of the two possible connections round the ring and the wavelength assignments must be made so that there are no conflicts : that is. no two connections whose routes share a link can be assigned the same wavelength along that link. The objective is to minimize the number of used wavelengths. We propose the local optimal routing for the problem and show that there always exists an optimal solution satisfying it. Furthermore we suggest a new lower bound for the problem and show that it is very efficient for the worst case example.

• Journal of Communications and Networks
• /
• 제9권4호
• /
• pp.408-418
• /
• 2007

In this paper, we address the question of dynamic network provisioning for time-varying traffic rates, with the objective of maximizing the system throughput. We assume that the network is capable of providing bandwidth guaranteed traffic tunnels for an ingress-egress pair and present an approach that (1) updates the tunnel routes and (2) adjusts the tunnel bandwidths, in an incremental, adaptive manner, based on the variations in the incoming traffic. First, we consider a simpler scenario where tunnel routes are fixed, and present an approach for adjusting the tunnel bandwidths dynamically. We show, through simulations, that our dynamic bandwidth assignment algorithm significantly outperforms the optimal static bandwidth provisioning policy, and yields a performance close to that of the optimal dynamic bandwidth provisioning policy. We also propose an adaptive route update algorithm, which can be used in conjunction with our dynamic bandwidth assignment policy, and leads to further improvement in the overall system performance.

• 한국컴퓨터정보학회논문지
• /
• 제21권2호
• /
• pp.97-103
• /
• 2016

This paper deals with the cycle time minimization problem that determines the productivity in printed circuit board (PCB) with n components using the m placement machines. This is known as production cycle time determination problem (PCTDP). The polynomial time algorithm to be obtain the optimal solution has been unknown yet, therefore this hard problem classified by NP-complete. This paper gets the initial assignment result with the machine has minimum unit placement time per each component firstly. Then, the balancing process with reallocation from overhead machine to underhead machine. Finally, we perform the swap optimization and get the optimal solution of cycle time $T^*$ within O(mn) computational complexity. For experimental data, the proposed algorithm can be obtain the same result as integer programming+branch-and-bound (IP+B&B) and B&B.

• 산업경영시스템학회지
• /
• 제11권17호
• /
• pp.39-46
• /
• 1988

This Paper is concerned with a man-multi machine assignment problem to minimize idle time. Assuming different types of semi-automatic machines with deterministic service-processing time, the problem approaches by sequential dependent one operator can handle several machines, where determine optimal range the cost of idle labor and machine time is to be minimized in preparing a work schedule. The Procedure, to establish man-machine assignment model, and it's results are: (1) Objective function to minimize opportunity loss cost, which is happened by idle time, is verified recursive process through heuristic method. (2) The algorithm, is programmed by BASIC language for personal computer, and a numerical example is given to illustrate the heuristic algorithm. This study will be helpful to enhance productivity of Shopflooras a result of increasing the efficiencies of both operator and machine.

• 대한산업공학회지
• /
• 제18권1호
• /
• pp.169-176
• /
• 1992

In parts assignment problem for FMS, both the parts and the tools required to process the parts are assigned to the machine tools for a specified planning period. This is an important decision-making problem for a short-term production planning of FMS. In this paper, parts assignment problem for FMS was analyzed to determine the optimal plan which has the adaptability to production fluctuation. A mathematical model was developed for determing the parts and the tools required for the machine tools which compose FMS, and the model was analyzed to obtain optimal solution. In addition, the vality and feasibility of the computational algorithm was examined by solving a numerical example.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권1호
• /
• pp.68-82
• /
• 2011

Wireless mesh networks (WMNs) provide high-speed backbone networks without any wired cable. Many researchers have tried to increase network throughput by using multi-channel and multi-radio interfaces. A multi-radio multi-channel WMN requires channel assignment algorithm to decide the number of channels needed for each link. Since the channel assignment affects routing and interference directly, it is a critical component for enhancing network performance. However, the optimal channel assignment is known as a NP complete problem. For high performance, most of previous works assign channels in a centralized manner but they are limited in being applied for dynamic network environments. In this paper, we propose a simple flow estimation algorithm and a hybrid channel assignment algorithm. Our flow estimation algorithm obtains aggregated flow rate information between routers by packet sampling, thereby achieving high scalability. Our hybrid channel assignment algorithm initially assigns channels in a centralized manner first, and runs in a distributed manner to adjust channel assignment when notable traffic changes are detected. This approach provides high scalability and high performance compared with existing algorithms, and they are confirmed through extensive performance evaluations.

• International Journal of Aeronautical and Space Sciences
• /
• 제10권1호
• /
• pp.58-66
• /
• 2009

Formation controller for multiple spacecrafts is designed based on a decentralized approach. The objective of the proposed controller is to make each spacecraft fly to the desired waypoints, while keeping the formation shape of multiple spacecrafts. To design the decentralized formation controller, the output feedback linearization technique using error functions for goal convergence and formation keeping is utilized for spacecraft dynamics. The primary contribution of this paper is to proposed optimal controller for formation flying based on the decentralized approach. To design the optimal controller, eigenvalue assignment technique is used. To verify the effectiveness of the proposed controller, numerical simulations are performed for three-dimensional waypoint-passing missions of multiple spacecrafts.