Would it be feasible to use a GPU to optimize the paths as opposed to multiple threads or do you suspect the overhead would surpass the benefit. From just quickly looking it seems like a good candidate for parallelization. Also, the matrix library used has an option to compile with GPU support. Would this substantially impact the planners performance?
I did not see any GPU/CUDA/OpenCL options in the g2o cmake file. But there is a library for Sparse Non-linear Least Squares Optimization on a GPU: https://github.com/OpenOF/OpenOF
Would it be feasible to use a GPU to optimize the paths as opposed to multiple threads or do you suspect the overhead would surpass the benefit. From just quickly looking it seems like a good candidate for parallelization. Also, the matrix library used has an option to compile with GPU support. Would this substantially impact the planners performance?