Dynamic Pathfinding for Non-Player Character Follower on Game

Artificial Intellegences in video game are important things that can challenge game player. One of them is creating character or NPC Follower (Non-player character Follower) inside the video game, such as real human/animal attitude. Artificial Intelligences have some techniques in which pathfinding is one of Artificial Intellegence techniques that is more popular in research than other techniques. The ability to do dynamic pathfinding is Dynamic Particle Chain (DPC) algorithm. This algorithm has the ability of flocking behavior called boid to explore the environment. But, the algoritm method moves from one boid’s point to another according to the nearest radius, then it will be able to increase computation time or needed time toward the target. To finish higher computation problem in dynamic pathfinding, the researcher suggests an algorithm that is able to handle dynamic pathfinding process through attractive potential field function of Artificial Potential Field to start pathfinding toward the target and flocking behavior technique to avoid the obstacle. Based on the test result by simulation of moving environment and complex, the computation time of algorithm is faster than comparison algorithms, DPC and Astar. It concludes that the suggested method can be used to decrease computation level in dynamic pathfinding.

Flocking dynamics of a coupled system in noisy environments

We investigate the effect of noise on the emergence of flocking in a coupled systems by constructing a second-order coupled dynamics model, in which the inter-subgroup interaction is affected by external interference and disturbances. Based on the principle of comparison, we derive sufficient conditions for flocking and non-flocking in terms of the noise intensity and system parameters. We report that the coupled population cannot aggregate if the noise is large, while under the premise of small noise, the flocking behavior will emerge. Moreover, we find form the simulation that appropriate noise can promote the generation of flocking.

The delayed Cucker-Smale model with short range communication weights

<p style='text-indent:20px;'>Various flocking results have been established for the delayed Cucker-Smale model, especially in the long range communication case. However, the short range communication case is more realistic due to the limited communication ability. In this case, the non-flocking behavior can be frequently observed in numerical simulations. Furthermore, it has potential applications in many practical situations, such as the opinion disagreement in society, fish flock breaking and so on. Therefore, we firstly consider the non-flocking behavior of the delayed Cucker<inline-formula><tex-math id="M2">\begin{document}$ - $\end{document}</tex-math></inline-formula>Smale model. Based on a key inequality of position variance, a simple sufficient condition of the initial data to the non-flocking behavior is established. Then, for general communication weights we obtain a flocking result, which also depends upon the initial data in the short range communication case. Finally, with no restriction on the initial data we further establish other large time behavior of classical solutions.</p>

Flocking Behavior of Cucker–Smale Model with Processing Delay

The dynamics of a delay multiparticle swarm, which contains symmetric and asymmetric pairwise influence functions, are analyzed. Two different sufficient conditions to achieve conditional flocking are obtained. One does not have a clear relationship with this delay, and the other proposes a range of processing delays that affect the emergence of a flock. It is also pointed out that if the interparticle communication function has tail dissipation, unconditional flocking can be guaranteed. Compared with the previous results, the range of the communication rate β that allows a flock to emerge has been expanded from 1/4 to 1/2.