ANN algorithms for optimal path searching
<p>all. These days I've met a question on data analysis. I want to search an optimal path on a 3D landscape-like graph from a user-defined starting point to an end point. I've achieved it using rainfall algorithm and flood-fill algorithm before. Recently, I've heard about some aspect of machine-learning and artificial neural network and their ability in data analysis, so I want to know if there are some algorithms can be used for solving this problem.<br>
Here is the description of my question: I have a 2D plain, say x-y plain. On the x axis, there are <code>m</code> points averagely distributed from <code>0</code> to <code>m_max</code>. For the same, there are <code>n</code> points averagely distributed from <code>0</code> to <code>n_max</code> on y axis. So there are <code>m*n</code> points on the plain and each point has different value <code>E_mn</code>. Then I have 3D landscape. For the definition of optimal path is that on this path from a starting point to the end point the maximum value is lowest among all the other paths and the length of the optimal path should be the shortest(shortest means minimum points it passed. If shortest can not be achieve easily, it's OK for only lowest.)</p>