Plánování cest virtuálních agentů

Abstract

This thesis is focused on possibilities of taking advantage of path-planning methods and agent navigation in virtual world with the use of Boundary-Value Problem and their acceleration on modern GPU. This thesis is covering basic principles and numerical methods from area of path-planning with the use of Boundary-Value Problem applied in 2D space and possible way to extend these methods for path-planning in 3D space. The basic benefits of path-planning with the use of Boundary-Value Problem are outlined, as well as some disadvantages associated with these methods, including the possible ways of solution.