• Title/Summary/Keyword: Optimal search

Search Result 1,571, Processing Time 0.025 seconds

Development of a Motion Control Algorithm for the Automatic Operation System of Overhead Cranes (천장크레인의 무인운전 시스템을 위한 운동제어 알고리즘 개발)

  • Lee, Jong-Kyu;Park, Young-Jo;Lee, Sang-Ryong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.10
    • /
    • pp.3160-3172
    • /
    • 1996
  • A search algorithm for the collision free, time optimal transport path of overhead cranes has been proposed in this paper. The map for the working environment of overhead cranes was constructed in the form of three dimensional grid. The obstacle occupied region and unoccupied region of the map has been represented using the octree model. The best-first search method with a suitable estimation function was applied to select the knot points on the collision free transport path to the octree model. The optimization technique, minimizing the travel time required for transporting objects to the goal while subjected to the dynamic constraints of the crane system, was developed to find the smooth time optimal path in the form of cubic spline functions which interpolate the selected knot points. Several simulation results showed that the selected estimation function worked effectively insearching the knot points on the collision free transport path and that the resulting transport path was time optimal path while satisfying the dynamic constraints of the crane system.

Optimum Structural Design of D/H Tankers by using Pareto Optimal based Multi-objective function Method (Pareto 최적점 기반 다목적함수 기법에 의한 이중선각유조선의 최적 구조설계)

  • Na, Seung-Soo;Yum, Jae-Seon;Han, Sang-Min
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.42 no.3
    • /
    • pp.284-289
    • /
    • 2005
  • A structural design system is developed for the optimum design of double hull tankers based on the multi-objective function method. As a multi-objective function method, Pareto optimal based random search method is adopted to find the minimum structural weight and fabrication cost. The fabrication cost model is developed by considering the welding technique, welding poses and assembly stages to manage the fabrication man-hour and process. In this study, a new structural design is investigated due to the rapidly increased material cost. Several optimum structural designs on the basis of high material cost are carried out based on the Pareto optimal set obtained by the random search method. The design results are compared with existing ship, which is designed under low material cost.

Optimal Path Search Algorithm for Urban Applying Received Signal Strength on Satellite Communication Environment (위성통신 환경에서 전파수신감도를 활용한 도심지 최적경로탐색 알고리즘)

  • Park, No-Uk;Kim, Joo-Seok;Lim, Joo-Yoeng;Lim, Tae-Hyuk;Yoo, Chang-Hyun;Kwon, Kun-Sup;Kim, Kyung-Seok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.189-197
    • /
    • 2012
  • In this paper, we propose an optimal path search algorithm that applies the received signal strength between a mobile device and a satellite. Because the common path search algorithm is only based on the shortest path search, it is difficult to provide stable multimedia services for the satellite mobile devices. The proposed algorithm provides the stable communication environment for the satellite mobile devices based on received signal strength. In Satellite communications, changes in the radio quality are severe depending on the receiving environment. Therefore, an accurate analysis of the receiving environment characteristics is very important for providing stable multimedia services of satellite communications. The causes of radio attenuation are atmosphere attenuation, vegetation attenuation and buildings attenuation. These factors were applied to analyze the received signal strength. The proposed algorithm can search the optimal path in urban for stable satellite multimedia services.

DEVELOPMENT OF A TABU SEARCH HEURISTIC FOR SOLVING MULTI-OBJECTIVE COMBINATORIAL PROBLEMS WITH APPLICATIONS TO CONSTRUCTING DISCRETE OPTIMAL DESIGNS

  • JOO SUNG JUNG;BONG JIN YUM
    • Management Science and Financial Engineering
    • /
    • v.3 no.1
    • /
    • pp.75-88
    • /
    • 1997
  • Tabu search (TS) has been successfully applied for solving many complex combinatorial optimization problems in the areas of operations research and production control. However, TS is for single-objective problems in its present form. In this article, a TS-based heuristic is developed to determine Pareto-efficient solutions to a multi-objective combinatorial optimization problem. The developed algorithm is then applied to the discrete optimal design problem in statistics to demonstrate its usefulness.

  • PDF

Precision Analysis of the STOMP(FW) Algorithm According to the Spatial Conceptual Hierarchy (공간 개념 계층에 따른 STOMP(FW) 알고리즘의 정확도 분석)

  • Lee, Yon-Sik;Kim, Young-Ja;Park, Sung-Sook
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.12
    • /
    • pp.5015-5022
    • /
    • 2010
  • Most of the existing pattern mining techniques are capable of searching patterns according to the continuous change of the spatial information of an object but there is no constraint on the spatial information that must be included in the extracted pattern. Thus, the existing techniques are not applicable to the optimal path search between specific nodes or path prediction considering the nodes that a moving object is required to round during a unit time. In this paper, the precision of the path search according to the spatial hierarchy is analyzed using the Spatial-Temporal Optimal Moving Pattern(with Frequency & Weight) (STOPM(FW)) algorithm which searches for the optimal moving path by considering the most frequent pattern and other weighted factors such as time and cost. The result of analysis shows that the database retrieval time is minimized through the reduction of retrieval range applying with the spatial constraints. Also, the optimal moving pattern is efficiently obtained by considering whether the moving pattern is included in each hierarchical spatial scope of the spatial hierarchy or not.

