class_astar.rst 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475
  1. :github_url: hide
  2. .. DO NOT EDIT THIS FILE!!!
  3. .. Generated automatically from Godot engine sources.
  4. .. Generator: https://github.com/godotengine/godot/tree/3.6/doc/tools/make_rst.py.
  5. .. XML source: https://github.com/godotengine/godot/tree/3.6/doc/classes/AStar.xml.
  6. .. _class_AStar:
  7. AStar
  8. =====
  9. **Inherits:** :ref:`Reference<class_Reference>` **<** :ref:`Object<class_Object>`
  10. An implementation of A\* to find the shortest paths among connected points in space.
  11. .. rst-class:: classref-introduction-group
  12. Description
  13. -----------
  14. A\* (A star) is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting short paths among vertices (points), passing through a given set of edges (segments). It enjoys widespread use due to its performance and accuracy. Godot's A\* implementation uses points in three-dimensional space and Euclidean distances by default.
  15. You must add points manually with :ref:`add_point<class_AStar_method_add_point>` and create segments manually with :ref:`connect_points<class_AStar_method_connect_points>`. Then you can test if there is a path between two points with the :ref:`are_points_connected<class_AStar_method_are_points_connected>` function, get a path containing indices by :ref:`get_id_path<class_AStar_method_get_id_path>`, or one containing actual coordinates with :ref:`get_point_path<class_AStar_method_get_point_path>`.
  16. It is also possible to use non-Euclidean distances. To do so, create a class that extends ``AStar`` and override methods :ref:`_compute_cost<class_AStar_method__compute_cost>` and :ref:`_estimate_cost<class_AStar_method__estimate_cost>`. Both take two indices and return a length, as is shown in the following example.
  17. ::
  18. class MyAStar:
  19. extends AStar
  20. func _compute_cost(u, v):
  21. return abs(u - v)
  22. func _estimate_cost(u, v):
  23. return min(0, abs(u - v) - 1)
  24. \ :ref:`_estimate_cost<class_AStar_method__estimate_cost>` should return a lower bound of the distance, i.e. ``_estimate_cost(u, v) <= _compute_cost(u, v)``. This serves as a hint to the algorithm because the custom ``_compute_cost`` might be computation-heavy. If this is not the case, make :ref:`_estimate_cost<class_AStar_method__estimate_cost>` return the same value as :ref:`_compute_cost<class_AStar_method__compute_cost>` to provide the algorithm with the most accurate information.
  25. If the default :ref:`_estimate_cost<class_AStar_method__estimate_cost>` and :ref:`_compute_cost<class_AStar_method__compute_cost>` methods are used, or if the supplied :ref:`_estimate_cost<class_AStar_method__estimate_cost>` method returns a lower bound of the cost, then the paths returned by A\* will be the lowest-cost paths. Here, the cost of a path equals the sum of the :ref:`_compute_cost<class_AStar_method__compute_cost>` results of all segments in the path multiplied by the ``weight_scale``\ s of the endpoints of the respective segments. If the default methods are used and the ``weight_scale``\ s of all points are set to ``1.0``, then this equals the sum of Euclidean distances of all segments in the path.
  26. .. rst-class:: classref-reftable-group
  27. Methods
  28. -------
  29. .. table::
  30. :widths: auto
  31. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  32. | :ref:`float<class_float>` | :ref:`_compute_cost<class_AStar_method__compute_cost>` **(** :ref:`int<class_int>` from_id, :ref:`int<class_int>` to_id **)** |virtual| |
  33. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  34. | :ref:`float<class_float>` | :ref:`_estimate_cost<class_AStar_method__estimate_cost>` **(** :ref:`int<class_int>` from_id, :ref:`int<class_int>` to_id **)** |virtual| |
  35. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  36. | void | :ref:`add_point<class_AStar_method_add_point>` **(** :ref:`int<class_int>` id, :ref:`Vector3<class_Vector3>` position, :ref:`float<class_float>` weight_scale=1.0 **)** |
  37. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  38. | :ref:`bool<class_bool>` | :ref:`are_points_connected<class_AStar_method_are_points_connected>` **(** :ref:`int<class_int>` id, :ref:`int<class_int>` to_id, :ref:`bool<class_bool>` bidirectional=true **)** |const| |
  39. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  40. | void | :ref:`clear<class_AStar_method_clear>` **(** **)** |
  41. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  42. | void | :ref:`connect_points<class_AStar_method_connect_points>` **(** :ref:`int<class_int>` id, :ref:`int<class_int>` to_id, :ref:`bool<class_bool>` bidirectional=true **)** |
  43. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  44. | void | :ref:`disconnect_points<class_AStar_method_disconnect_points>` **(** :ref:`int<class_int>` id, :ref:`int<class_int>` to_id, :ref:`bool<class_bool>` bidirectional=true **)** |
  45. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  46. | :ref:`int<class_int>` | :ref:`get_available_point_id<class_AStar_method_get_available_point_id>` **(** **)** |const| |
  47. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  48. | :ref:`int<class_int>` | :ref:`get_closest_point<class_AStar_method_get_closest_point>` **(** :ref:`Vector3<class_Vector3>` to_position, :ref:`bool<class_bool>` include_disabled=false **)** |const| |
  49. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  50. | :ref:`Vector3<class_Vector3>` | :ref:`get_closest_position_in_segment<class_AStar_method_get_closest_position_in_segment>` **(** :ref:`Vector3<class_Vector3>` to_position **)** |const| |
  51. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  52. | :ref:`PoolIntArray<class_PoolIntArray>` | :ref:`get_id_path<class_AStar_method_get_id_path>` **(** :ref:`int<class_int>` from_id, :ref:`int<class_int>` to_id **)** |
  53. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  54. | :ref:`int<class_int>` | :ref:`get_point_capacity<class_AStar_method_get_point_capacity>` **(** **)** |const| |
  55. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  56. | :ref:`PoolIntArray<class_PoolIntArray>` | :ref:`get_point_connections<class_AStar_method_get_point_connections>` **(** :ref:`int<class_int>` id **)** |
  57. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  58. | :ref:`int<class_int>` | :ref:`get_point_count<class_AStar_method_get_point_count>` **(** **)** |const| |
  59. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  60. | :ref:`PoolVector3Array<class_PoolVector3Array>` | :ref:`get_point_path<class_AStar_method_get_point_path>` **(** :ref:`int<class_int>` from_id, :ref:`int<class_int>` to_id **)** |
  61. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  62. | :ref:`Vector3<class_Vector3>` | :ref:`get_point_position<class_AStar_method_get_point_position>` **(** :ref:`int<class_int>` id **)** |const| |
  63. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  64. | :ref:`float<class_float>` | :ref:`get_point_weight_scale<class_AStar_method_get_point_weight_scale>` **(** :ref:`int<class_int>` id **)** |const| |
  65. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  66. | :ref:`Array<class_Array>` | :ref:`get_points<class_AStar_method_get_points>` **(** **)** |
  67. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  68. | :ref:`bool<class_bool>` | :ref:`has_point<class_AStar_method_has_point>` **(** :ref:`int<class_int>` id **)** |const| |
  69. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  70. | :ref:`bool<class_bool>` | :ref:`is_point_disabled<class_AStar_method_is_point_disabled>` **(** :ref:`int<class_int>` id **)** |const| |
  71. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  72. | void | :ref:`remove_point<class_AStar_method_remove_point>` **(** :ref:`int<class_int>` id **)** |
  73. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  74. | void | :ref:`reserve_space<class_AStar_method_reserve_space>` **(** :ref:`int<class_int>` num_nodes **)** |
  75. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  76. | void | :ref:`set_point_disabled<class_AStar_method_set_point_disabled>` **(** :ref:`int<class_int>` id, :ref:`bool<class_bool>` disabled=true **)** |
  77. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  78. | void | :ref:`set_point_position<class_AStar_method_set_point_position>` **(** :ref:`int<class_int>` id, :ref:`Vector3<class_Vector3>` position **)** |
  79. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  80. | void | :ref:`set_point_weight_scale<class_AStar_method_set_point_weight_scale>` **(** :ref:`int<class_int>` id, :ref:`float<class_float>` weight_scale **)** |
  81. +-------------------------------------------------+--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------+
  82. .. rst-class:: classref-section-separator
  83. ----
  84. .. rst-class:: classref-descriptions-group
  85. Method Descriptions
  86. -------------------
  87. .. _class_AStar_method__compute_cost:
  88. .. rst-class:: classref-method
  89. :ref:`float<class_float>` **_compute_cost** **(** :ref:`int<class_int>` from_id, :ref:`int<class_int>` to_id **)** |virtual|
  90. Called when computing the cost between two connected points.
  91. Note that this function is hidden in the default ``AStar`` class.
  92. .. rst-class:: classref-item-separator
  93. ----
  94. .. _class_AStar_method__estimate_cost:
  95. .. rst-class:: classref-method
  96. :ref:`float<class_float>` **_estimate_cost** **(** :ref:`int<class_int>` from_id, :ref:`int<class_int>` to_id **)** |virtual|
  97. Called when estimating the cost between a point and the path's ending point.
  98. Note that this function is hidden in the default ``AStar`` class.
  99. .. rst-class:: classref-item-separator
  100. ----
  101. .. _class_AStar_method_add_point:
  102. .. rst-class:: classref-method
  103. void **add_point** **(** :ref:`int<class_int>` id, :ref:`Vector3<class_Vector3>` position, :ref:`float<class_float>` weight_scale=1.0 **)**
  104. Adds a new point at the given position with the given identifier. The ``id`` must be 0 or larger, and the ``weight_scale`` must be 0.0 or greater.
  105. The ``weight_scale`` is multiplied by the result of :ref:`_compute_cost<class_AStar_method__compute_cost>` when determining the overall cost of traveling across a segment from a neighboring point to this point. Thus, all else being equal, the algorithm prefers points with lower ``weight_scale``\ s to form a path.
  106. ::
  107. var astar = AStar.new()
  108. astar.add_point(1, Vector3(1, 0, 0), 4) # Adds the point (1, 0, 0) with weight_scale 4 and id 1
  109. If there already exists a point for the given ``id``, its position and weight scale are updated to the given values.
  110. .. rst-class:: classref-item-separator
  111. ----
  112. .. _class_AStar_method_are_points_connected:
  113. .. rst-class:: classref-method
  114. :ref:`bool<class_bool>` **are_points_connected** **(** :ref:`int<class_int>` id, :ref:`int<class_int>` to_id, :ref:`bool<class_bool>` bidirectional=true **)** |const|
  115. Returns whether the two given points are directly connected by a segment. If ``bidirectional`` is ``false``, returns whether movement from ``id`` to ``to_id`` is possible through this segment.
  116. .. rst-class:: classref-item-separator
  117. ----
  118. .. _class_AStar_method_clear:
  119. .. rst-class:: classref-method
  120. void **clear** **(** **)**
  121. Clears all the points and segments.
  122. .. rst-class:: classref-item-separator
  123. ----
  124. .. _class_AStar_method_connect_points:
  125. .. rst-class:: classref-method
  126. void **connect_points** **(** :ref:`int<class_int>` id, :ref:`int<class_int>` to_id, :ref:`bool<class_bool>` bidirectional=true **)**
  127. Creates a segment between the given points. If ``bidirectional`` is ``false``, only movement from ``id`` to ``to_id`` is allowed, not the reverse direction.
  128. ::
  129. var astar = AStar.new()
  130. astar.add_point(1, Vector3(1, 1, 0))
  131. astar.add_point(2, Vector3(0, 5, 0))
  132. astar.connect_points(1, 2, false)
  133. .. rst-class:: classref-item-separator
  134. ----
  135. .. _class_AStar_method_disconnect_points:
  136. .. rst-class:: classref-method
  137. void **disconnect_points** **(** :ref:`int<class_int>` id, :ref:`int<class_int>` to_id, :ref:`bool<class_bool>` bidirectional=true **)**
  138. Deletes the segment between the given points. If ``bidirectional`` is ``false``, only movement from ``id`` to ``to_id`` is prevented, and a unidirectional segment possibly remains.
  139. .. rst-class:: classref-item-separator
  140. ----
  141. .. _class_AStar_method_get_available_point_id:
  142. .. rst-class:: classref-method
  143. :ref:`int<class_int>` **get_available_point_id** **(** **)** |const|
  144. Returns the next available point ID with no point associated to it.
  145. .. rst-class:: classref-item-separator
  146. ----
  147. .. _class_AStar_method_get_closest_point:
  148. .. rst-class:: classref-method
  149. :ref:`int<class_int>` **get_closest_point** **(** :ref:`Vector3<class_Vector3>` to_position, :ref:`bool<class_bool>` include_disabled=false **)** |const|
  150. Returns the ID of the closest point to ``to_position``, optionally taking disabled points into account. Returns ``-1`` if there are no points in the points pool.
  151. \ **Note:** If several points are the closest to ``to_position``, the one with the smallest ID will be returned, ensuring a deterministic result.
  152. .. rst-class:: classref-item-separator
  153. ----
  154. .. _class_AStar_method_get_closest_position_in_segment:
  155. .. rst-class:: classref-method
  156. :ref:`Vector3<class_Vector3>` **get_closest_position_in_segment** **(** :ref:`Vector3<class_Vector3>` to_position **)** |const|
  157. Returns the closest position to ``to_position`` that resides inside a segment between two connected points.
  158. ::
  159. var astar = AStar.new()
  160. astar.add_point(1, Vector3(0, 0, 0))
  161. astar.add_point(2, Vector3(0, 5, 0))
  162. astar.connect_points(1, 2)
  163. var res = astar.get_closest_position_in_segment(Vector3(3, 3, 0)) # Returns (0, 3, 0)
  164. The result is in the segment that goes from ``y = 0`` to ``y = 5``. It's the closest position in the segment to the given point.
  165. .. rst-class:: classref-item-separator
  166. ----
  167. .. _class_AStar_method_get_id_path:
  168. .. rst-class:: classref-method
  169. :ref:`PoolIntArray<class_PoolIntArray>` **get_id_path** **(** :ref:`int<class_int>` from_id, :ref:`int<class_int>` to_id **)**
  170. Returns an array with the IDs of the points that form the path found by AStar between the given points. The array is ordered from the starting point to the ending point of the path.
  171. ::
  172. var astar = AStar.new()
  173. astar.add_point(1, Vector3(0, 0, 0))
  174. astar.add_point(2, Vector3(0, 1, 0), 1) # Default weight is 1
  175. astar.add_point(3, Vector3(1, 1, 0))
  176. astar.add_point(4, Vector3(2, 0, 0))
  177. astar.connect_points(1, 2, false)
  178. astar.connect_points(2, 3, false)
  179. astar.connect_points(4, 3, false)
  180. astar.connect_points(1, 4, false)
  181. var res = astar.get_id_path(1, 3) # Returns [1, 2, 3]
  182. If you change the 2nd point's weight to 3, then the result will be ``[1, 4, 3]`` instead, because now even though the distance is longer, it's "easier" to get through point 4 than through point 2.
  183. .. rst-class:: classref-item-separator
  184. ----
  185. .. _class_AStar_method_get_point_capacity:
  186. .. rst-class:: classref-method
  187. :ref:`int<class_int>` **get_point_capacity** **(** **)** |const|
  188. Returns the capacity of the structure backing the points, useful in conjunction with ``reserve_space``.
  189. .. rst-class:: classref-item-separator
  190. ----
  191. .. _class_AStar_method_get_point_connections:
  192. .. rst-class:: classref-method
  193. :ref:`PoolIntArray<class_PoolIntArray>` **get_point_connections** **(** :ref:`int<class_int>` id **)**
  194. Returns an array with the IDs of the points that form the connection with the given point.
  195. ::
  196. var astar = AStar.new()
  197. astar.add_point(1, Vector3(0, 0, 0))
  198. astar.add_point(2, Vector3(0, 1, 0))
  199. astar.add_point(3, Vector3(1, 1, 0))
  200. astar.add_point(4, Vector3(2, 0, 0))
  201. astar.connect_points(1, 2, true)
  202. astar.connect_points(1, 3, true)
  203. var neighbors = astar.get_point_connections(1) # Returns [2, 3]
  204. .. rst-class:: classref-item-separator
  205. ----
  206. .. _class_AStar_method_get_point_count:
  207. .. rst-class:: classref-method
  208. :ref:`int<class_int>` **get_point_count** **(** **)** |const|
  209. Returns the number of points currently in the points pool.
  210. .. rst-class:: classref-item-separator
  211. ----
  212. .. _class_AStar_method_get_point_path:
  213. .. rst-class:: classref-method
  214. :ref:`PoolVector3Array<class_PoolVector3Array>` **get_point_path** **(** :ref:`int<class_int>` from_id, :ref:`int<class_int>` to_id **)**
  215. Returns an array with the points that are in the path found by AStar between the given points. The array is ordered from the starting point to the ending point of the path.
  216. \ **Note:** This method is not thread-safe. If called from a :ref:`Thread<class_Thread>`, it will return an empty :ref:`PoolVector3Array<class_PoolVector3Array>` and will print an error message.
  217. .. rst-class:: classref-item-separator
  218. ----
  219. .. _class_AStar_method_get_point_position:
  220. .. rst-class:: classref-method
  221. :ref:`Vector3<class_Vector3>` **get_point_position** **(** :ref:`int<class_int>` id **)** |const|
  222. Returns the position of the point associated with the given ``id``.
  223. .. rst-class:: classref-item-separator
  224. ----
  225. .. _class_AStar_method_get_point_weight_scale:
  226. .. rst-class:: classref-method
  227. :ref:`float<class_float>` **get_point_weight_scale** **(** :ref:`int<class_int>` id **)** |const|
  228. Returns the weight scale of the point associated with the given ``id``.
  229. .. rst-class:: classref-item-separator
  230. ----
  231. .. _class_AStar_method_get_points:
  232. .. rst-class:: classref-method
  233. :ref:`Array<class_Array>` **get_points** **(** **)**
  234. Returns an array of all points.
  235. .. rst-class:: classref-item-separator
  236. ----
  237. .. _class_AStar_method_has_point:
  238. .. rst-class:: classref-method
  239. :ref:`bool<class_bool>` **has_point** **(** :ref:`int<class_int>` id **)** |const|
  240. Returns whether a point associated with the given ``id`` exists.
  241. .. rst-class:: classref-item-separator
  242. ----
  243. .. _class_AStar_method_is_point_disabled:
  244. .. rst-class:: classref-method
  245. :ref:`bool<class_bool>` **is_point_disabled** **(** :ref:`int<class_int>` id **)** |const|
  246. Returns whether a point is disabled or not for pathfinding. By default, all points are enabled.
  247. .. rst-class:: classref-item-separator
  248. ----
  249. .. _class_AStar_method_remove_point:
  250. .. rst-class:: classref-method
  251. void **remove_point** **(** :ref:`int<class_int>` id **)**
  252. Removes the point associated with the given ``id`` from the points pool.
  253. .. rst-class:: classref-item-separator
  254. ----
  255. .. _class_AStar_method_reserve_space:
  256. .. rst-class:: classref-method
  257. void **reserve_space** **(** :ref:`int<class_int>` num_nodes **)**
  258. Reserves space internally for ``num_nodes`` points, useful if you're adding a known large number of points at once, for a grid for instance. New capacity must be greater or equals to old capacity.
  259. .. rst-class:: classref-item-separator
  260. ----
  261. .. _class_AStar_method_set_point_disabled:
  262. .. rst-class:: classref-method
  263. void **set_point_disabled** **(** :ref:`int<class_int>` id, :ref:`bool<class_bool>` disabled=true **)**
  264. Disables or enables the specified point for pathfinding. Useful for making a temporary obstacle.
  265. .. rst-class:: classref-item-separator
  266. ----
  267. .. _class_AStar_method_set_point_position:
  268. .. rst-class:: classref-method
  269. void **set_point_position** **(** :ref:`int<class_int>` id, :ref:`Vector3<class_Vector3>` position **)**
  270. Sets the ``position`` for the point with the given ``id``.
  271. .. rst-class:: classref-item-separator
  272. ----
  273. .. _class_AStar_method_set_point_weight_scale:
  274. .. rst-class:: classref-method
  275. void **set_point_weight_scale** **(** :ref:`int<class_int>` id, :ref:`float<class_float>` weight_scale **)**
  276. Sets the ``weight_scale`` for the point with the given ``id``. The ``weight_scale`` is multiplied by the result of :ref:`_compute_cost<class_AStar_method__compute_cost>` when determining the overall cost of traveling across a segment from a neighboring point to this point.
  277. .. |virtual| replace:: :abbr:`virtual (This method should typically be overridden by the user to have any effect.)`
  278. .. |const| replace:: :abbr:`const (This method has no side effects. It doesn't modify any of the instance's member variables.)`
  279. .. |vararg| replace:: :abbr:`vararg (This method accepts any number of arguments after the ones described here.)`
  280. .. |static| replace:: :abbr:`static (This method doesn't need an instance to be called, so it can be called directly using the class name.)`