for i in range(openList.shape[0]):报错为'list' object has no attribute 'shape'应该怎么改
时间: 2023-12-13 07:06:11 浏览: 29
`shape` 是 `numpy` 数组的属性,所以你需要将 `openList` 转换成 `numpy` 数组才能使用 `shape` 属性。你可以使用 `numpy` 库中的 `array` 函数将其转换,例如:
```
import numpy as np
openList_np = np.array(openList)
for i in range(openList_np.shape[0]):
# your code here
```
这样就可以使用 `shape` 属性了。
相关问题
g = np.linalg.norm(start_node - openList[i, :])报错为list indices must be integers or slices, not tuple
这个错误通常是因为 openList 的类型是 list 而不是 numpy 数组。你可以使用 `np.array()` 将 list 转换为 numpy 数组,然后再进行索引操作。例如:
```python
openList = np.array(openList)
g = np.linalg.norm(start_node - openList[i])
```
或者,你也可以直接使用 list 的索引方式来获取元素,如下所示:
```python
g = np.linalg.norm(start_node - openList[i][:])
```
这样就可以避免这个错误了。
修改以下代码,使他避开障碍物:def Astar(Map): s = Point(Map.start, None, None) openlist = [s] closedlist = [] s.get_f(Map.goal) while openlist: n = openlist.pop(0) if n.position[0] == Map.goal[0] and n.position[1] == Map.goal[1]: return n else: closedlist.append(n) subp_list = Point.EXPAND(n, Map) for subp in subp_list: subp.get_f(Map.goal) for openp in openlist: if openp.position[0] == subp.position[0] and openp.position[1] == subp.position[1]: if subp.f < openp.f: openlist.remove(openp) openlist.append(subp) for closedp in closedlist: if closedp.position[0] == subp.position[0] and closedp.position[1] == subp.position[1]: if subp.f < closedp.f: closedlist.remove(closedp) openlist.append(subp) openlist.append(subp) openlist.sort(key= lambda x:x.f)
Sure, here's the modified code that avoids obstacles using A* algorithm:
```
def Astar(Map):
s = Point(Map.start, None, None)
openlist = [s]
closedlist = []
s.get_f(Map.goal)
while openlist:
n = openlist.pop(0)
if n.position[0] == Map.goal[0] and n.position[1] == Map.goal[1]:
return n
else:
closedlist.append(n)
subp_list = Point.EXPAND(n, Map)
for subp in subp_list:
if Map.is_obstacle(subp.position[0], subp.position[1]):
continue
subp.get_f(Map.goal)
for openp in openlist:
if openp.position[0] == subp.position[0] and openp.position[1] == subp.position[1]:
if subp.f < openp.f:
openlist.remove(openp)
openlist.append(subp)
break
else:
for closedp in closedlist:
if closedp.position[0] == subp.position[0] and closedp.position[1] == subp.position[1]:
if subp.f < closedp.f:
closedlist.remove(closedp)
openlist.append(subp)
break
else:
openlist.append(subp)
openlist.sort(key=lambda x: x.f)
```
The modification is done by adding a check for obstacles in the sub-points list and skipping those points, as well as updating the open and closed lists based on the new condition.
相关推荐
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![](https://csdnimg.cn/download_wenku/file_type_ask_c1.png)
![pptx](https://img-home.csdnimg.cn/images/20210720083543.png)
![doc](https://img-home.csdnimg.cn/images/20210720083327.png)
![zip](https://img-home.csdnimg.cn/images/20210720083736.png)