Take the 2-minute tour ×
Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. It's 100% free, no registration required.

Both Theta* and Field D* are variations on the A* algorithm, but are adapted for any-angle pathfinding rather than pathfinding constrained to a grid. The primary difference between these two algorithms that I've seen is that Field D* can quickly recalculate the path at any time to adjust if the grid changes, while Theta* provides no such functionality.

Besides this change, what are the major differences between these algorithms? What are the pros/cons? Which is faster, and which will generate a superior path?

share|improve this question
    
The authors of Theta* have an alteration of Theta* called Phi* that can quickly recalculate the path after grid-changes. I haven't read the paper for Field D*, so I'm not sure what the difference between the two is yet. I've been meaning to do that anyways; I'll try to at least skim it in the next few days for you. –  BlueRaja - Danny Pflughoeft Feb 25 '13 at 17:43
    
Please provide references for the Theta* and Field D* algorithms. The question suggests that you think A* is limited to path-finding in a grid, which is simply not true; A* is a heuristic for quickly finding shortest paths in arbitrary graphs. –  JɛffE Feb 25 '13 at 20:39

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.