• 제목/요약/키워드: Mission Assignment

검색결과 19건 처리시간 0.021초

CBBA 기반 SEAD 임무를 위한 이종무인기의 분산형 임무할당 알고리듬 연구 (Distributed Task Assignment Algorithm for SEAD Mission of Heterogeneous UAVs Based on CBBA Algorithm)

  • 이창훈;문건희;유동완;탁민제;이인석
    • 한국항공우주학회지
    • /
    • 제40권11호
    • /
    • pp.988-996
    • /
    • 2012
  • 본 논문에서는 CBBA 알고리듬을 이용하여 SEAD 임무를 위한 이종무인기의 분산형 임무할당 알고리듬을 다룬다. SEAD 임무는 다수의 무인기를 다수의 대공 방어망 목표물에 할당 시키는 임무할당문제로 정의 할 수 있으며, 작전에 참여하는 무인기는 대공 방어망 파괴를 주목표 하는 위즐(weasel)과 주요 작전 및 전투 피해 평가를 수행하는 스트라이커(striker)로 구성된다. 본 논문에서는 최단경로생성 알고리듬과 CBBA 알고리듬을 이용하여 지형 장애물(terrain obstacle)이 있는 환경에서의 경로계획이 고려 된 이종 무인기의 분산형 임무할당 기법을 개발하고 SEAD 임무에 적용한다. 수치 시뮬레이션을 통하여 개발 된 기법의 성능과 적용가능성에 대해 검토한다.

원자력 추진 잠수함 최소 소요량 결정을 위한 임무 할당 최적화 모델 (An Optimal Mission Assignment Model for Determining a Minimum Required Level of Nuclear-powered Submarines)

  • 이동균;박승주;이진호
    • 한국군사과학기술학회지
    • /
    • 제21권2호
    • /
    • pp.235-245
    • /
    • 2018
  • This study first analyzes the necessity and the validity of procuring nuclear-powered submarines, and presents an optimization model as an integer program to determine a minimum required level of them. For an optimization model, we characterize a submarine's mission, ability and availability, and apply these to the model by constraints. Then, we assign the submarines available currently and the nuclear-powered submarines, that will be newly introduced, to the predefined missions over the planning time periods in a way that the number of nuclear-powered submarines be minimized. Randomly generated missions are employed to solve a mission assignment problem, and the results show that our integer programming model provides an optimal solution as designed, and this can provide a guideline for other weapon system procurement processes.

AHP기법과 목표계획법을 이용한 신병 군사특기 분류 모형 (A MOS Assignment Model to Enlisted Recruits Using AHP and Goal Programming)

  • 민계료;김해식
    • 한국국방경영분석학회지
    • /
    • 제25권1호
    • /
    • pp.142-159
    • /
    • 1999
  • To assign the soldiers in the adequate positions I military is almost as important as managing officers because they compose the main part of military structure and equipment operators. The current Military Occupational Specialty(MOS) assignment system lacks the capability to optimize the use of recruit's potential. We suggest an MOS assignment method for enlisted recruits using the Analytic Hierarchy Process(AHP) method, this method systematically provides a method of calculation of composite relative weights of decision elements to be considered during MOS assignment and a method of quantification for personal quality of new recruits. The quantified value of personal quality, Mission Performance Capability(MPC), in this study means the mission performance capability when a personnel is assigned to a certain MOS. This paper develops a multiple objectives MOS assignment model for enlisted recruits. It uses MPC of personnels, calculated with AHP method and consensus method, as parameters. The goal constraints are assurance of filling requirement, minimization of the number of unassigned personnel to MOS, capability satisfaction of education facility and support facility, assurance of desired MPC value level for MOS assignment, and maximization of total MPC. The objective function is to terminalization of the negative or positive deviation for the above goal constraints.

  • PDF

