• Title/Summary/Keyword: 최적배치계획

Search Result 92, Processing Time 0.032 seconds

Optimal Region Deployment for Cooperative Exploration of Swarm Robots (군집로봇의 협조 탐색을 위한 최적 영역 배치)

  • Bang, Mun Seop;Joo, Young Hoon;Ji, Sang Hoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.6
    • /
    • pp.687-693
    • /
    • 2012
  • In this paper, we propose a optimal deployment method for cooperative exploration of swarm robots. The proposed method consists of two parts such as optimal deployment and path planning. The optimal area deployment is proposed by the K-mean Algorithm and Voronoi tessellation. The path planning is proposed by the potential field method and A* Algorithm. Finally, the numerical experiments demonstrate the effectiveness and feasibility of the proposed method.

A Study on the Optimum Locations of University Restaurant (대학시설의 최적배치계획에 관한 연구 - 대학식당을 중심으로 -)

  • Kim, Jong-Seok
    • Journal of the Korean Institute of Educational Facilities
    • /
    • v.5 no.2
    • /
    • pp.30-39
    • /
    • 1998
  • The paper analyses the optimum locations of university facilities. Pick up a student restaurant, and, using network model, do that examine the following thing with a purpose. 1) Do comparison examination with a current location and optimum location of restaurant. 2) Plan an location of existing restaurant again, and examine location of new restaurant. As a result, made clear what that did the total sum of distance with a minimum could utilize.

  • PDF

A study of (M,S)-optimal h($h\geq2$)-concorrance most balanced design ((M, S)-최적인 동반수 h($h\geq2$)을 갖는 가장 균형된 계획에 관한 연구)

  • 배종성
    • The Korean Journal of Applied Statistics
    • /
    • v.10 no.1
    • /
    • pp.61-68
    • /
    • 1997
  • In this paper, we show that the proper equi-replicate binary designs with h($h\geq2$)-concurrence most balanced designs are (M, S)-optimal. It is very difficult to construct with more than 3-concurrence designs, so we choose 3-concurrence most balanced designs out of the known PBIBD(3).

  • PDF

항로표지 시뮬레이터 구축방안 연구

  • Gong, In-Yeong;Kim, Yeon-Gyu
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2012.10a
    • /
    • pp.371-373
    • /
    • 2012
  • 항로표지는 선박이 운항하는데 필요한 각종 정보를 제공해 주는 중요한 시설물이다. 과거에는 이러한 항로표지 배치를 설계함에 있어 도상 및 경험에 의한 설계가 주로 이루어져 왔으나, 최근 선박의 대형화 및 물동량 증가와 함께 해역의 복잡성이 상대적으로 증가하면서, 항로표지 배치에 보다 과학적인 설계 기법을 도입해야 할 필요성이 증가하고 있다. 항로표지 시뮬레이터는 우리나라 주요 해역의 지형적, 환경적 특성, 그리고 여기에서 운항하는 선박들의 특성, 해상교통 특성 등을 종합적으로 고려한 시뮬레이션 환경을 항로표지 설계자에게 제공함으로써, 최적의 안전성과 효율성을 가진 항로표지 설계, 항로표지 최적 배치계획 등에 대한 의사결정을 효과적으로 지원할 수 있는 시스템을 의미한다. 이를 위해서는, 기존의 선박운항 시뮬레이터 시스템이 가진 기본적인 기능외에 추가적인 기능 설계가 필요하다. 본 논문에서는 이러한 항로표지 시뮬레이터에 대한 개발 및 구축 계획에 대해서 정리하였다.

  • PDF

Optimal Allocation Model of KDX for Missile Defense (미사일 방어를 위한 KDX 최적배치모형 연구)

  • Lee, Sang-Heon;Jeong, In-Cheol
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.4
    • /
    • pp.69-77
    • /
    • 2006
  • In most positioning and allocation practices, many mathematical models are proposed in various fields. The set covering (SC) problem has many practical applications of modeling not only real world problem but also in military. As our air defense weapon systems are getting older and declining the performance, new plans far acquisition of high-tech air defense weapon system are being conducted. In this paper we established simulation model for optimal allocation of KDX which carries new missile defense weapon system by using partial set covering considering both attacker and defender side. By implementating simulation model, we assess the available scenarios and show the optimal pre-positioning of KDX and interceptor's allocation. Furthermore, we provide a variety of experiments and extensive scale sized situations for Korea Indigenous Missile Defense (KIMD) and support decision-making for efficient positioning of unit.

  • PDF

