UE商城素材 Ant Colony Optimisation Algorithm 蚁群优化算法

蚁群优化算法(ACO)是一种解决计算问题的概率技术，计算问题可以简化为通过图寻找好的路径。人造蚂蚁代表多智能体方法，灵感来自真实蚂蚁的行为。它有助于解决各种任务，包括车辆路由，互联网路由[维基]。
另一方面，用蛮力寻找最优路径需要大量的计算机能力:(n-1)！要比较的/2变量，其中n是代理的数量。对于15个点，需要比较43，589，145，600条路径。
用这个插件将能够找到相同数量的点没有通知的路线。
Ant Colony Optimisation Algorithm (4.26-4.27, 5.0) 寻找最优路径的蚁群优化算法。


技术细节
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 Project: 4.26, 4.27, 5.0

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