• Korean Journal of Computational Design and Engineering
• /
• v.10 no.5
• /
• pp.339-348
• /
• 2005

In this paper, LOD (Level Of Detail) for flocking, which is the real-time simulation on the movement or some groups such as fighting soldiers, moving fishes and flying birds, is presented. And a flocking LOD algorithm that uses factors such as the speed of fish, direction, and shape is proposed. Model data is modified for LOD in advance, so as to reduce strange edge collapse and unwanted holes. The errors of model data were identified by transforming polygonal model into octree-based cubes and revised before rendering. Experimental results show that the proposed algorithm considering flocking characteristics shows fast frame rates as compared with the conventional continuous LOD algorithm.

• Journal of the Korea Society for Simulation
• /
• v.18 no.4
• /
• pp.49-58
• /
• 2009

Top-down approach in the intelligent robot research has focused on the single object intelligence however, it has two weaknesses. One is that has a high cost and a long spending time of sensing, calculating and communications. The other is the difficulty of responding to react changes in the unpredictable environment. we propose the collective intelligence algorithm based on Bottom-up approach for improving these weaknesses and the applied agent model and verify by simulation. The Modified Flocking Algorithm proposed in this research is the algorithm which is modified version of the concept of the Flocking (Craig Reynolds) which is used to model the flocks, herds, and schools in the graphics or games, and simplified the operation of conventional Flocking algorithm to make it easy to apply for the number of group robots. We modeled the Boid agent and verified possibility collectivization of the Modified Flocking Algorithm by simulation. And We validated by the actual multiple mobile robot experiment.

• Journal of Korea Game Society
• /
• v.10 no.5
• /
• pp.95-102
• /
• 2010

This paper proposes a parallel algorithm of the flocking behaviors using GPU. To do this, we used CUDA as the parallel processing architecture of GPU and then analyzed its characteristics and constraints. Based on them, the paper improved the performance by parallelizing to find the neighbors for an agent which requires the largest cost in the flocking behaviors. We implemented the proposed algorithm on GTX 285 GPU and compared experimentally its performance with the original spatial partitioning method. The results of the comparison showed that the proposed algorithm outperformed the original method up to 9 times with respect to the execution time.

• Journal of Korea Game Society
• /
• v.11 no.5
• /
• pp.23-30
• /
• 2011

Flocking behaviors are frequently used in games and computer graphics for realistic simulation of massive crowds. Since simulation of massive crowds in real time is a computationally intensive task, there were many researches on efficient algorithm. In this paper, we find experimentally the fact that there are unnecessary computations in the previous efficient flocking algorithm, and propose a noble algorithm that overcomes the weakness of the previous algorithm with a simple heuristic. A number of experiments were conducted to evaluate the performance of the proposed algorithm. The experimental results showed that the proposed algorithm outperformed the previous efficient algorithm by about 21% on average.

• Journal of Advanced Navigation Technology
• /
• v.21 no.6
• /
• pp.521-528
• /
• 2017

Research on AI is essential to build a system with collective intelligence that allows a large number of UAVs to maintain their flight while carrying out various missions. A typical approach of AI includes 'top-down' approach, which is a rule-based logic reasoning method including expert system, and 'bottom-up approach' in which overall behavior is determined through partial interaction between simple objects such as artificial neural network and Flocking Algorithm. In the same study as the existing Flocking Algorithm, individuals can not perform individual tasks. In addition, studies such as UAV formation flight can not flexibly cope with problems caused by partial flight defects. In this paper, we propose organic integration between top - down approach and bottom - up approach through multi - agent system, and suggest a flight flight algorithm which can perform flexible mission through it.

• Journal of Korea Multimedia Society
• /
• v.13 no.5
• /
• pp.763-770
• /
• 2010

This paper proposes an algorithm to enhance the performance of the spatial partitioning method for a flocking behavior. One of the characteristics in a flocking behavior is that two agents may share many common neighbors if they are spatially close to each other. This paper improves the spatial partitioning method by applying this characteristic. While the conventional spatial partitioning method computes the k-nearest neighbors of an agent one by one, the proposed method computes simultaneously the k-nearest neighbors of agents if they are spatially close to each other. The proposed algorithm was implemented and its performance was experimentally compared with the original spatial partitioning method. The results of the comparison showed that the proposed algorithm outperformed the original method by about 33% in average.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2013.07a
• /
• pp.293-294
• /
• 2013

다양한 생물체의 행동 원리를 이용하여 모델링한 알고리즘을 생체모방 알고리즘(Biologically Inspired Algorithm)이라고 한다. 본 논문에서는 생체모방 알고리즘 중 동물 집단의 행동을 모델링한 플로킹 알고리즘(Flocking Algorithm)을 이용한 집단 게임 캐릭터의 길찾기 방법을 제안한다. 플로킹 알고리즘의 조타행동은 크게 분리(Separation), 정렬(Alignment), 응집(Cohesion), 회피(Avoidance)로 구성되어 있다. 게임에서의 기존 플로킹 알고리즘은 주로 여러 개의 몬스터나 NPC 들로 구성된 몇 개의 그룹 단위로 독자적인 집단 행동을 하는 경우에 적합하다. 그러나, 게임플레이어가 제어하는 캐릭터가 많은 경우, 기존 알고리즘은 플레이어가 선택한 캐릭터 그룹을 목표지점으로 이동하는 방법으로 적합하지 않다. 따라서 본 논문에서는 게임 플레이어가 제어하는 집단 게임캐릭터의 목표 지점까지의 길찾기를 위한 수정된 정렬 조타행동 알고리즘을 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.10
• /
• pp.1873-1880
• /
• 2016

Most of the energy used to operate a cellular network is consumed by a base station (BS), and reducing the transmission power of a BS is required for energy-efficient cellular networks. In this paper, a distributed transmit power control (TPC) algorithm is proposed based on the flocking model to improve the energy efficiency of a cellular network. Just as each bird in a flock attempts to match its velocity with the average velocity of adjacent birds, in the proposed algorithm each mobile station (MS) in a cell matches its rate with the average rate of the co-channel MSs in adjacent cells by controlling the transmit power of its serving BS. Simulation results show that the proposed TPC algorithm follows the same convergence properties as the flocking model and also effectively reduces the power consumption at the BSs while maintaining a low outage probability as the inter-cell interference increases. Consequently, it significantly improves the energy efficiency of a cellular network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.10
• /
• pp.1186-1189
• /
• 2016

A distributed uplink power control algorithm based on flocking model is proposed to improve the energy efficiency of mobiles station (MS) in cellular networks. As each bird in a flock matches its velocity with the average velocity of the adjacent birds, each MS in a cell matches its uplink rate with the average uplink rate of the co-channel MSs in adjacent cells by controlling its transmission power. Results show that the proposed algorithm effectively reduces the power consumption in the MS, while maintaining a low outage probability, which eventually improves the energy efficiency of the MS.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.1-9
• /
• 2010

In this paper, advanced evacuation analysis simulation on a passenger ship is performed. Velocity based model has been implemented and used to calculate the movement of the individual passengers under the evacuation situation. The age and gender of each passenger are considered as the factors of walking speed. Flocking algorithm is applied for the passenger's group behavior. Penalty walking velocity is introduced to avoid collision between the passengers and obstacles, and to prevent the position overlap among passengers. Application of flocking algorithm and penalty walking velocity to evacuation simulation is verified through implementation of the 11 test problems in IMO (International Maritime Organization) MSC (Maritime Safety Committee) Circulation 1238.