Closed hzxBuaa closed 1 year ago
But the Dijkstra algorithm needs a proper plan before exploring, so is it necessary to obtain all map information to adopt this algorithm?
That's not entirely so. You can obtain an initial naive plan without exploration. A grid map has known free, known occupied, and unknown elements. By using move_base we can allow planning through unknown parts of the map, so an initial plan will be obtained. Then when executing it, the unknown parts will become known, and the original plan will be re-planned. Since that takes time, we used heuristics instead and show that through the time that it takes to get to the final goal.
Thank you very much for your answer. I think I should understand what you mean. You are using the Dijkstra planning algorithm, and the control layer comes with move_base and ROSARIA. Without the need to build a map in advance, when the car is driving, the lidar senses the surrounding environment, the unknown becomes known, and then the algorithm adjusts the planned path according to the established environment, is this true?
Yes, that is how it was implemented.
Hello, it is an excellent repo for navigation. I am wondering in your paper( https://arxiv.org/abs/2103.07119) you mentioned baseline algorithm- PP. I have two questions.