Hello!

I am asking for help with terms, definitions and literature.
There is a flat 2D surface where units exist. Units vary in their bounding circle radius. They can travel around when issued an order.
I made a custom “pathfinding” algorithm - on collision unit walks 45 degrees of collidable object and resumes his movements toward target location. Whenever it hits something again it repeats the same dance.

It's not a viable solution. I looked into my old A* experiments, but it was a turn based thingy with single cell fields. Thus “grid” layout was a viable solution back then.

Is there a way to adapt A* to different sized units? What's passable for small unit may not be passable for a big one.
In grid example what if one unit took up space of four nodes. How do you calculate movement then.

Checked some guides online for “Navmesh” and “A*”, yet everything is lines and points, no tangible moving objects with actual movement issues.

Any responses/advices would be appreciated. At this point I do not know what I am looking for and thus drown in google search results.

Thank you for the response!

I was thinking about node weights, one thing i don't like is idea of “node weight recalculation”.

Lets say I have this row of cells, where . means “can pass” and x means the opposite.
x---x
Weights would be as follows
∞232∞

But as soon as there would be an unit in between, lets say “O”
x-O-x
It would change to
∞1∞1∞

Would recalculating entire weight matrix be efficient?
Or am I misinterpreting your idea?