Zoky's repositories
mapf_visualizer
A MAPF Algorithm Visualizer
AA-SIPP-m
Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allowed to follow any-angle path on the grid). Timeline is continuous, i.e. action durations are not explicitly discretized into timesteps. Different agents' size and moving speed are supported. Planning is carried out in (x, y, \theta) configuration space, i.e. agents' orientation are taken into account.
Continuous-CBS
Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Timeline is not discretized, i.e. is continuous.
MAPF
Multi-Agent Path Finding in C++ (WHCA*, iWHCA*, WCBS)
Programming-Game-AI-by-Example-src
The source code of "Programming Game AI by Example"
zhuqinghe.github.io
Hezhuqing, College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China
zjuthesis
Zhejiang University Graduation Thesis/Design LaTeX template.