GitHub

superstes/contrib-python-pathfinding

Dijkstra and A* take the weight of the fields on the map into account. If you are still using python 2 take a look at the (unmaintained) python2-branch. For usage examples with detailed descriptions ...
GitHub

A Python-based pathfinding visualizer that implements BFS, DFS, A, GBFS, Bidirectional, and Beam Search algorithms for solving grid-based robot navigation problems.

Visual grid exploration in GUI Loadable test cases from .txt files ...
IEEE

Applying Conflict-Based Search to Improve Pathfinding Efficiency in Multi-Agent Big Data Adventure Games

Abstract: The implementation of intelligent pathfinding algorithms is essential for improving gameplay experience and educational value in educational games. This study looks into applying ...
IEEE

Three Real-Time Pathfinding Strategies in Games: From A* Ideas to Machine Learning Approaches

Abstract: As the complexity of video games escalates, the presence of more agents, diverse game environments and richer game mechanisms are continuously drawing attention to real-time pathfinding ...