• 한국수학교육학회지시리즈A:수학교육
• /
• 제50권1호
• /
• pp.1-12
• /
• 2011

It is the aim of this paper to study the target problem solving process in reference to the base problem. We observed closely how students solve the target problem in reference to the base problem. The students couldn't solve the target problem, although they succeed to find the base problem. This comes from failing to discover the structural similarity between the target problem and the base problem. Especially it is important to cognize the proper corresponding of primary components between the base problem and target problem. And there is sometimes a part component of the target problem equivalent to the base problem and the target problem can't be solved without the insight into this fact. Consequently, finding the base problem fail to reach solving the target problem without the insight into their structural similarity. We have to make efforts to have an insight into the structural similarity between the target problem and the base problem to solve the target problem.

• 대한교통학회지
• /
• 제27권6호
• /
• pp.157-166
• /
• 2009

교통망설계문제(network design problem, NDP)는 교통체계(transportation system)을 최적화시키는 설계변수(design parameter, design variable)를 구하는 문제이다. 본 연구에서는 교통망설계문제를 조금 변환시킨 목표지향 교통망설계문제(target-oriented network design problem, target-oriented NDP)를 제시하고 이를 풀기 위한 기법도 제시한다. 목표지향 교통망설계는 교통운영자(traffic operator) 또는 관리자(travel manager)가 특정 교통정책 목표(target)를 미리 설정하고 이를 달성하기 위한 최적 설계변수를 찾는 문제이다. 즉, 일반적인 교통망설계문제(general NDP)는 총통행비용이나 순편익 등 특정목적함수를 최적화시키는 설계변수를 찾는데 반해, 목표지향 교통망설계(target NDP)는 사전에 설정된 목표수준(target level)을 달성하기 위한 설계변수를 구하는 문제이다. 본 연구에서 제시된 목표지향 교통망설계모형을 교통수단분담문제에 적용하여 모형을 평가한다.

• Journal of applied mathematics & informatics
• /
• 제38권3_4호
• /
• pp.239-247
• /
• 2020

In this paper, we consider the target control problem for the linear systems by using the solution of the Hausdorff moment problem.

• 자원ㆍ환경경제연구
• /
• 제31권4호
• /
• pp.733-753
• /
• 2022

우리나라는 2015년 국가 온실가스 감축목표(Nationally Determined Contribution, 이하 NDC)를 수립한 이래, 2019년 한 차례 수정 후 지난해 말 상향안을 발표하였다. 전환, 산업, 건물 등 각 부문별 탄소배출량은 NDC 목표 달성을 위해 설정된다. 본 연구는 협조적 게임이론의 claims problem 또는 파산문제(bankruptcy problem)를 활용하여 부문별 온실가스 감축목표를 분석한다. Claims problem에서 다루는 대표적인 5개의 분배규칙을 정의하고 각 규칙의 특성을 공리적으로 확인하였다. 또한, NDC 목표 달성을 위한 부문별 탄소배출량 분배문제에 각 분배규칙을 적용하고 그 결과를 정부목표와 비교분석하였다. 전환 부문에 책정된 정부목표는 5개 분배규칙에서 할당하는 배출량보다 낮은 반면, 산업 부문의 정부목표 배출량은 5개 분배규칙의 결과보다 높은 것으로 확인되었다. 그 외 부문은 정부목표가 클레임 수준에 비례하여 배출량을 할당하는 분배규칙의 결과와 유사한 것으로 나타났다.

• 한국국방경영분석학회지
• /
• 제29권2호
• /
• pp.61-80
• /
• 2003

