ECS 驱动的大规模群体行为 (Boids) 算法与碰撞避让在即时战略RTS、大规模战争模拟以及开放世界鸟群/鱼群生态系统中同屏数千至数万个个体的群体动态模拟Flocking Simulation是常见的性能吞吐瓶颈。传统的面向对象OOP架构在处理 2,000 个带 Collider 和 Rigidbody 的 GameObject 时CPU 主线程往往因Transform的频繁变动、虚函数调用以及无序内存访问Cache Miss导致帧率断崖式下跌。基于面向数据设计Data-Oriented Technology Stack, DOTS的 ECS 架构结合 Burst 编译器与空间哈希网格Spatial Hash Grid可以将群体行为的近邻搜索复杂度从暴力遍历的 $O(N^2)$ 降低至 $O(N)$从而在移动端稳定维持万级个体的 60fps 流畅模拟。Boids 三大核心法则与避障拓展Craig Reynolds 经典 Boids 模型由三大经典向量叠加驱动分离 (Separation)与感知半径内的邻居保持安全距离反方向排斥以避免重叠。对齐 (Alignment)向邻居个体的平均朝向/速度向量对齐保持群体移动步调一致。凝聚 (Cohesion)向感知半径内所有邻居的几何质心靠拢维系群体的聚集形态。在此基础上实际工程中必须引入障碍物与边界避让 (Obstacle Avoidance)。通常使用视线探测射线Raycast/Spherecast或预先构建的距离场SDF生成高优先级的排斥推力。空间哈希Spatial Hash Grid与 ECS 数据布局如果每个个体都遍历全场所有单位10,000 个个体单帧需要进行 $10^8$ 次距离判定即使 SIMD 指令集也无法承受。通过将 3D 世界划分为离散网格单元个体只需查询所在网格及其相邻 26 个单元格中的实体。在 Unity Entities 中我们定义无托管组件IComponentDatausing Unity.Entities; using Unity.Mathematics; public struct BoidUnit : IComponentData { public float3 Velocity; public float3 Acceleration; public float MaxSpeed; public float NeighborRadius; public float SeparationRadius; public float WeightSeparation; public float WeightAlignment; public float WeightCohesion; public float WeightAvoidance; } public struct SpatialHashCell : IComponentData { public int CellIndex; }Burst 并行计算系统实现以下是基于 Unity Job System 与 Burst 编译器的并行处理系统。通过在单帧开始前构建NativeParallelMultiHashMapint, BoidData在 Job 内部实现无锁并行读取与近邻聚合using Unity.Burst; using Unity.Collections; using Unity.Entities; using Unity.Jobs; using Unity.Mathematics; using Unity.Transforms; [BurstCompile] public partial struct BoidFlockingSystem : ISystem { private struct BoidSpatialData { public Entity Entity; public float3 Position; public float3 Velocity; } private NativeParallelMultiHashMapint, BoidSpatialData spatialMap; private const float CellSize 4.0f; [BurstCompile] private static int GetCellHash(float3 position) { int3 gridPos (int3)math.floor(position / CellSize); // 使用质数哈希组合三维网格索引 return (gridPos.x * 73856093) ^ (gridPos.y * 19349663) ^ (gridPos.z * 83492791); } [BurstCompile] public void OnCreate(ref SystemState state) { spatialMap new NativeParallelMultiHashMapint, BoidSpatialData(65536, Allocator.Persistent); } [BurstCompile] public void OnDestroy(ref SystemState state) { if (spatialMap.IsCreated) spatialMap.Dispose(); } [BurstCompile] public void OnUpdate(ref SystemState state) { spatialMap.Clear(); // 阶段一并行收集所有 Boid 个体位置至 Spatial Hash var boidCount SystemAPI.QueryBuilder().WithAllBoidUnit, LocalTransform().Build().CalculateEntityCount(); if (spatialMap.Capacity boidCount) { spatialMap.Capacity math.max(spatialMap.Capacity * 2, boidCount); } var buildMapJob new BuildSpatialMapJob { SpatialMapWriter spatialMap.AsParallelWriter() }; state.Dependency buildMapJob.ScheduleParallel(state.Dependency); // 阶段二并行计算 Boids 行为法则与运动学更新 var updateFlockJob new UpdateBoidFlockJob { SpatialMap spatialMap, DeltaTime SystemAPI.Time.DeltaTime }; state.Dependency updateFlockJob.ScheduleParallel(state.Dependency); } [BurstCompile] public partial struct BuildSpatialMapJob : IJobEntity { public NativeParallelMultiHashMapint, BoidSpatialData.ParallelWriter SpatialMapWriter; private void Execute(Entity entity, in LocalTransform transform, in BoidUnit boid) { int hash GetCellHash(transform.Position); SpatialMapWriter.Add(hash, new BoidSpatialData { Entity entity, Position transform.Position, Velocity boid.Velocity }); } } [BurstCompile] public partial struct UpdateBoidFlockJob : IJobEntity { [ReadOnly] public NativeParallelMultiHashMapint, BoidSpatialData SpatialMap; public float DeltaTime; private void Execute(Entity entity, ref LocalTransform transform, ref BoidUnit boid) { float3 currentPos transform.Position; float3 currentVel boid.Velocity; float3 separationForce float3.zero; float3 alignmentForce float3.zero; float3 cohesionPosSum float3.zero; int neighborCount 0; int separationCount 0; int3 centerGrid (int3)math.floor(currentPos / CellSize); // 检索相邻 3x3x3 空间格 for (int x -1; x 1; x) { for (int y -1; y 1; y) { for (int z -1; z 1; z) { int hash ((centerGrid.x x) * 73856093) ^ ((centerGrid.y y) * 19349663) ^ ((centerGrid.z z) * 83492791); if (SpatialMap.TryGetFirstValue(hash, out BoidSpatialData neighbor, out var iterator)) { do { if (neighbor.Entity entity) continue; float3 offset neighbor.Position - currentPos; float distSq math.lengthsq(offset); if (distSq boid.NeighborRadius * boid.NeighborRadius) { float dist math.sqrt(distSq); if (dist 0.001f) continue; // 凝聚与对齐累加 cohesionPosSum neighbor.Position; alignmentForce neighbor.Velocity; neighborCount; // 分离累加反距离加权 if (dist boid.SeparationRadius) { separationForce - (offset / dist) * (1.0f - dist / boid.SeparationRadius); separationCount; } } } while (SpatialMap.TryGetNextValue(out neighbor, ref iterator)); } } } } float3 totalSteering float3.zero; if (neighborCount 0) { // 计算凝聚力 float3 centerOfMass cohesionPosSum / neighborCount; float3 cohesionDir math.normalize(centerOfMass - currentPos); totalSteering cohesionDir * boid.WeightCohesion; // 计算对齐力 float3 avgVelocity alignmentForce / neighborCount; totalSteering math.normalize(avgVelocity) * boid.WeightAlignment; } if (separationCount 0) { totalSteering math.normalize(separationForce) * boid.WeightSeparation; } // 更新物理状态 boid.Velocity totalSteering * DeltaTime; float speed math.length(boid.Velocity); if (speed boid.MaxSpeed) { boid.Velocity (boid.Velocity / speed) * boid.MaxSpeed; } transform.Position boid.Velocity * DeltaTime; if (speed 0.01f) { transform.Rotation quaternion.LookRotationSafe(math.normalize(boid.Velocity), math.up()); } } } }性能调优要点与工程避坑网格尺寸选择CellSizeCellSize 必须严格与NeighborRadius保持匹配。如果网格过小邻域遍历开销会剧增如果网格过大单格内的候选单位过多退化为局部 $O(N^2)$。经验法则是将CellSize设为NeighborRadius的 1.0~1.2 倍。内存连续性与 SOA 转换在 Entities 架构下LocalTransform与自定义数据被紧凑地存放在 16KB 的 Chunk 中。Burst 能够对向量距离计算生成极高效的 AVX2 / NEON 矢量化指令。平滑转向阻尼避免直接将转向力累加至位置必须通过限制角速度或加速度Steering Acceleration Clamp进行物理积分否则在群体密度剧增时会出现高频剧烈抖动。