Sökning: "Jonathan Helsing"
Hittade 1 uppsats innehållade orden Jonathan Helsing.
1. A Scalability and Performance Evaluation of Precomputed Flow FieldMaps for Multi-Agent Pathfinding
Kandidat-uppsats, Blekinge Tekniska Högskola/Institutionen för datavetenskapSammanfattning : Background. The A* algorithm is a well-established pathfinding technique frequently used in video game development. However, a disadvantage of the A* algorithm is that it becomes computationally inefficient and impractical to utilize whenthousands of agents demand an optimal path. LÄS MER
Resultatsidor:
1