I am using Dijkstra algorithm for global planning of navigation, but now there is a problem. When the length of two paths is equal, the planner will "hesitate", which is manifested as frequent pulsation of paths. I was wondering is there any way to solve this problem?