• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.2
• /
• pp.159-166
• /
• 2020

In this paper, we propose a heterogenous mission allocation technique for multi-UAV system based on discrete event modeling. We model a series of heterogenous mission creation, mission allocation, UAV departure, mission completion, and UAV maintenance and repair process as a mathematical discrete event model. Based on the proposed model, we then optimize the number of UAVs required to operate in a given scenario. To validate the optimized number of UAVs, the simulations are executed repeatedly, and their results are analyzed. The proposed mission allocation technique can be used to efficiently utilize limited UAV resources, and allow the human operator to establish an optimal mission plan.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.17 no.2
• /
• pp.167-174
• /
• 2014

In this paper, we address a task allocation problem for a robot team that performs a search and attack mission. The robots are limited in sensing and communication capabilities, and carry different types of resources that are used to attack a target. The environment is uncertain and dynamic where no prior information about targets is given and dynamic events unpredictably happen. The goal of robot team is to collect total utilities as much as possible by destroying targets in a mission horizon. To solve the problem, we propose a distributed task allocation framework incorporated with effective resource management based on resource welfare. The framework we propose enables the robot team to retain more robots available by balancing resources among robots, and respond smoothly to dynamic events, which results in system performance improvement.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.7
• /
• pp.156-161
• /
• 2020

In an environment that operates multiple UAVs, the use of a decentralized task allocation algorithm has more robustness from a single failure of UAV on the mission because there is no central command center. In addition, UAVs have situational awareness and redistribute tasks among themselves, which can expand the mission range. The use of multiple UAVs in a mission has increased as the agent hardware has decreased in size and cost. The decentralized mission-planning algorithm has the advantages of a larger mission range and robustness to a single failure during the mission. This paper extended the type of mission the uses CBBA, which is the most well-known decentralized task allocation algorithm, to the point mission and en-route mission. This will describe the real mission situation that has the purpose of surveillance. A Monte-Carlo simulation was conducted in the case of multiple agents in the task-rich environment, and the global rewards of each case were compared.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.17 no.3
• /
• pp.40-50
• /
• 2009

Avionics system's function for an air transport mission is analysed. The starting point for designing a Avionics system is a clear understanding of the mission requirements and the requirement allocation by the top level aircraft system. Therefore, the analysis begins by making a top-down analysis to the aircraft missions. The baseline mission is divided into segments, and each segment is subjected to a detailed analysis to establish the requirements for the Avionics system. Special attention is given to capture the key aspects of interfaces, and to incorporate them into the design.

• Journal of Advanced Navigation Technology
• /
• v.27 no.1
• /
• pp.1-7
• /
• 2023

Mission autonomy system should be embedded on UAV (Unmanned Aerial Vehicle) for mosaic warfare where UAVs autonomously assign tasks to themselves. UxAS (Unmanned x-systems Autonomy Service) proposed by Air Force Research Laboratory is mission autonomy system for unmanned platforms. UxAS has extensible structure composed of numerous module services. However, UxAS can conduct mission autonomy process only when an operator sends an autonomy request. In this paper, We analyze the process of mission autonomy in UxAS, and propose an improved structure of UxAS where mission autonomy process is autonomously triggered by situation awareness service without the request of the operator. The proposed process was validated by simulation.

• Journal of Aerospace System Engineering
• /
• v.17 no.2
• /
• pp.78-85
• /
• 2023

For Multi-UAV systems, a task allocation could be a key factor to determine the capability to perform a task. In this paper, we proposed a task allocation method based on genetic algorithm for minimizing makespan and satisfying various constraints. To obtain the optimal solution of the task allocation problem, a huge calculation effort is necessary. Therefore, a genetic algorithm-based method could be an alternative to get the answer. Many types of UAVs, tasks, and constraints in real worlds are introduced and considered when tasks are assigned. The proposed method can build the task sequence of each UAV and calculate waiting time before beginning tasks related to constraints. After initial task allocation with a genetic algorithm, waiting time is added to satisfy constraints. Multiple numerical simulation results validated the performance of this mission planning method with minimized makespan.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.4177-4190
• /
• 2015

Current research on Internet of Things (IoT) has primarily addressed the means to enhancing smart resource allocation, automatic network operation, and secure service provisioning. In particular, providing satisfactory security service in IoT systems is indispensable to its mission critical applications. However, limited resources prevent full security coverage at all times. Therefore, these limited resources must be deployed intelligently by considering differences in priorities of targets that require security coverage. In this study, we have developed a new application of Cognitive Radio (CR) technology for IoT systems and provide an appropriate security solution that will enable IoT to be more affordable and applicable than it is currently. To resolve the security-related resource allocation problem, game theory is a suitable and effective tool. Based on the Blotto game model, we propose a new strategic power allocation scheme to ensure secure CR communications. A simulation shows that our proposed scheme can effectively respond to current system conditions and perform more effectively than other existing schemes in dynamically changeable IoT environments.

• Journal of the military operations research society of Korea
• /
• v.35 no.3
• /
• pp.31-45
• /
• 2009

Reliability should be done from the initial stage of development to secure performance and safety of system. To establish and achieve target reliability of a system, reliability should be allocated into the subsystems. In the acquisition and development of a system, frequent failures will cause a negative effect on performing mission and occurs increasing operating cost. This study reviewed and evaluated the existing reliability allocation models using operation and maintenance costs to find the correlation between reliability allocation models and its operating cost. A target system reliability on the diesel engine to be developed for naval vessels is allocated into its subsystem based on the existing reliability allocation models. A selection methodology for reliability allocation models was made to minimize operating cost by using simulation based on the given operating diesel engine data for naval vessels.

• Journal of the military operations research society of Korea
• /
• v.30 no.2
• /
• pp.133-140
• /
• 2004

In this paper, with the limited range of ammunition supply point(ASP) at ammunition battalion in specific corps and light automobile battalion(LAB) directly supports its vehicle for ammunition supply, we propose optimal model to minimize transportation time and logistics cost using integer programming(IP) for efficient ammunition resupply allocation during a given operation period of front combat unit. And then, we consider ammunition treatment and supply capacity of ammunition supply point(ASP), constraint elements of transportation ability considering time and cost, ammunition storage capacity of combat unit, combat situation and unit mission to propose this model. Finally, through numerical example, we examine the applicable feasibility of proposed model.

• Journal of the military operations research society of Korea
• /
• v.18 no.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