python 实现A*算法的示例代码


Posted in Python onAugust 13, 2018

A*作为最常用的路径搜索算法,值得我们去深刻的研究。路径规划项目。先看一下维基百科给的算法解释:https://en.wikipedia.org/wiki/A*_search_algorithm

A *是最佳优先搜索它通过在解决方案的所有可能路径(目标)中搜索导致成本最小(行进距离最短,时间最短等)的问题来解决问题。 ),并且在这些路径中,它首先考虑那些似乎最快速地引导到解决方案的路径。它是根据加权图制定的:从图的特定节点开始,它构造从该节点开始的路径树,一次一步地扩展路径,直到其一个路径在预定目标节点处结束。

在其主循环的每次迭代中,A *需要确定将其部分路径中的哪些扩展为一个或多个更长的路径。它是基于成本(总重量)的估计仍然到达目标节点。具体而言,A *选择最小化的路径

F(N)= G(N)+ H(n)

其中n是路径上的最后一个节点,g(n)是从起始节点到n的路径的开销,h(n)是一个启发式,用于估计从n到目标的最便宜路径的开销。启发式是特定于问题的。为了找到实际最短路径的算法,启发函数必须是可接受的,这意味着它永远不会高估实际成本到达最近的目标节点。

维基百科给出的伪代码:

function A*(start, goal)
  // The set of nodes already evaluated
  closedSet := {}

  // The set of currently discovered nodes that are not evaluated yet.
  // Initially, only the start node is known.
  openSet := {start}

  // For each node, which node it can most efficiently be reached from.
  // If a node can be reached from many nodes, cameFrom will eventually contain the
  // most efficient previous step.
  cameFrom := an empty map

  // For each node, the cost of getting from the start node to that node.
  gScore := map with default value of Infinity

  // The cost of going from start to start is zero.
  gScore[start] := 0

  // For each node, the total cost of getting from the start node to the goal
  // by passing by that node. That value is partly known, partly heuristic.
  fScore := map with default value of Infinity

  // For the first node, that value is completely heuristic.
  fScore[start] := heuristic_cost_estimate(start, goal)

  while openSet is not empty
    current := the node in openSet having the lowest fScore[] value
    if current = goal
      return reconstruct_path(cameFrom, current)

    openSet.Remove(current)
    closedSet.Add(current)

    for each neighbor of current
      if neighbor in closedSet
        continue // Ignore the neighbor which is already evaluated.

      if neighbor not in openSet // Discover a new node
        openSet.Add(neighbor)
      
      // The distance from start to a neighbor
      //the "dist_between" function may vary as per the solution requirements.
      tentative_gScore := gScore[current] + dist_between(current, neighbor)
      if tentative_gScore >= gScore[neighbor]
        continue // This is not a better path.

      // This path is the best until now. Record it!
      cameFrom[neighbor] := current
      gScore[neighbor] := tentative_gScore
      fScore[neighbor] := gScore[neighbor] + heuristic_cost_estimate(neighbor, goal) 

  return failure

function reconstruct_path(cameFrom, current)
  total_path := {current}
  while current in cameFrom.Keys:
    current := cameFrom[current]
    total_path.append(current)
  return total_path

下面是UDACITY课程中路径规划项目,结合上面的伪代码,用python 实现A* 

import math
def shortest_path(M,start,goal):
  sx=M.intersections[start][0]
  sy=M.intersections[start][1]
  gx=M.intersections[goal][0]
  gy=M.intersections[goal][1] 
  h=math.sqrt((sx-gx)*(sx-gx)+(sy-gy)*(sy-gy))
  closedSet=set()
  openSet=set()
  openSet.add(start)
  gScore={}
  gScore[start]=0
  fScore={}
  fScore[start]=h
  cameFrom={}
  sumg=0
  NEW=0
  BOOL=False
  while len(openSet)!=0: 
    MAX=1000
    for new in openSet:
      print("new",new)
      if fScore[new]<MAX:
        MAX=fScore[new]
        #print("MAX=",MAX)
        NEW=new
    current=NEW
    print("current=",current)
    if current==goal:
      return reconstruct_path(cameFrom,current)
    openSet.remove(current)
    closedSet.add(current)
    #dafult=M.roads(current)
    for neighbor in M.roads[current]:
      BOOL=False
      print("key=",neighbor)
      a={neighbor}
      if len(a&closedSet)>0:
        continue
      print("key is not in closeSet")
      if len(a&openSet)==0:
        openSet.add(neighbor)  
      else:
        BOOL=True
      x= M.intersections[current][0]
      y= M.intersections[current][1]
      x1=M.intersections[neighbor][0]
      y1=M.intersections[neighbor][1]
      g=math.sqrt((x-x1)*(x-x1)+(y-y1)*(y-y1))
      h=math.sqrt((x1-gx)*(x1-gx)+(y1-gy)*(y1-gy)) 
      
      new_gScore=gScore[current]+g
      if BOOL==True:
        if new_gScore>=gScore[neighbor]:
          continue
      print("new_gScore",new_gScore) 
      cameFrom[neighbor]=current
      gScore[neighbor]=new_gScore     
      fScore[neighbor] = new_gScore+h
      print("fScore",neighbor,"is",new_gScore+h)
      print("fScore=",new_gScore+h)
      
    print("__________++--------------++_________")
                   
