官术网_书友最值得收藏!

Chapter 2. Navigation

In this chapter, we will cover the following recipes:

  • Representing the world with grids
  • Representing the world with Dirichlet domains
  • Representing the world with points of visibility
  • Representing the world with a self-made navigation mesh
  • Finding your way out of a maze with DFS
  • Finding the shortest path in a grid with BFS
  • Finding the shortest path with Dijkstra
  • Finding the best-promising path with A*
  • Improving A* for memory: IDA*
  • Planning navigation in several frames: time-sliced search
  • Smoothing a path
主站蜘蛛池模板: 潞西市| 江都市| 苗栗市| 安陆市| 九江市| 青阳县| 嘉黎县| 万盛区| 鲁山县| 仪征市| 礼泉县| 江西省| 安平县| 江油市| 濉溪县| 合阳县| 夏津县| 古浪县| 汝州市| 张掖市| 友谊县| 肇庆市| 肥乡县| 栾川县| 三门峡市| 读书| 田东县| 屏东市| 宣城市| 蛟河市| 建湖县| 保靖县| 德令哈市| 华安县| 新野县| 三亚市| 丰宁| 广宁县| 肥西县| 九台市| 瓮安县|