Can I use graph slam to solve this problem?
However, the problem with graph slam is it is an offline algorithm that requires huge memory space. So, are there any other graph-based algorithm is available which is suitable for this problem?
Actually memory is less of a problem than processing speed.
Secondly, If I need to implement the same problem ...