Optimization Method for the Design of LCD Back-Light Unit (LCD Back-Light Unit 설계를 위한 최적화 기법)

  • Seo Heekyung;Ryu Yangseon;Choi Joonsoo;Hahn Kwang-Soo;Kim Seongcheol
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.3
    • /
    • pp.133-147
    • /
    • 2005
  • Various types of ray-tracing methods are used to predict the quantity measures of radiation illumination, the uniformity of illumination, radiation performance of LCD BLU(Hack-Light Unit). The uniformity of radiation illumination is one of the most important design factor of BLU and is usually controlled by the diffusive-ink pattern printed on the bottom of light-guide panel of BLU. Therefore it is desirable to produce an improved (ideally, the optimal) ink pattern to achieve the best uniformity of radiation illumination. In this paper, we applied the Welder-Mead simplex-search method among various direct search method to compute the optimal ink pattern. Direct search methods are widely used to optimize the functions which are often highly nonlinear, unpredictably discontinuous, and nondifferentiable, The ink-pattern controlling the uniformity of radiation illumination is one type of these functions. In this paper, we found that simplex search methods are well suited to computing the optimal diffusive-ink pattern. In extensive numerical testing, we have found the simplex search method to be reasonably efficient and reliable at computing the optimal diffusive-ink pattern. The result also suggests that optimization can improve the functionality of simulation tools which are used to design LCD BLU.

Design of Optimal Capacity Coefficients of Flow Control Valves in the Hoist Hydraulic System Using the Complex Method (콤플렉스법에 의한 호이스트 유압회로 유량제어밸브의 최적유량계수 설계)

  • Lee, S.R.
    • Transactions of The Korea Fluid Power Systems Society
    • /
    • v.4 no.1
    • /
    • pp.1-6
    • /
    • 2007
  • The typical hydraulic system of hoist is composed of a hydraulic supply unit, a directional control valve, two pilot operated check valves, two flow control valves. The capacity coefficients of flow control valves should be adjusted for the hoist to operate at moderate speed and minimize the hydraulic energy loss. However, it is difficult to adjust the four capacity coefficients of flow control valves by trial and error for optimal operation. The steady state model of the hoist hydraulic system is derived and the optimal capacity coefficients of flow control valves are obtained using the complex method that is one kind of constrained direct search method.

  • PDF

Search Method for Optimal Valve Setting and Location to Reduce Leakage in Water Distribution Networks (배수관망시스템 누수저감을 위한 최적 밸브제어 및 위치탐색 모델 개발)

  • Choi, Jong Sub;Kala, Vairavamoorthy;Ahn, Hyo Won
    • Journal of Korean Society of Water and Wastewater
    • /
    • v.22 no.1
    • /
    • pp.149-157
    • /
    • 2008
  • The reduction of leakage is a major issue of the South Korea water industry. The inclusion of pressure dependent leakage terms in network analysis allows the application of optimization techniques to identify the most effective means of reducing water leakage in distribution networks. This paper proposes a method to find optimal setting and location of control valve for reducing leakage efficiently. The proposed search method differs from previous methods for addressing optimal valve location problem and improves the GA simulation time with guaranteeing for getting the global optimal solution. The strength of this method has been demonstrated by means of case studies. This allows the procedure of optimization to be more robust and computational efficient.

Global Search for Optimal Geometric Path amid Obstacles Considering Manipulator Dynamics (로봇팔의 동역학을 고려한 장애물 속에서의 최적 기하학적 경로에 대한 전역 탐색)

  • 박종근
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1995.10a
    • /
    • pp.1133-1137
    • /
    • 1995
  • This paper presents a numerical method of the global search for an optimal geometric path for a manipulator arm amid obstacles. Finite term quintic B-splines are used to describe an arbitrary point-to-point manipulator motion with fixed moving time. The coefficients of the splines span a linear vector space, a point in which uniquely represents the manipulator motion. All feasible geometric paths are searched by adjusting the seed points of the obstacle models in the penetration growth distances. In the numerical implementation using nonlinear programming, the globally optimal geometric path is obtained for a spatial 3-link(3-revolute joints) manipulator amid several hexahedral obstacles without simplifying any dynamic or geometric models.

  • PDF

Multi-objective optimal design of laminate composite shells and stiffened shells

  • Lakshmi, K.;Rama Mohan Rao, A.
    • Structural Engineering and Mechanics
    • /
    • v.43 no.6
    • /
    • pp.771-794
    • /
    • 2012
  • This paper presents a multi-objective evolutionary algorithm for combinatorial optimisation and applied for design optimisation of fiber reinforced composite structures. The proposed algorithm closely follows the implementation of Pareto Archive Evolutionary strategy (PAES) proposed in the literature. The modifications suggested include a customized neighbourhood search algorithm in place of mutation operator to improve intensification mechanism and a cross over operator to improve diversification mechanism. Further, an external archive is maintained to collect the historical Pareto optimal solutions. The design constraints are handled in this paper by treating them as additional objectives. Numerical studies have been carried out by solving a hybrid fiber reinforced laminate composite cylindrical shell, stiffened composite cylindrical shell and pressure vessel with varied number of design objectives. The studies presented in this paper clearly indicate that well spread Pareto optimal solutions can be obtained employing the proposed algorithm.