最快速的尋路算法Jump Point Search

{"type":"doc","content":[{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","marks":[{"type":"strong"}],"text":"導語"},{"type":"text","text":" | 本文介紹一種跳點搜索算法 JPS 以及其四個優化算法，其尋路速度最快可是 A*算法的 273 倍，希望與大家一同交流。文中的 JPS-Bit 和 JPS-BitPrune 都支持動態阻擋。文章作者：王傑，騰訊 TEG 後臺開發工程師。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"heading","attrs":{"align":null,"level":2},"content":[{"type":"text","text":"一、引言"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null},"content":[{"type":"text","text":"尋路算法用途衆多，例如在遊戲和地圖中。A*算法已經衆所周知，對於其優化也是層出不窮，然而性能並沒有取得突破性進展。本文介紹 JPS 的效率、多線程、內存、路徑優化算法。爲了測試搜索算法的優化性能，實驗中設置遊戲場景使得起點和終點差距 200 個格子，需要尋路 10000 次。"}]},{"type":"paragraph","attrs":{"indent":0,"number":0,"align":null,"origin":null}}]}