在Python中，我们可以使用A*算法来寻找从起点到终点的最短路径，同时处理随机生成的障碍物。以下是一个基本的实现，包括了A*算法、路径绘制以及matplotlib库的使用： ```python import heapq import random import matplotlib.pyplot as plt from collections import defaultdict def heuristic(a, b): dx = abs(b[0] - a[0]) dy = abs(b[1] - a[1]) return dx + dy def a_star(start, end, grid, obstacles={}): def get_neighbors(node): neighbors = [] for x, y in [(node[0]+dx, node[1]+dy) for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]]: if 0 <= x < len(grid) and 0 <= y < len(grid[0]) and (x, y) not in obstacles and grid[x][y] == 0: neighbors.append((x, y)) return neighbors g_score = {start: 0} f_score = {start: heuristic(start, end)} came_from = {} frontier = [] heapq.heappush(frontier, (f_score[start], start)) while frontier: current = heapq.heappop(frontier)[1] if current == end: path = [current] while current in came_from: current = came_from[current] path.append(current) return path[::-1] for neighbor in get_neighbors(current): tentative_g_score = g_score[current] + 1 if neighbor not in g_score or tentative_g_score < g_score[neighbor]: came_from[neighbor] = current g_score[neighbor] = tentative_g_score f_score[neighbor] = tentative_g_score + heuristic(neighbor, end) heapq.heappush(frontier, (f_score[neighbor], neighbor)) return None # 示例网格和随机障碍生成 grid_size = 15 grid = [[0]*grid_size for _ in range(grid_size)] obstacles = set() for _ in range(random.randint(10, 20)): x = random.randint(0, grid_size-1) y = random.randint(0, grid_size-1) grid[x][y] = 1 obstacles.add((x, y)) # 设置起始点和目标点 start = (0, 0) end = (grid_size-1, grid_size-1) path = a_star(start, end, grid, obstacles) if path is not None: plt.imshow([[1 if (i, j) in obstacles else 0 for j in range(grid_size)] for i in range(grid_size)]) plt.plot([p[0] for p in path], [p[1] for p in path], 'r-o') plt.show() else: print("No path found.")