I've been looking for a path-finding algorithm for a moving target. If there are no obstacles in proximity Seek behaviour would be good. However, A* or some other path-findings are needed when obstacles are on the way to the moving target.
The problem I'm facing now is that calculating a path using A* seems not efficient for a moving target. so I want to know if there are some good or preferred ways to solve this problem.
Thanks in advance.