• 제목/요약/키워드: Artillery Operations

검색결과 37건 처리시간 0.025초

지형공간정보와 제원 특성을 적용한 대포병레이더 최적배치모형 (Optimal Allocation Model of Anti-Artillery Radar by Using ArcGIS and its Specifications)

  • 이문걸
    • 산업경영시스템학회지
    • /
    • 제41권2호
    • /
    • pp.74-83
    • /
    • 2018
  • It is very crucial activities that Korean army have to detect and recognize enemy's locations and types of weapon of their artillery firstly for effective operation of friendly force's artillery weapons during wartime. For these activities, one of the most critical artillery weapon systems is the anti-artillery radar (hereafter; radars) for immediate counter-fire operations against the target. So, in early wartime these radar's roles are very important for minimizing friendly force's damage because arbiters have to recognize a several enemy's artillery positions quickly and then to take an action right away. Up to date, Republic of Korea Army for tactical artillery operations only depends on individual commander's intuition and capability. Therefore, we propose these radars allocation model based on integer programming that combines ArcGIS (Geographic Information System) analysis data and each radar's performances which include allowable specific ranges of altitude, azimuth (FOV; field of view) and distances for target detection, and weapons types i.e., rocket, mortars and cannon ammo etc. And we demonstrate the effectiveness of their allocation's solution of available various types of radar asset through several experimental scenarios. The proposed model can be ensured the optimal detection coverage, the enhancement of artillery radar's operations and assisting a quick decision for commander finally.

포병부대 비계획 사격순서 결정 알고리즘 (Algorithms for Fire Sequencing Problem in Unplanned Artillery Attack Operation)

  • 최용백;김경섭
    • 산업경영시스템학회지
    • /
    • 제35권2호
    • /
    • pp.37-44
    • /
    • 2012
  • This paper focuses on scheduling problems arising in the military. In planned artillery attack operations, a large number of threatening enemy targets should be destroyed to minimize fatal loss to the friendly forces. We consider a situation in which the number of available weapons is smaller than the number of targets. Therefore it is required to develop a new sequencing algorithm for the unplanned artillery attack operation. The objective is to minimize the total loss to the friendly forces from the targets, which is expressed as a function of the fire power potential, after artillery attack operations are finished. We develop an algorithm considering the fire power potential and the time required to destroy the targets. The algorithms suggested in this paper can be used in real artillery attack operations if they are modified slightly to cope with the practical situations.

전술적 운용과 무기체계 획득을 위한 대화력전 모델링과 분석 (Modeling and Analysis of Counterfire Warfare for Tactical Operation and Acquisition)

  • 임종원;이태억;김대규
    • 한국군사과학기술학회지
    • /
    • 제16권2호
    • /
    • pp.175-184
    • /
    • 2013
  • In counterfire warfare, it is important to detect and attack enemy targets faster than the enemy using sensing and shooting assets. The artillery assets of North Korea are mostly mine artillery and much more than those of South Korea. To cope with sudden fire attacks from North Korea, we need to improve capability of our artillery. In this paper, we discuss issues and problems of our counterfire warfare systems and processes to overcome numerical inferiority and defend against the mine artillery. We develop a simulation model for counterfire warfare and analyze effectiveness of our counterfire weapon systems and operations based on various counterfire warfare scenarios. Finally, we propose methods of tactical operations and acquisition strategies of counterfire weapon systems, including detaction, firing, and protection assets.

포병진지 구축을 위한 공병장비 최적배정 모형 (Optimum Allocation Model of Military Engineer Equipments for Artillery Position Development)

  • 장영초;이문걸
    • 경영과학
    • /
    • 제34권2호
    • /
    • pp.103-113
    • /
    • 2017
  • The artillery is a key element of the ground forces operation during wartime, and the military engineers support the artillery position development operation to support the smooth operation of the artillery. In establishing the artillery position development operation plan, the commander requires more than his intuition to find the best option reflecting a number of elements of the battlefield situation which changes every minute. Moreover, the number of available equipment is smaller than the number of required position developments, and the effective equipment operation becomes essential element of this issue. This study quantified the capability of the available engineering equipment, organized a number of teams enabling equipment to put out the maximum capacity based on the quantified figures, and formed the model which allocates the team to the developing points to minimize the developing time. The goal programming method was applied to resolve the problem. The developed model was applied to compare the total mission duration following the number of teams, the variable for commander's decision, and the result of this study can be used as the quantitative data for commander's decision making process in establishing the artillery position development support operation through effective equipment management.

포병부대 사격순서결정을 위한 분지한계 알고리즘 연구 (A Branch-and-Bound Algorithm on the Fire Sequencing for Planned Artillery Operations)

  • 윤상흠;황원식;전재호;이익선
    • 산업경영시스템학회지
    • /
    • 제33권3호
    • /
    • pp.154-161
    • /
    • 2010
  • This paper considers the simultaneously firing model for the artillery operations. The objective of this paper is to find the optimal fire sequence minimizing the final completion time of the firing missions of multiple artillery units for multiple targets. In the problem analysis, we derive several solution properties to reduce the solution space. Moreover, two lower bounds of objective are derived and tested along with the derived properties within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

