TY - JOUR AU - Brož, Petr AU - Kolingerová, Ivana AU - Szkandera, Jakub AU - Zemek, Michal PY - 2014/12/14 Y2 - 2024/03/29 TI - Dynamic Path Planning with Regular Triangulations JF - Machine Graphics and Vision JA - MG&V VL - 23 IS - 3/4 SE - Original research papers DO - 10.22630/MGV.2014.23.3.6 UR - https://mgv.sggw.edu.pl/article/view/2991 SP - 119-142 AB - Path planning is a well known problem that has been extensively studied in many scientific disciplines. In general, it defines a task of finding a path between two given spots in an abstract environment so that the path satisfies certain criterion of optimality. Although there are many methods solving this objective, they usually assume the examined space does not change in runtime. Modern applications, however, do not have to meet these requirements, especially in case of virtual reality or computer games. Therefore, we propose a general model for real-time path planning in dynamic environment where the obstacles can nondeterministically appear, disappear, change the position, orientation or even shape. The model uses a triangulation for dynamic space subdivision among bounding spheres of the obstacles and a heuristic algorithm to repair an already found path after any change of the scene. The presented solution is the first one using regular triangulation. At the price of the suboptimal result, it provides an efficient and fast way to plan a path with the maximal clearance among the moving and changing obstacles. In comparison to raster based techniques and methods using the Delaunay triangulation (Voronoi diagram), it requires less time to preprocess and generates paths with a larger clearance. ER -