![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
路径规划
cyytum
慕尼黑工业大学机器人
展开
-
Hybrid A* 算法基本流程
openset = PriorityQueue() // pop out node with least totoal cost (heuriscost + trajcost)openset.push(start, 0)closedset = {}trajcost[start] = 0while not openset.empty(): current = openset.t...原创 2020-03-15 15:21:59 · 4458 阅读 · 3 评论 -
A * 算法C++实现
/************************************************************************* > File Name: grid_a_star.cpp > Author: Yongyu Chen > Mail: yongyu.chen@tum.de *********************************...原创 2020-01-21 15:20:57 · 616 阅读 · 0 评论