A comprehensive solution for pathfinding in K-dimensions.
The CHDR project aims to be the fastest and most efficient pathfinding library available.
CHDR provides a user-friendly API with ultra-low latency, minimal memory usage, and high-performance implementations of cutting-edge algorithms widely used in Robotics, Game Development, GNSS Navigation, Artificial Intelligence, and other high-performance applications.
Its flexible design ensures compatibility across numerous platforms, compilers, and toolchains. Offered as a lightweight, header-only C++17 library with a modular, standards-compliant architecture, CHDR compiles seamlessly under strict conditions and has passed rigorous testing with tools like Valgrind and Google's Sanitizers.
By leveraging advanced metaprogramming techniques, CHDR strikes the perfect balance between usability and performance. It supports efficient routing in 1D, 2D, 3D, 4D, and even higher-dimensional spaces, making it an ideal choice for developers seeking fast and reliable pathfinding solutions.
For full guides, example implementations, and step-by-step tutorials on how to use the library effectively, please refer to the manual.
If you encounter any issues or have suggestions for improvements, feel free to post them in the project's issue tracker. Your feedback helps us make CHDR better for the entire community. At this time, please note that derivative works or modifications to the library are not permitted under the current license agreement. Refer to the license section for more information.
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
CHDR is currently licensed under CC BY-NC-ND 4.0. Please refer to the license documentation for exact details. For permission regarding use in commercial or derivative works, please contact the developers.
Reinefeld, A. and Marsland, T. A., 1994. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16 (7), 701–710. Available at https://doi.org/10.1109/34.297950. [Accessed 3 Oct. 2024].