algorithm - A* search variance -


i'm looking path searching algorithm similar a* search, taking account integral function on searched path. in particular, here problem:

for each point p in search space, there function f(p). along path ab, can integrate ![formula](https://chart.googleapis.com/chart?cht=tx&chl=%5cint_%7ba%7d%5e%7bb%7d%20f(p)) (an energy spent on path). need find optimal path spend less total energy.

an a* search algorithm ask admissible h(n) - heuristic estimates cost of cheapest path n goal. i, however, couldn't find admissible function that.

any direction appreciated.


Comments

Popular posts from this blog

android - InAppBilling registering BroadcastReceiver in AndroidManifest -

python Tkinter Capturing keyboard events save as one single string -

sql server - Why does Linq-to-SQL add unnecessary COUNT()? -