Skip to content

docs: improve README #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
webbrain-one wants to merge 1 commit into
base: master
Choose a base branch
from
Open

docs: improve README #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 3 additions & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,5 @@


# SLG寻路算法(jps+路径平滑)
本项目是专门为SLG大地图优化设计的寻路算法
![](./review.png)
Expand All @@ -10,5 +12,5 @@ A*算法的最坏情况是，两个不相通的区域之间的寻路，即使这
# 本算法针对A*进行了以下改进
+ 使用jps跳点算法加速A*的遍历速度
+ 对地图进行了全量分区以及动态分区(主要解决SLG玩家摆建筑堵路造成的A*的最坏情况)
+ 对A*输出的路点做平滑处理(就是点与点之间尽量走直线，不按格子走)
+ 对A*输出的路点做平滑处理(点与点之间尽量走直线，不按格子走；默认平滑整条路径，可通过传入参数指定参与平滑的路点数量)
+ 在lua层添加了传送点的支持(其实就是SLG游戏中州与州之间的关隘)，相当于在区域之间再做了更上一层的图的结构，解决SLG超大地图超远距离间的寻路问题