Ive been searching for a path-finding algorithm for a moving target. If there are no obstacles in proximity Seek heviour would be good enough. However, A* or some other path-findings are needed when obstacles are on the way to the moving target.

The problem Im 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.

The image below shows some basic background of the problem. The red arrow shows the direction Seek behavior calculates. But I want Chaser to take the green direction instead.

Thanks in advance.

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.

The image below shows some basic background of the problem. The red arrow shows the direction my Seek behavior calculates. But I want the "Chaser" to take the green direction instead.

Thanks in advance.