• Journal of the Korea Society for Simulation
• /
• v.30 no.3
• /
• pp.1-9
• /
• 2021

Commander and staffs on the battlefield are aware of the situation and, based on the results, they perform military activities through their military decisions. Recently, with the development of information technology, the demand for artificial intelligence to support military decisions has increased. It is essential to identify, collect, and pre-process the data set for reinforcement learning to utilize artificial intelligence. However, data on enemies lacking in terms of accuracy, timeliness, and abundance is not suitable for use as AI learning data, so a training model is needed to collect AI learning data. In this paper, a methodology for learning artificial intelligence was presented using the constructive wargame model exercise data. First, the role and scope of artificial intelligence to support the commander and staff in the military decision-making process were specified, and to train artificial intelligence according to the role, learning data was identified in the Chang-Jo 21 model exercise data and the learning results were simulated. The simulation data set was created as imaginary sample data, and the doctrine of ROK Army, which is restricted to disclosure, was utilized with US Army's doctrine that can be collected on the Internet.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.17-25
• /
• 2011

At the computer games, we can experience a variety of environments using a virtual object. It is similar to that be trained in War-game simulator of the defense. Actual soldiers and a computer-generated virtual group(Computer Generated Force: CGF) in 3-D virtual battlefield environment are training. However, path finding algorithm, one of the techniques of simulation models, to the current level only considers the shortest time path. So, this current level at the special situation of the army in the battlefield for selecting the optimal path is limited. The focus of this paper is to select the least-cost path using the deadline with several different mission conditions(METT+TC). For the only shortest time path algorithm and the least-cost path algorithm using dealine,($d_t$, one of METT+TC elements), Its usefulness is verifying the change of the move spent time(t) for all possible paths and the fighting power of the combat troops(Troops ability, a) through a comparison of the total cost of moves(c(t)). According to the results, when considering the deadline, the proposed algorithm saves about 62.5% of the maximum cost.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.10
• /
• pp.299-308
• /
• 2023

As the spectrum shortage problem has accelerated by the emergence of various services, New Radio-Unlicensed (NR-U) has appeared, allowing users who communicated in licensed bands to communicate in unlicensed bands. However, NR-U network users reduce the performance of Wi-Fi network users who communicate in the same unlicensed band. In this paper, we aim to simultaneously maximize the fairness and throughput of the unlicensed band, where the NR-U network users and the WiFi network users coexist. First, we propose an optimal power allocation scheme based on Monte Carlo Policy Gradient of reinforcement learning to maximize the sum of rates of NR-U networks utilizing rate-splitting multiple access in unlicensed bands. Then, we propose a channel occupancy time division algorithm based on sequential Raiffa bargaining solution of game theory that can simultaneously maximize system throughput and fairness for the coexistence of NR-U and WiFi networks in the same unlicensed band. Simulation results show that the rate splitting multiple access shows better performance than the conventional multiple access technology by comparing the sum-rate when the result value is finally converged under the same transmission power. In addition, we compare the data transfer amount and fairness of NR-U network users, WiFi network users, and total system, and prove that the channel occupancy time division algorithm based on sequential Raiffa bargaining solution of this paper satisfies throughput and fairness at the same time than other algorithms.

• Journal of the Korea Society for Simulation
• /
• v.29 no.2
• /
• pp.105-117
• /
• 2020

Analysis of combat effectiveness is required to consider the concept of tactical cooperative engagement between manned-unmanned weapon systems, in order to predict the required operational capabilities of future weapon systems that meets the concept of 'effect-based synchronized operations.' However, analytical methods such as mathematical and statistical models make it difficult to analyze the effects of complex systems under nonlinear warfare. In this paper, we propose a combat simulation model that can simulate the concept of cooperative engagement between manned-unmanned combat entities based on wireless communications. First, we model unmanned combat entities, e.g., unmanned ground vehicles and drones, and manned combat entities, e.g., combatants and artillery, considering the capabilities required by the future ground system. We also simulate tactical behavior in which all entities perform their mission while sharing battlefield situation information through wireless communications. Finally we explore the feasibility of the proposed model by analyzing combat effectiveness such as target acquisition rate, remote control success rate, reconnaissance lead time, survival rate, and enemy's loss rate under a small-unit armor reconnaissance scenario. The proposed model is expected to be used in war-game combat experiments as well as analysis of the effects of manned-unmanned ground weapons.

• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.77-85
• /
• 2006

The cost of downloading content from the Internet may be costly for mobile device users using its 3G connection, because the 3G connection cost to download data from the Internet is a function of the amount of data downloaded. This paper introduces an approach in which mobile devices, called peers, form an ad hoc network and share their downloaded content with others. As an example, spectators may want to collect/share information about players and game records in a stadium. In an art gallery, visitors may want to retrieve some background information about the displayed work from the nearby ad hoc network. In an outdoor class, a teacher may download today's topic files from the Internet, and all students may share the content with minimal or no cost paid. This is possible if mobile device has both a 3G interface and a wireless LAN interface. If the peers want to improve privacy md discourage traffic analysis when sharing content, this paper describes a low-delay anonymous connection between the sending peer and the receiving peer using two additional peers. Simulation results show that the transmission time overhead of the anonymous connection may increase 50% or less as the number of peers increase or the peers are scattered over the larger area.