def reconstruct_path(cameFrom,current):
  print("已到达lllll")
  total_path=[]
  total_path.append(current)
  for key,value in cameFrom.items():
    print("key",key,":","value",value)
    
  while current in cameFrom.keys():
    
    current=cameFrom[current]
    total_path.append(current)
  total_path=list(reversed(total_path))  
  return total_path

以上就是本文的全部内容,希望对大家的学习有所帮助,也希望大家多多支持三水点靠木。

Python 相关文章推荐
Windows系统下安装Python的SSH模块教程
Feb 05 Python
Python连接MySQL并使用fetchall()方法过滤特殊字符
Mar 13 Python
Python变量赋值的秘密分享
Apr 03 Python
Anaconda2下实现Python2.7和Python3.5的共存方法
Jun 11 Python
利用Python读取txt文档的方法讲解
Jun 23 Python
Python中实现单例模式的n种方式和原理
Nov 14 Python
kafka-python批量发送数据的实例
Dec 27 Python
Python爬虫:url中带字典列表参数的编码转换方法
Aug 21 Python
python 数据提取及拆分的实现代码
Aug 26 Python
python中使用you-get库批量在线下载bilibili视频的教程
Mar 10 Python
Python读取图像并显示灰度图的实现
Dec 01 Python
用PYTHON去计算88键钢琴的琴键频率和音高
Apr 10 Python
Python绘制KS曲线的实现方法
Aug 13 #Python
Python标准库shutil用法实例详解
Aug 13 #Python
详解windows python3.7安装numpy问题的解决方法
Aug 13 #Python
python之super的使用小结
Aug 13 #Python
Selenium控制浏览器常见操作示例
Aug 13 #Python
详解python3中的真值测试
Aug 13 #Python
利用Python将每日一句定时推送至微信的实现方法
Aug 13 #Python
You might like
AM/FM收音机的安装与调试
2021/03/02 无线电
laravel安装zend opcache加速器教程
2015/03/02 PHP
简单的php+mysql聊天室实现方法(附源码)
2016/01/05 PHP
php解决约瑟夫环算法实例分析
2019/09/30 PHP
Prototype 学习 工具函数学习($w,$F方法)
2009/07/12 Javascript
仅img元素创建后不添加到文档中会执行onload事件的解决方法
2011/07/31 Javascript
jquery 选择器引擎sizzle浅析
2013/02/06 Javascript
JS获取当前日期和时间的简单实例
2013/11/19 Javascript
javascript禁用Tab键脚本实例
2013/11/22 Javascript
深入分析Javascript跨域问题
2015/04/17 Javascript
JS判断日期格式是否合法的简单实例
2016/07/11 Javascript
vue指令只能输入正数并且只能输入一个小数点的方法
2018/06/08 Javascript
详解微信小程序开发用户授权登陆
2019/04/24 Javascript
如何通过javaScript去除字符串两端的空白字符
2020/02/06 Javascript
详解Vue中的Props与Data细微差别
2020/03/02 Javascript
如何通过Proxy实现JSBridge模块化封装
2020/10/22 Javascript
[01:00:52]2018DOTA2亚洲邀请赛 4.4 淘汰赛 EG vs LGD 第一场
2018/04/05 DOTA
python3+PyQt5重新实现QT事件处理程序
2018/04/19 Python
将Dataframe数据转化为ndarry数据的方法
2018/06/28 Python
Django2.1.3 中间件使用详解
2018/11/26 Python
python匹配两个短语之间的字符实例
2018/12/25 Python
Python判断对象是否相等及eq函数的讲解
2019/02/25 Python
Python 读取串口数据,动态绘图的示例
2019/07/02 Python
matplotlib绘制多个子图(subplot)的方法
2019/12/03 Python
详解python的super()的作用和原理
2020/10/29 Python
Python 使用xlwt模块将多行多列数据循环写入excel文档的操作
2020/11/10 Python
CSS3 绘制BMW logo实的现代码
2013/04/25 HTML / CSS
新加坡交友网站:be2新加坡
2019/04/10 全球购物
日本AOKI官方商城:AOKI西装
2020/06/11 全球购物
大学生涯自我鉴定
2014/01/16 职场文书
《月迹》教学反思
2014/02/19 职场文书
自我鉴定总结
2014/03/24 职场文书
中秋节晚会开场白
2015/05/29 职场文书
小学记事作文之200字
2019/08/06 职场文书
导游词之泰山玉皇顶
2019/12/23 职场文书
使用Nginx搭载rtmp直播服务器的方法
2021/10/16 Servers