A fire sequencing problem is considered. Fire sequencing problem is a kind of scheduling problem that seeks to minimize the overall time span under a result of weapon­target allocation problem. The assigned weapons should impact a target simultaneously and a weapon cannot transfer the firing against another target before all planned rounds are consumed. The computational complexity of the fire sequencing problem is strongly NP­complete even if the number of weapons is two, so it is difficult to get the optimal solution in a reasonable time by the mathematical programming approach. Therefore, a genetic algorithm is adopted as a solution method, in which the representation of the solution, crossover and mutation strategies are applied on a specific condition. Computational results using randomly generated data are presented. We compared the solutions given by CPLEX and the genetic algorithm. Above $7(weapon){\times}15(target)$ size problems, CPLEX could not solve the problem even if we take enough time to solve the problem since the required memory size increases dramatically as the number of nodes expands. On the other hand, genetic algorithm approach solves all experimental problems very quickly and gives good solution quality.

• 전기학회논문지
• /
• 제68권1호
• /
• pp.172-181
• /
• 2019

This paper deals with the problem of generating the energy optimal trajectory which is intended to enhance the target tracking performance of a passive homing missile. Noticing that the essence of passive target tracking is the range estimation problem, the target information gathered by passive measurements can be readily analyzed by introducing the range estimator designed in line-of-sight(LOS) frame. Moreover, for the linear filter structure of the suggested range estimator, the cost function associated with the target information is clearly expressed as a function of the line-of-sight rate. Based on this idea, the optimal missile trajectory maximizing the target information is obtained by solving the saddle point problem for an indefinite quadratic cost which consists of the target information and the energy. It is shown that, different from the previous heuristic approaches, the guidance command producing the optimal passive homing trajectory is produced by the modified proportional navigation guidance law whose navigation constant is determined by the weighting coefficient for target information cost.

• 한국경영과학회지
• /
• 제19권1호
• /
• pp.201-206
• /
• 1994

The linear search problem is concerned with finding a hiden target on the real line R. The position of the target governed by some probability distribution. It is desired to find the target in the least expected search time. This problem has been formulated as an optimization problem by a number of authors without making use of Markov Decision Process (MDP) theory. It is the aim of the paper to give a (MDP) formulation to the search problem which we feel is both natural and easy to follow.

• 한국군사과학기술학회지
• /
• 제23권4호
• /
• pp.381-388
• /
• 2020

Weapon target assignment problem is an essential technology for automating the operator's rapid decision-making support in a battlefield situation. Weapon target assignment problem is a kind of the optimization problem that can build up an objective function by maximizing the number of threat target destructed or maximizing the survival rate of the protected assets. Weapon target assignment problem is known as the NP-Complete, and various studies have been conducted on it. Among them, a greedy heuristic algorithm which guarantees (1-1/e) approximation has been considered a very practical method in order to enhance the applicability of the real weapon system. In this paper, we formulated the weapon target assignment problem for supporting decision-making at the level of artillery. The lazy strategy based on hierarchical structure is proposed to accelerate the greedy algorithm. By experimental results, we show that our algorithm is more efficient in processing time and support the same level of the objective function value with the basic greedy algorithm.

• 한국군사과학기술학회지
• /
• 제18권5호
• /
• pp.517-524
• /
• 2015

In this paper, we propose a new target tracking filter architecture using active and passive sensors in underwater environment. A passive sensor for target tracking needs a bearing measurement of target. And target tracking filter for using passive sensor has the observability problem. On the other hand, an active sensor does not have the problem associated with system observability problem because an active sensor uses bearing and range measurement. In this paper, the tracking filter algorithm that could be used in the active and passive sensor system is proposed to analyze maneuvering target and to improve target tracking performance. The proposed tracking filter algorithm is tested by a series of computer simulation runs and the results are analyzed and compared with existing algorithm.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.57-59
• /
• 2006

The purpose of search problem is to maximize the probability of target detection as limited search capability. Especially, as elapsing of time at a point of time of initial information received the target detection rate for searching an expected location due to a moving target such that wrecked ship or submarine decrease in these problems. The algorithm of search problem to a moving target having similar property of above targets should solve the search route as quickly as possible. In existing studies, they have a limit of applying in practice due to increasing computation time required by problem size (i.e., number of search area, search time). In this study, we provide that it takes more reasonable computation time than preceding studies even though extending a problem size practically using an approximate computation of probability.