• Journal of the Korea Society for Simulation
• /
• v.20 no.4
• /
• pp.105-114
• /
• 2011

The roadmap-based planning is a path planning method which is used widely for a goal-directed movement in Robotics and has been applied to the world of computer animation such as computer games. However it is unnatural for computer characters to follow the path planned by the roadmap method as it is performed in Robotics. Flocking which is used for realistic and natural movements in computer animation enables character's movement by using a few simple rules without planning unlike the roadmap method. However it is impossible to achieve a goal-directed movement with flocking only because it does not keep states. In this paper we propose a simulation method which combines planning based on the road map with reactive actions for natural movements along the path planned. We define and implement steering behaviors for a leader which are needed to follow the trajectory naturally by analysing characteristics of roadmap-based paths and for the rest of members which follow the leader in various manners by detecting obstacles. The simulations are performed and demonstrated by using the implemented steering behaviors on every possible combination of roadmap-based path planning methods and models of configuration spaces. We also show that the detection of obstacle-collisions can be done effectively because paths are planned in the configuration space in which a moving object is reduced to a point.

• The Journal of the Korea Contents Association
• /
• v.8 no.12
• /
• pp.198-206
• /
• 2008

The fashion in the virtual world is emerging as a new genre. Gammer in virtual community shares the avatars and space for their activities and for flourishing their virtual lives, they start to demand indispensable daily items. The gammer's demands lead to the concept of second life in the virtual world which was introduced in 2003. The trading business system is realized at the virtual world with various daily items, developed by individual programmers, through the virtual money, which may converted into real money. Particularly, fashion industry's inherent nature of snagging on-line trading is no more, now, set to ready in the virtual world let alone various daily virtual items developed by individual programmers. The purpose of this study is, focused on the virtual second life, to introduce the model of fashion business in virtual world and overall informations regarding second life business systems so as to provide the fundamental data for opening the web.3.0 era. Further various fashion items in the virtual world, developed by individual programers, will be another boost for shaping another virtual fashion business genre.

• Journal of The Korean Association of Information Education
• /
• v.12 no.3
• /
• pp.283-292
• /
• 2008

Computer Science Education has to be dynamically changed due to a change of information technology. This study aims to present the direction of development for computer science education according to compare a report of KEDI; Korean Educational Development Institute, twenty years ago with our latest investigation. In this research, nowadays the personal computer diffused at most home. Home is the main environment for students to use computer. Students demand new computing curricula and teaching method. The global tendency of computer science education focuses on the improvement of problem solving ability. According to our investigation, most students hope to learn the new computing skills through game-based learning. We present the unplugged teaching methods and simulation-based learning using EPL(Educational Program Langage). Of course it's important to be applied to school now. And it can be achieved just by national efforts alone.

• Journal of Digital Convergence
• /
• v.14 no.10
• /
• pp.339-348
• /
• 2016

The purpose of this study was to identify the Kolb's learning style and preference for instructional methods of undergraduate nursing students. Data were collected from 174 students at a university in D city using a structured questionnaire from October 19 to October 21 2015. Learning style ratio of nursing students was accommodator 34.5%, converger 33.9%, assimilator 16.1%, diverger 15.5% and preference scores for instructional methods were discussion 7.27, direct instruction 7.26, peer teaching 7.22, independent study 6.54, project 6.25, instruction through technology 5.77, game 5.45, simulation 4.23. A significant difference was found in experience of flipped learning between four learning styles groups of nursing students. However, there was no significant difference in the preference of instructional methods between the four learning styles groups. Most of the students were in the middle range of the learning styles. The assessment of nursing students' learning styles is expected to help educator to plan teaching strategies.

• Journal of Digital Convergence
• /
• v.13 no.6
• /
• pp.157-164
• /
• 2015

An efficient retrieval of useful information is a prerequisite of an optimal decision making system. Hence, A research of data mining techniques finding useful patterns from the various forms of data has been progressed with the increase of the application of Big Data for convergence and integration with other industries. Each technique is more likely to have its drawback so that the generalization of retrieving useful information is weak. Another integrated technique is essential for retrieving useful information. In this paper, a uncertainty measure of information is calculated such that algebraic probability is measured by Bayesian theory and then information entropy of the probability is measured. The proposed measure generates the effective reduct set (i.e., reduced set of necessary attributes) and formulating the core of the attribute set. Hence, the optimal decision rules are induced. Through simulation deciding contact lenses, the proposed approach is compared with the equivalence and value-reduct theories. As the result, the proposed is more general than the previous theories in useful decision-making.