Skip to content

Commit d2da3ab

Browse files
author
Atsushi Sakai
committed
fix safe index reference
1 parent 591ba9e commit d2da3ab

File tree

1 file changed

+4
-4
lines changed

1 file changed

+4
-4
lines changed

PathPlanning/RRTStar/rrt_star.py

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -59,7 +59,7 @@ def planning(self, animation=True, search_until_max_iter=True):
5959
rrt star path planning
6060
6161
animation: flag for animation on or off
62-
search_until_maxiter: search until max iteration for path improving or not
62+
search_until_max_iter: search until max iteration for path improving or not
6363
"""
6464

6565
self.node_list = [self.start]
@@ -122,7 +122,6 @@ def search_best_goal_node(self):
122122
dist_to_goal_list = [self.calc_dist_to_goal(n.x, n.y) for n in self.node_list]
123123
goal_inds = [dist_to_goal_list.index(i) for i in dist_to_goal_list if i <= self.expand_dis]
124124

125-
# safe_goal_inds = goal_inds
126125
safe_goal_inds = []
127126
for goal_ind in goal_inds:
128127
t_node = self.steer(self.node_list[goal_ind], self.goal_node)
@@ -132,8 +131,8 @@ def search_best_goal_node(self):
132131
if not safe_goal_inds:
133132
return None
134133

135-
min_cost = min([self.node_list[i].cost for i in goal_inds])
136-
for i in goal_inds:
134+
min_cost = min([self.node_list[i].cost for i in safe_goal_inds])
135+
for i in safe_goal_inds:
137136
if self.node_list[i].cost == min_cost:
138137
return i
139138

@@ -187,6 +186,7 @@ def main():
187186
(7, 5, 2),
188187
(9, 5, 2),
189188
(8, 10, 1),
189+
(6, 12, 1),
190190
] # [x,y,size(radius)]
191191

192192
# Set Initial parameters

0 commit comments

Comments
 (0)