3-D Optimal Disposition of Direction Finders (방향탐지장비의 삼차원 최적 배치)

  • Lee, Ho-Joo;Kim, Chang-Geun;Kang, Sung-Su
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.765-772
    • /
    • 2011
  • In this paper, a simulation-based method is presented to dispose direction finders in three dimensional space for locating targets using the directional data. A direction finder(DF) is a military weapon that is used to find locations of targets that emit radio frequencies by operating two or more DFs simultaneously. If one or more DFs are operated in the air, the accuracy of location estimation can be enhanced by disposing them in a better configuration. By extending the line method, which is a well-known algorithm for 2-D location estimation, into 3-D space, the problem of 3-D location estimation is defined as an nonlinear programming form and solved analytically. Then the optimal disposition of DFs is considered with the presented method in which methods of simulation and search technique are combined. With the suggested algorithm for 3-D disposition of DFs, regions in which targets exist can be effectively covered so that the operation effect of DF be increased.

Optimum Alignment of Marine Propulsion Shafting (박용추진축계의 최적배치에 관한 연구)

  • 문덕홍
    • Journal of the Korean Society of Fisheries and Ocean Technology
    • /
    • v.18 no.1
    • /
    • pp.39-46
    • /
    • 1982
  • The author has developed the computer program in order to calculate the optimum alignment condition of marine propulsion shafting by linear programming method. The input of program was calculated by the matrix method of three-moment. He compared the calculated values with the experimental values measured by the strain gage on the model shaft, and the values of calculation on actual propulsion shafting with those of Det norske Veritas. The computer program of optimum alignment has been applied to the actual shaft. The results obtained are as follows: 1. To obtain the reaction of supporting points in the straight line necessary to the optimum alignment and the reaction influence number, after the computer program had been developed and then adapted, the result of experimental values and calculated values agreed with each other and the values of the actual shaft were also approximately similar to the values of other program. 2. In this paper, the measuring method on model shaft by strain gage can be effectively used at the time of adjusting alignment condition of actual shaft. 3. The supporting bearing should be considerably readjusted to the vertical direction in order to satisfy some limited condition.

  • PDF

Decision Making Support Model for Optimal Location of Anti-Tactical Ballistic missile (탄도미사일 방어무기의 최적배치를 위한 의사결정지원모델)

  • Yun Yong-Bok;Kim Gi-Beom;Jeong Bong-Ju
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1715-1721
    • /
    • 2006
  • 기존의 탄도미사일 방어무기의 배치와 관련된 대부분의 연구들은 배치규모가 결정된 상태에서 후보지 중 최적위치를 구하는 것이 일반적이며, 방어확률이 최대가 되는 것을 목적으로 하는 확률적 부분담당모델의 개념을 적용한다. 본 연구에서는 무기의 도입 및 배치를 담당하는 의사결정자들에게 보다 많은 상황과 변수를 가정할 수 있도록 하는 의사결정모델을 제안한다. 모델에는 기존에 고려하지 않았던 후보지의 수준 및 방호시설의 최소방어요구수준 등이 포함되어 있으며, 모델은 의사결정자들이 결정하는 결정변수에 따라 각기 다른 방어무기의 위치와 규모 및 방어확률을 제시 하게 된다. 모델의 결과로 제시되는 내용은 무기체계의 최초소요제기 단계에서 필요규모와 위치를 결정하고 또한, 그 결과 값이 최초계획단계의 대략적 무기배치규모와 상이할 경우는 그 값이 필요성과 타당성을 가질 수 있는 수치적 분석을 제공해 준다.

  • PDF

Optimization of Destroyer Deployment for Effectively Detecting an SLBM based on a Two-Person Zero-Sum Game (2인 제로섬 게임 기반의 효과적인 SLBM 탐지를 위한 구축함 배치 최적화)

  • Lee, Jinho
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.1
    • /
    • pp.39-49
    • /
    • 2018
  • An SLBM (submarine-launched ballistic missile) seriously threatens the national security due to its stealthiness that makes it difficult to detect in advance. We consider a destroyer deployment optimization problem for effectively detecting an SLBM. An optimization model is based on the two-person zero-sum game in which an adversary determines the firing and arriving places with an appropriate trajectory that provides a low detection probability, and we establish a destroyer deployment plan that guarantees the possibly highest detection probability. The proposed two-person zero-sum game model can be solved with the corresponding linear programming model, and we perform computational studies with a randomly generated area and scenario and show the optimal mixed strategies for both the players in the game.