😊 Welcome to the Space-time A* Algorithm Project, an advanced iteration of the classic A* pathfinding algorithm tailored for complex, multi-dimensional navigation challenges. This project extends the traditional A* algorithm into the space-time continuum, enabling the consideration of both spatial and temporal dimensions for dynamic and efficient route planning.
Currently, this algorithm is implemented in a task assignment model for a multi-AGV based intelligent logistics sorting system, aiming to calculate the optimal delivery positions for goods sorting. I will further optimize the iteration 🤔
Gird Size: 10*8
num_entrances(exits): 6
num_delivers: 4
task_num: 50
time_step: 8
Gird Size: 28*32
num_entrances(exits): 22
num_delivers: 80
task_num: 80
time_step: 200