스케줄링을 이용한 계획표적 사격순서의 최적화 방안 (An Optimization of the Planned Target Sequencing Problem Using Scheduling Method)

  • 황원식;이재영
    • 한국국방경영분석학회지
    • /
    • 제33권1호
    • /
    • pp.105-115
    • /
    • 2007
  • 장차전은 첨단화된 무기체계와 최근의 전쟁양상을 고려해 볼 때 화력전의 성공여부가 전쟁의 결정적인 영향을 초래하게 될 것이다. 하지만 현재 한국군 포병전력은 수적으로 북한군에 비해 열세이며, 이를 극복하기 위한 방법으로 신속/정확한 사격으로 적에게 치명적인 피해를 줄 것이 요구된다. 따라서, 본 논문에서는 다수 표적을 수리적 모델을 이용하여 사격순서를 정하여 사격종료시간을 최소화함으로써 작전 운영의 융통성을 부여해 줄 수 있는 방법을 제시하였다. 또한 야전포병부대에서 화력계획 작성시 고려할 수 있는 지휘관의 의도, 일부 포병부대의 예상되는 사격제한(진지변환, 사거리 한계),우선순위 표적(핵심, 고가치), 화력계획의 차후 변경 등 각종 실질적 상황을 고려하여 최대한 빠른 시간에 사격을 마칠 수 있도록 하였다. 이와 같은 사격순서 결정문제를 혼합정수 계획모형(MIP: Mixed Integer Programming)으로 구성하였고 분석 수단으로 ILOG OPL을 이용하여 최적해를 구하였다. 본 연구에서 제시한 모형을 야전포병부대에서 활용한다면, 작전운용간 좀더 효과적이고 신속한 사격이 되어 전투력 향상에 기여할 수 있을 것이다.

유전자 알고리즘을 이용한 시간제약 포병 표적처리문제 (A Field Artillery Targeting Problem with Time Window by Genetic Algorithm)

  • 서재욱;김기태;전건욱
    • 한국국방경영분석학회지
    • /
    • 제36권2호
    • /
    • pp.11-24
    • /
    • 2010
  • 네트워크 중심전(NCW) 및 효과중심작전(EBO)으로 대표되는 현대 및 미래전에서 포병의 신속하고 정확한 정밀타격능력은 전쟁 승패의 중요한 요인으로 작용될 것이다. 본 연구는 대화력전 및 화력지원간 실제 운용되는 환경 중 갱도포병과 같이 타격제한시간이 있는 포병 표적처리에 관한 연구로 여러 가지 제한사항들을 모형 화하여 표적할당 및 사격순서를 동시에 결정하는 문제이다. 본 연구에서는 시간제약이 있는 포병 표적처리문제에서 사격 제한시간을 만족하면서, 총 사격시간을 최소화하는 수리모형과 유전자 알고리즘을 제시하였다. 소형 문제를 이용한 축소실험으로 본 연구에서 제안하는 수리모형과 유전자 알고리즘의 타당성을 입증하였으며, 대형 문제를 이용한 확대실험에서 유전자 알고리즘으로 근사 최적해를 산출하였다.

2단계 추계학적 야전 포병 사격 순서 결정 모형에 관한 연구 (A Two-Stage Stochastic Approach to the Artillery Fire Sequencing Problem)

  • 조재영
    • 한국국방경영분석학회지
    • /
    • 제31권2호
    • /
    • pp.28-44
    • /
    • 2005
  • The previous studies approach the field artillery fire scheduling problem as deterministic and do not explicitly include information on the potential scenario changes. Unfortunately, the effort used to optimize fire sequences and reduce the total time of engagement is often inefficient as the collected military intelligence changes. Instead of modeling the fire sequencing problem as deterministic model, we consider a stochastic artillery fire scheduling model and devise a solution methodology to integrate possible enemy attack scenarios in the evaluation of artillery fire sequences. The goal is to use that information to find robust solutions that withstand disruptions in a better way, Such an approach is important because we can proactively consider the effects of certain unique scheduling decisions. By identifying more robust schedules, cascading delay effects will be minimized. In this paper we describe our stochastic model for the field artillery fire sequencing problem and offer revised robust stochastic model which considers worst scenario first. The robust stochastic model makes the solution more stable than the general two-stage stochastic model and also reduces the computational cost dramatically. We present computational results demonstrating the effectiveness of our proposed method by EVPI, VSS, and Variances.

신경망을 이용한 포병모의훈련체계 향상방안 (Enhancement of Artillery Simulation Training System by Neural Network)

  • 류혜준;고효헌;김지현;김성식
    • 한국국방경영분석학회지
    • /
    • 제34권1호
    • /
    • pp.1-11
    • /
    • 2008
  • 본 연구에서는 다양하고 복잡한 변수간의 비선형적인 관계를 분석할 수 있는 신경망의 특성을 이용하여 곡사화기를 사용하는 포병의 모의훈련체계를 향상시킬 수 있는 방안을 제시하였다. 신경망 모델은 Conjugate Gradient 학습알고리즘을 사용하였고, 모델의 신뢰성은 모의실험을 통해 수학적 회귀분석모델과 신경망 모델의 예측오차를 비교하여 입증하였다. 신경망모델을 곡사화기 모의훈련체계 개선에 활용한다면, 보다 실전적인 모의훈련을 가능하게 하여 전투력 향상 및 예산절감에도 크게 기여할 것이다.

적 위협을 고려한 포병진지 규모결정에 관한 연구 (A Study on Determination of the Size of Battery Position in Consideration of Enemy Threat)

  • 허화만;김충영
    • 한국국방경영분석학회지
    • /
    • 제23권2호
    • /
    • pp.155-170
    • /
    • 1997
  • Currently, increasing the number of artillery units requires more deployment space in FABA. However, available positions of artillery units in FEBA is limited due to mountainous terrains. Therefore, it is hard to find enough artillery position space in accordance with the field artillery mannual. This paper studies on determination of the size of battery position in order to maximize the firing-effectiveness and to minimize the enemy threat. Also, it studies the possibility of reducing the size of a battery position. The optimum size of a battery position id obtained by using Dantzig's model and Supper Quick II model which produces the probability of kill data with various input data. As a result, it shows that the size of battery position can be reduced without decreasing the firing-effectiveness.

  • PDF