1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
|
<?xml version="1.0" encoding="UTF-8" ?>
<class name="AStar" inherits="Reference" category="Core" version="3.1">
<brief_description>
AStar class representation that uses vectors as edges.
</brief_description>
<description>
A* (A star) is a computer algorithm that is widely used in pathfinding and graph traversal, the process of plotting an efficiently directed path between multiple points. It enjoys widespread use due to its performance and accuracy. Godot's A* implementation make use of vectors as points.
You must add points manually with [method AStar.add_point] and create segments manually with [method AStar.connect_points]. So you can test if there is a path between two points with the [method AStar.are_points_connected] function, get the list of existing ids in the found path with [method AStar.get_id_path], or the points list with [method AStar.get_point_path].
</description>
<tutorials>
</tutorials>
<demos>
</demos>
<methods>
<method name="_compute_cost" qualifiers="virtual">
<return type="float">
</return>
<argument index="0" name="from_id" type="int">
</argument>
<argument index="1" name="to_id" type="int">
</argument>
<description>
Called when computing the cost between two connected points.
</description>
</method>
<method name="_estimate_cost" qualifiers="virtual">
<return type="float">
</return>
<argument index="0" name="from_id" type="int">
</argument>
<argument index="1" name="to_id" type="int">
</argument>
<description>
Called when estimating the cost between a point and the path's ending point.
</description>
</method>
<method name="add_point">
<return type="void">
</return>
<argument index="0" name="id" type="int">
</argument>
<argument index="1" name="position" type="Vector3">
</argument>
<argument index="2" name="weight_scale" type="float" default="1.0">
</argument>
<description>
Adds a new point at the given position with the given identifier. The algorithm prefers points with lower [code]weight_scale[/code] to form a path. The [code]id[/code] must be 0 or larger, and the [code]weight_scale[/code] must be 1 or larger.
[codeblock]
var as = AStar.new()
as.add_point(1, Vector3(1,0,0), 4) # Adds the point (1,0,0) with weight_scale=4 and id=1
[/codeblock]
If there already exists a point for the given id, its position and weight scale are updated to the given values.
</description>
</method>
<method name="are_points_connected" qualifiers="const">
<return type="bool">
</return>
<argument index="0" name="id" type="int">
</argument>
<argument index="1" name="to_id" type="int">
</argument>
<description>
Returns whether there is a connection/segment between the given points.
</description>
</method>
<method name="clear">
<return type="void">
</return>
<description>
Clears all the points and segments.
</description>
</method>
<method name="connect_points">
<return type="void">
</return>
<argument index="0" name="id" type="int">
</argument>
<argument index="1" name="to_id" type="int">
</argument>
<argument index="2" name="bidirectional" type="bool" default="true">
</argument>
<description>
Creates a segment between the given points.
[codeblock]
var as = AStar.new()
as.add_point(1, Vector3(1,1,0))
as.add_point(2, Vector3(0,5,0))
as.connect_points(1, 2, false) # If bidirectional=false it's only possible to go from point 1 to point 2
# and not from point 2 to point 1.
[/codeblock]
</description>
</method>
<method name="disconnect_points">
<return type="void">
</return>
<argument index="0" name="id" type="int">
</argument>
<argument index="1" name="to_id" type="int">
</argument>
<description>
Deletes the segment between the given points.
</description>
</method>
<method name="get_available_point_id" qualifiers="const">
<return type="int">
</return>
<description>
Returns the next available point id with no point associated to it.
</description>
</method>
<method name="get_closest_point" qualifiers="const">
<return type="int">
</return>
<argument index="0" name="to_position" type="Vector3">
</argument>
<description>
Returns the id of the closest point to [code]to_position[/code]. Returns -1 if there are no points in the points pool.
</description>
</method>
<method name="get_closest_position_in_segment" qualifiers="const">
<return type="Vector3">
</return>
<argument index="0" name="to_position" type="Vector3">
</argument>
<description>
Returns the closest position to [code]to_position[/code] that resides inside a segment between two connected points.
[codeblock]
var as = AStar.new()
as.add_point(1, Vector3(0,0,0))
as.add_point(2, Vector3(0,5,0))
as.connect_points(1, 2)
var res = as.get_closest_position_in_segment(Vector3(3,3,0)) # returns (0, 3, 0)
[/codeblock]
The result is in the segment that goes from [code]y=0[/code] to [code]y=5[/code]. It's the closest position in the segment to the given point.
</description>
</method>
<method name="get_id_path">
<return type="PoolIntArray">
</return>
<argument index="0" name="from_id" type="int">
</argument>
<argument index="1" name="to_id" type="int">
</argument>
<description>
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.
[codeblock]
var as = AStar.new()
as.add_point(1, Vector3(0,0,0))
as.add_point(2, Vector3(0,1,0), 1) # default weight is 1
as.add_point(3, Vector3(1,1,0))
as.add_point(4, Vector3(2,0,0))
as.connect_points(1, 2, false)
as.connect_points(2, 3, false)
as.connect_points(4, 3, false)
as.connect_points(1, 4, false)
as.connect_points(5, 4, false)
var res = as.get_id_path(1, 3) # returns [1, 2, 3]
[/codeblock]
If you change the 2nd point's weight to 3, then the result will be [code][1, 4, 3][/code] instead, because now even though the distance is longer, it's "easier" to get through point 4 than through point 2.
</description>
</method>
<method name="get_point_connections">
<return type="PoolIntArray">
</return>
<argument index="0" name="id" type="int">
</argument>
<description>
Returns an array with the ids of the points that form the connect with the given point.
[codeblock]
var as = AStar.new()
as.add_point(1, Vector3(0,0,0))
as.add_point(2, Vector3(0,1,0))
as.add_point(3, Vector3(1,1,0))
as.add_point(4, Vector3(2,0,0))
as.connect_points(1, 2, true)
as.connect_points(1, 3, true)
var neighbors = as.get_point_connections(1) # returns [2, 3]
[/codeblock]
</description>
</method>
<method name="get_point_path">
<return type="PoolVector3Array">
</return>
<argument index="0" name="from_id" type="int">
</argument>
<argument index="1" name="to_id" type="int">
</argument>
<description>
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.
</description>
</method>
<method name="get_point_position" qualifiers="const">
<return type="Vector3">
</return>
<argument index="0" name="id" type="int">
</argument>
<description>
Returns the position of the point associated with the given id.
</description>
</method>
<method name="get_point_weight_scale" qualifiers="const">
<return type="float">
</return>
<argument index="0" name="id" type="int">
</argument>
<description>
Returns the weight scale of the point associated with the given id.
</description>
</method>
<method name="get_points">
<return type="Array">
</return>
<description>
Returns an array of all points.
</description>
</method>
<method name="has_point" qualifiers="const">
<return type="bool">
</return>
<argument index="0" name="id" type="int">
</argument>
<description>
Returns whether a point associated with the given id exists.
</description>
</method>
<method name="remove_point">
<return type="void">
</return>
<argument index="0" name="id" type="int">
</argument>
<description>
Removes the point associated with the given id from the points pool.
</description>
</method>
<method name="set_point_position">
<return type="void">
</return>
<argument index="0" name="id" type="int">
</argument>
<argument index="1" name="position" type="Vector3">
</argument>
<description>
Sets the position for the point with the given id.
</description>
</method>
<method name="set_point_weight_scale">
<return type="void">
</return>
<argument index="0" name="id" type="int">
</argument>
<argument index="1" name="weight_scale" type="float">
</argument>
<description>
Sets the [code]weight_scale[/code] for the point with the given id.
</description>
</method>
</methods>
<constants>
</constants>
</class>
|