首页 游戏开发 其他     /    jpsplus+goalbounding寻路算法

jpsplus+goalbounding寻路算法

上传者: i_mckellen | 上传时间:2023/5/5 2:30:31 | 文件大小:44.32MB | 文件类型:zip
jpsplus+goalbounding寻路算法
听说被A*快100倍的寻路算法,2015年提出。
jpsplus是在jps算法底子上对于舆图做了预处置,记实了一些跳点信息,减速探究下一个跳点的速率;
goalbinding做了另一些预处置,记实一些倾向信息,防止往差迟倾向上探究跳点。
附上一个mfc实现jps+算法的demo

文件下载

资源详情

[{"title":"(55个子文件44.32MB)jpsplus+goalbounding寻路算法","children":[{"title":"JPSPlusWithGoalBounding-master","children":[{"title":".gitattributes <span style='color:#111;'>378B</span>","children":null,"spread":false},{"title":"JPSPlusGoalBounding","children":[{"title":"JPSPlusGoalBounding.sln <span style='color:#111;'>884B</span>","children":null,"spread":false},{"title":"Entry.cpp <span style='color:#111;'>3.00KB</span>","children":null,"spread":false},{"title":"Map.h <span style='color:#111;'>3.89KB</span>","children":null,"spread":false},{"title":"JPSPlus.h <span style='color:#111;'>8.75KB</span>","children":null,"spread":false},{"title":"Map.cpp <span style='color:#111;'>9.67KB</span>","children":null,"spread":false},{"title":"GenericHeap.h <span style='color:#111;'>8.54KB</span>","children":null,"spread":false},{"title":"BucketPriorityQueue.h <span style='color:#111;'>3.38KB</span>","children":null,"spread":false},{"title":"FPUtil.cpp <span style='color:#111;'>1.59KB</span>","children":null,"spread":false},{"title":"UnsortedPriorityQueue.h <span style='color:#111;'>2.92KB</span>","children":null,"spread":false},{"title":"JPSPlusGoalBounding.vcxproj <span style='color:#111;'>5.60KB</span>","children":null,"spread":false},{"title":"SimpleUnsortedPriorityQueue.cpp <span style='color:#111;'>2.77KB</span>","children":null,"spread":false},{"title":"PrecomputeMap.cpp <span style='color:#111;'>17.65KB</span>","children":null,"spread":false},{"title":"stdafx.h <span style='color:#111;'>305B</span>","children":null,"spread":false},{"title":"FPUtil.h <span style='color:#111;'>2.25KB</span>","children":null,"spread":false},{"title":"ScenarioLoader.h <span style='color:#111;'>1.87KB</span>","children":null,"spread":false},{"title":"FastStack.h <span style='color:#111;'>2.96KB</span>","children":null,"spread":false},{"title":"ScenarioLoader.cpp <span style='color:#111;'>1.73KB</span>","children":null,"spread":false},{"title":"Cases.h <span style='color:#111;'>19.41KB</span>","children":null,"spread":false},{"title":"FastStack.cpp <span style='color:#111;'>2.14KB</span>","children":null,"spread":false},{"title":"main.cpp <span style='color:#111;'>6.79KB</span>","children":null,"spread":false},{"title":"Maps","children":[{"title":"random-100-33.map <span style='color:#111;'>9.90KB</span>","children":null,"spread":false},{"title":"maze-100-1.map <span style='color:#111;'>9.90KB</span>","children":null,"spread":false},{"title":"maze-100-1.map.pre <span style='color:#111;'>214.79KB</span>","children":null,"spread":false},{"title":"room-100-10.map.scen <span style='color:#111;'>18.95KB</span>","children":null,"spread":false},{"title":"room-100-10.map <span style='color:#111;'>9.90KB</span>","children":null,"spread":false},{"title":"random-100-33.map.scen <span style='color:#111;'>23.07KB</span>","children":null,"spread":false},{"title":"random-100-33.map.pre <span style='color:#111;'>346.17KB</span>","children":null,"spread":false},{"title":"room-100-10.map.pre <span style='color:#111;'>580.50KB</span>","children":null,"spread":false},{"title":"maze-100-1.map.scen <span style='color:#111;'>99.87KB</span>","children":null,"spread":false}],"spread":false},{"title":"JPSPlus.cpp <span style='color:#111;'>27.47KB</span>","children":null,"spread":false},{"title":"stdafx.cpp <span style='color:#111;'>298B</span>","children":null,"spread":false},{"title":"GenericHeap.cpp <span style='color:#111;'>1.60KB</span>","children":null,"spread":false},{"title":"JPSPlusGoalBounding.suo <span style='color:#111;'>57.00KB</span>","children":null,"spread":false},{"title":"PrecomputeMap.h <span style='color:#111;'>3.75KB</span>","children":null,"spread":false},{"title":"BucketPriorityQueue.cpp <span style='color:#111;'>4.51KB</span>","children":null,"spread":false},{"title":"UnsortedPriorityQueue.cpp <span style='color:#111;'>4.08KB</span>","children":null,"spread":false},{"title":"SimpleUnsortedPriorityQueue.h <span style='color:#111;'>2.89KB</span>","children":null,"spread":false},{"title":"DijkstraFloodfill.h <span style='color:#111;'>8.33KB</span>","children":null,"spread":false},{"title":"Timer.cpp <span style='color:#111;'>1.33KB</span>","children":null,"spread":false},{"title":"JPSPlusGoalBounding.sln.docstates.suo <span style='color:#111;'>8.01KB</span>","children":null,"spread":false},{"title":"targetver.h <span style='color:#111;'>306B</span>","children":null,"spread":false},{"title":"DijkstraFloodfill.cpp <span style='color:#111;'>19.83KB</span>","children":null,"spread":false},{"title":"PathfindingNode.h <span style='color:#111;'>2.87KB</span>","children":null,"spread":false},{"title":"Timer.h <span style='color:#111;'>1.34KB</span>","children":null,"spread":false},{"title":"Entry.h <span style='color:#111;'>2.42KB</span>","children":null,"spread":false}],"spread":false},{"title":"Path_Finding.rar <span style='color:#111;'>3.93MB</span>","children":null,"spread":false},{"title":"Rabin_AISummitGDC2015_JPSPlusWithGoalBounding.pptx <span style='color:#111;'>44.00MB</span>","children":null,"spread":false},{"title":"README.md <span style='color:#111;'>3.42KB</span>","children":null,"spread":false},{"title":"GenerateCases","children":[{"title":"GenerateCases.suo <span style='color:#111;'>17.00KB</span>","children":null,"spread":false},{"title":"GenerateCases","children":[{"title":"Program.cs <span style='color:#111;'>13.33KB</span>","children":null,"spread":false},{"title":"Properties","children":[{"title":"AssemblyInfo.cs <span style='color:#111;'>1.37KB</span>","children":null,"spread":false}],"spread":true},{"title":"GenerateCases.csproj <span style='color:#111;'>2.33KB</span>","children":null,"spread":false}],"spread":true},{"title":"GenerateCases.sln <span style='color:#111;'>861B</span>","children":null,"spread":false}],"spread":true},{"title":".gitignore <span style='color:#111;'>574B</span>","children":null,"spread":false}],"spread":true}],"spread":true}]

评论信息

免责申明

【好快吧下载】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【好快吧下载】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【好快吧下载】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,8686821#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明