Knowledge-Based Probability Maps for Covert Pathfinding

摘要: Virtual characters in computer games sometimes need to find a path from point A B while minimizing the risk of being spotted by an enemy. Visibility calculations environment are needed accomplish this. While previous methods have focused on either general visibility or based only current enemy positions, we suggest method incorporate agent's knowledge positions. By creating probability distribution positions enemies and using this calculation, create more accurate map.