Ant Colony Optimization algorithm (ACO) for finding optimal paths.

蚁群优化算法(ACO),用于寻找最优路径.

Features:

  • Finding an optimal path for actors in the scene;
  • Great for NPC’s patrolling path automation;
  • Editing path in the editor with WYSIWYG concept;
  • Adapting path to moving targets;
  • Multithreaded calculations will not freeze the game thread;
  • Included Automation tests will help you to modify the solver for your needs if you want to.

Number of Blueprints: 1

Number of C++ Classes: 6

Network Replicated: No

Supported Platforms: Win64

Documentation: Tutorial

Example Unreal Project (plugin is required): 4.26, 4.27, 5.0, 5.1

Notes: This plugin has limits on the size of the path it can solve. It was tested for 15 points with stable results.

特征:

  • 为场景中的actor找到最佳路径;
  • 非常适合NPC的巡逻路径自动化;
  • 使用所见即所得概念在编辑器中编辑路径;
  • 适应移动目标的路径;
  • 多线程计算不会冻结游戏线程;
  • 包含的自动化测试将帮助您根据需要修改求解器。

蓝图数目:1

C++类数：6

网络复制：没有

支持平台：Win64

文件: 教程

示例虚幻项目（需要插件）: 4.26, 4.27, 5.0, 5.1

注意：这个插件对它可以解决的路径的大小有限制。 对其进行了15分测试，结果稳定。










The ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Artificial ants stand for multi-agent methods inspired by the behavior of real ants. It helps to solve various tasks, including vehicle routing, internet routing [Wiki].

Finding an optimal path with brute force on the other hand would require a lot of computer power: (n-1)!/2 variant to compare, where n is the number of agents. For 15 points it would require to compare 43,589,145,600 paths.

With this plugin will be able to find the route for the same amount of points without notice.

Videos:

  • Finding an optimal path in changing environment using Ant Algorithm link;
  • How changing obstacles affects path, calculated using Ant Algorithm link;
  • Ant Algorithm in action for round objects on a moving platform: link;
  • Ant Algorithm represents Eiffel Tower made of different paths: link;
  • Ant Algorithm runtime path calculations for round objects link;
  • Drawing a path with Ant Algorithm using the editor in Unreal Engine 4 link.

蚁群优化算法（ACO）是一种概率技术，用于解决计算问题，可以简化为通过图找到良好的路径。 人工蚂蚁代表受真实蚂蚁行为启发的多代理方法。 它有助于解决各种任务，包括车辆路由，互联网路由[维基].

另一方面，用蛮力找到一条最佳路径需要大量的计算机能力：（n-1）！/2变体进行比较，其中n是代理的数量。 对于15点，需要比较43,589,145,600条路径。

有了这个插件将能够找到相同数量的点的路线，恕不另行通知。

短片:

  • 使用Ant算法在不断变化的环境中寻找最优路径 连结;
  • 改变障碍物如何影响路径，使用Ant算法计算 连结;
  • 移动平台上圆形物体的蚂蚁算法: 连结;
  • Ant算法表示由不同路径组成的埃菲尔铁塔: 连结;
  • 圆形对象的Ant算法运行时路径计算 连结;
  • 使用虚幻引擎4中的编辑器使用Ant算法绘制路径 连结.
声明：本站所有资源都是由站长从网络上收集而来，如若本站内容侵犯了原著者的合法权益，可联系站长删除。