단위비행체계의 승무원 일일 비행스케줄링에 관한 연구 (A Study on the Daily Squadron Crew Scheduling)

  • 이유인
    • 한국국방경영분석학회지
    • /
    • 제15권1호
    • /
    • pp.28-43
    • /
    • 1989
  • Squadron crew scheduling problems can be defined as the assignment of crews to flights consistent with safety regulations and squadron policy. In this paper, the daily crew scheduling problems are formulated as zero-one interger programs known as generalized assignment problems. The objective function is to maximize the weighted mission interval to improve the crew performance. Flight schedules using the 0-1 integer model are compared with manual schedules. The results of the study show that the average crew performance is improved.

  • PDF

전시 공병장비 할당 및 운용 모형 (A War-time Engineering Equipment's Assignment and Operation Model)

  • 이재형;이문걸
    • 산업경영시스템학회지
    • /
    • 제46권4호
    • /
    • pp.294-303
    • /
    • 2023
  • During wartime, the operation of engineering equipment plays a pivotal role in bolstering the combat prowess of military units. To fully harness this combat potential, it is imperative to provide efficient support precisely when and where it is needed most. While previous research has predominantly focused on optimizing equipment combinations to expedite individual mission performance, our model considers routing challenges encompassing multiple missions and temporal constraints. We implement a comprehensive analysis of potential wartime missions and developed a routing model for the operation of engineering equipment that takes into account multiple missions and their respective time windows of required start and completion time. Our approach focused on two primary objectives: maximizing overall capability and minimizing mission duration, all while adhering to a diverse set of constraints, including mission requirements, equipment availability, geographical locations, and time constraints.

흡수 마코프 체인 시뮬레이션 기반 최적 함정 임무 할당 모형 (A Model for the Optimal Mission Allocation of Naval Warship Based on Absorbing Markov Chain Simulation)

  • 김성우;최경환
    • 한국산학기술학회논문지
    • /
    • 제22권6호
    • /
    • pp.558-565
    • /
    • 2021
  • 대한민국 해군은 북한과 주변국 등의 위협에 효과적으로 대응하기 위해 동/서/남해에 해군 함대를 배치하여 경비임무를 수행하고 있다. 그러나 함정의 도입연도, 임무일수, 무장능력, 교대시간이 서로 다르고, 함정고장률 등 불확실성이 매우 크기 때문에 적정 함정 임무 할당이 어렵다. 이런 이유로 현장에서는 근무 인원과 함정에 피로도가 높은 경비나 비상대기 임무의 비중을 높이고 있다. 본 연구에서는 사건 발생률이 시간에 따라 변화하는 복잡한 현상을 모형화하고 분석하는데 용이한 연속시간 흡수 마코프 체인을 활용하여 해군 함정의 임무를 최적으로 할당할 수 있는 시뮬레이션 모형을 제시했다. 수립한 모형의 수치분석을 통해 임무기간 동안 목표 운용률을 유지하기 위한 최적 임무기간 및 함정 수량 결정을 할 수 있었고, 각 임무별로 최적 함정을 할당함으로써 불필요한 비상대기 함정을 감소시키고, 승조원의 피로도와 고장 발생을 감소시킬 수 있다. 이 모형은 임무 할당 뿐만 아니라 적정 소요량 산정, 재고분석 등 여러 범위에 확장하여 적용할 수 있다는데 의의가 크다.

FUZZY 할당모형 및 공격항공기의 표적 할당 문제에 대한 응용 (A Fuzzy Allocation Model and Its Application to Attacker Assignment Problem)

  • 윤석준;고순주
    • 한국국방경영분석학회지
    • /
    • 제18권1호
    • /
    • pp.47-60
    • /
    • 1992
  • A class of allocation problems can be modeled in a linear programming formulation. But in reality, the coefficient of both the cost and constraint equations can not be generally determined by crisp numbers due to the imprecision or fuzziness in the related parameters. To account for this. a fuzzy version is considered and solved by transforming to a conventional non-linear programming model. This gives a solution as well as the degree that the solution satisfies the objective and constraints simultaneously and hence will be very useful to a decision maker. An attacker assignment problem for multiple fired targets has been modeled by a linear programming formulation by Lemus and David. in which the objective is to minimize the cost that might occur on attacker's losses during the mission. A fuzzy version of the model is formulated and solved by transforming it to a conventional nonlinear programming formulation following the Tanaka's approach. It is also expected that the fuzzy approach will have wide applicability in general allocation problems

  • PDF

최적화와 분할 방법을 이용한 항공기 표적 할당 연구 (A Study on Aircraft-Target Assignment Problem in Consideration of Deconfliction)

  • 이혁;이영훈;김선훈
    • 경영과학
    • /
    • 제32권1호
    • /
    • pp.49-63
    • /
    • 2015
  • This paper investigates an aircraft-target assignment problem in consideration of deconfliction. The aircraft-target assignment problem is the problem to assign available aircrafts and weapons to targets that should be attacked, where the objective function is to minimize the total expected damage of aircrafts. Deconfliction is the way of dividing airspaces for aircraft flight to ensure the safety while performing the mission. In this paper, mixed integer programming model is suggested, where it considers deconfliction between aircrafts. However, the suggested MIP model is non-linear and limited to get solution for large size problem. The 2-phase decomposition model is suggested for efficiency and computation, where in the first phase target area is divided into sectors for deconfliction and in the second phase aircrafts and weapons are assigned to given targets for minimizing expected damage of aircraft. The proposed decomposition model shows outperforms the model developed for comparison in the computational experiment.

평균 필드 게임 기반의 강화학습을 통한 무기-표적 할당 (Mean Field Game based Reinforcement Learning for Weapon-Target Assignment)

  • 신민규;박순서;이단일;최한림
    • 한국군사과학기술학회지
    • /
    • 제23권4호
    • /
    • pp.337-345
    • /
    • 2020
  • The Weapon-Target Assignment(WTA) problem can be formulated as an optimization problem that minimize the threat of targets. Existing methods consider the trade-off between optimality and execution time to meet the various mission objectives. We propose a multi-agent reinforcement learning algorithm for WTA based on mean field game to solve the problem in real-time with nearly optimal accuracy. Mean field game is a recent method introduced to relieve the curse of dimensionality in multi-agent learning algorithm. In addition, previous reinforcement learning models for WTA generally do not consider weapon interference, which may be critical in real world operations. Therefore, we modify the reward function to discourage the crossing of weapon trajectories. The feasibility of the proposed method was verified through simulation of a WTA problem with multiple targets in realtime and the proposed algorithm can assign the weapons to all targets without crossing trajectories of weapons.

조종사 임무 효율을 고려한 공군 비행 스케줄 최적화 (Optimized Air Force Flight Scheduling Considering Pilot' s Mission Efficiency)

  • 권민석;윤찬일;김지용
    • 산업경영시스템학회지
    • /
    • 제43권4호
    • /
    • pp.116-122
    • /
    • 2020
  • Human and material resource planning is one representative example of Operations Research. Resource planning is important not only in civilian settings but also in military ones. In the Air Force, flight scheduling is one of the primary issues that must be addressed by the personnel who are connected to flight missions. However, although the topic is of great importance, relatively few studies have attempted to resolve the problem on a scientific basis. Each flight squadron has its own scheduling officers who manually draw up the flight schedules each day. While mistakes may not occur while drafting schedules, officers may experience difficulties in systematically adjusting to them. To increase efficiency in this context, this study proposes a mathematical model based on a binary variable. This model automatically drafts flight schedules considering pilot's mission efficiency. Furthermore, it also recommends that schedules be drawn up monthly and updated weekly, rather than being drafted from scratch each day. This will enable easier control when taking the various relevant factors into account. The model incorporates several parameters, such as matching of the main pilots and co-pilots, turn around time, availability of pilots and aircraft, monthly requirements of each flight mission, and maximum/minimum number of sorties that would be flown per week. The optimal solution to this model demonstrated an average improvement of nearly 47% compared with other feasible solutions.