基于分层代价地图的路径规划倾向性引入方法

Method for Incorporating Path Planning Preferences Based on Layered Cost Map

  • 摘要: 路径规划是移动无人智能系统的重要研究领域,通常分为全局规划和局部规划。其中,常见的全局规划算法(如A*、Dijkstra等)往往仅考虑无碰撞和路径最短,难以引入其他语义和倾向。针对上述问题,提出一种基于分层代价地图的路径规划倾向性引入方法,即在传统代价地图环境建模中引入规划倾向层。该图层通过广度优先搜索(Breadth-first Search,BFS)算法扩展指定的参考路径,使路径规划越远离参考路径代价越高,从而引导全局规划结果趋向于参考路径。仿真实验结果表明,基于分层代价地图的路径规划倾向性引入方法能够有效解决参考路径拟合和路径规划震荡问题,使路径规划在满足安全性与可行性的同时更好地体现任务意图,可为智能感知结果的语义化利用与路径规划的深度融合提供新思路。

     

    Abstract: Path planning is an important research field in mobile unmanned intelligent systems, which is usually divided into global planning and local planning. Among them, common global programming algorithms (such as A*, Dijkstra, etc.) often only consider collisionless and shortest paths, making it difficult to introduce other semantics and tendencies. In response to the above problems, a method for introducing planning tendencies based on hierarchical cost map is proposed, that is, a planning preference layer is introduced into the traditional cost map environment modeling. The layer extends the specified reference path through the breadth-first search algorithm, making the cost higher the further the path planning is from the reference path, thereby guiding the global planning result towards the reference path. The simulation experiment results show that the path planning preference introduction method based on hierarchical cost map can effectively solve the problems of reference path fitting and path planning oscillation, enabling path planning to better reflect the task intention while meeting the requirements of safety and feasibility. It can provide new ideas for the semantic utilization of intelligent perception results and the deep integration of path planning.

     

/

返回文章
返回