Coverage path planning for the enviroment with moving obstacle
hi, guys,
i have a problem for the coverage path planning. I'm doing a project which uses the coverage path planning. But i have seen many papers about cpp which all are based on the enviroment with no-moving obstacle. For tha i want to ask, if it has algorithm for the enviroment with moving obstacle?
best regards fei
Maybe you can try this http://wiki.ros.org/heatmap