Question ANYA pathfinding

Has anyone found a C# implementation of ANYA pathfinding?

 

A C# implementation? Or a Unity implementation? Because I can find the former.

https://github.com/Tjstretchalot/AnyAnglePathfinding

 

Thanks for the link!

I don't think that is ANYA though. It look like some variant of strict Theta star?

ANYA would find optimal paths. This algorithm states it does not.

 

https://en.wikipedia.org/wiki/Theta*

Ryiah likely interpreted your use of 'anya' to mean "any angle"... if you're searching for a very specific implementation than needs more digging. I will note that from looking at the wiki article for any angle it sort of suggests a specific algo called ANYA is based on Theta*:
https://en.wikipedia.org/wiki/Any-angle_path_planning

 

Technically Google did because I had never heard of the term before.

Which is the catch when you're asking for resources and you don't go into any more detail than an acronym.

 

Same... when I googled "anya pathfinding" I too got the generic any-angle articles.

I have heard of any-angle, I haven't really read "ANYA" before though. But was like "Oh, ok... guess people are short-handing/acronyming it I guess. Like OOP or CPP."

 

Actually the name of the actual algorithm... ANYA.

Well, not exactly. Closer to the other way around. Extensions of Theta*, Strict Theta*, and Recursive Strict Theta*, restrict the search space to taut paths introduced in ANYA.

Had you read down a few more lines you would have seen more than "sort of suggests" it, it specifically calls it out.

"ANYA[16] - Finds optimal any-angle paths by restricting the search space to the Taut paths (a path where every heading change in the path “wraps” tightly around some obstacle); looking at an interval of points as a node rather than a single point. The fastest online optimal technique known. This algorithm is restricted to 2D grids."

 

Rather than an acronym, it is the actual name of the algorithm. Listed in any-angle pathfinding wiki page and described here:
https://users.cecs.anu.edu.au/~dharabor/data/papers/harabor-grastien-icaps13.pdf

 

Cool story bro. I think you got this then.

 

See this would have been useful to start with rather than assuming everyone knows what you're referring to.

 

Or hopefully someone else who knows something on the subject.

 

When you ask for an algorithm by name, its expected that someone won't respond with a different topic, or at least ask to clear up that that they don't understand.

Had I asked for an A* pathfinding algorithm, I would not have then gone on to explain what it was in detail.

 

Undefined jargon is undefined jargon. Try googling "ANYA" you get nothing related to pathfinding. Try googling "ANYA pathfinding" and you get results about "Any-Angle Pathfinding".

...

I remember you now. You have a habit of every few months posting really vague questions and then revealing your cards later into the conversation and taken back no one knew what you were talking about from your vague first post. It's just your post history is so all over the place I forget your username by the next time it pops up. And every time I tell myself to remember next time. I'm going to work on that.

Tootles.

 

There is a difference between a thing being undefined and individuals such as yourself who don't know the definition.

Why even in the wiki article you cited in your post above calls out this algorithm by name.

Unlike you, I remembered your username well. You like to come into posts armed with snark only and hope it gets you by. Your entering a thread is like a marker for productive discussion coming to a halt.

Should you wish to post in this thread again, I would hope it would have SOMETHING to do with the requested information of a C# implementation of the ANYA pathfinding algorithm.

 

Not every post... just yours.

 

Case in point.