Skip to main content
Computer Science

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

2
  • $\begingroup$ I actually did the search already and found similar questions. For example, cs.stackexchange.com/questions/7250/…. The common suggestion is to use D* algorithm. That's okay as an answer, I will look more into this domain. But as far as I know these algorithms are more general than what I'm asking, because they allow for more updates (edge/node deletions, etc.). They also deal with discrete times when to stop searching, while I have O-notation on time. Are there any suggestions how this particular problem can be solved more efficiently. $\endgroup$ Commented Oct 26, 2015 at 18:09
  • $\begingroup$ @novadiva, for future reference: we expect you to tell us in the question what research you've already done, and what approaches you've already considered and rejected (and why). If you've already found something but don't tell us about it, then you risk wasting answerers time when they write an answer mentioning that thing you already knew about... At this point I suggest editing your question to list the best algorithm you currently know of, and to ask whether there exists a more efficient algorithm -- be sure to tell also tell us what metric for efficiency you want us to use. $\endgroup$ Commented Oct 26, 2015 at 18:11