We propose a new hierarchical path finding solution for large environments. We use a navigation mesh as abstract data structure to partition the 3D world. Then, we build a hierarchy of graphs that allow us to perform faster path finding calculations than a common A*.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com