|
|
|
|
|
by light_hue_1
847 days ago
|
|
There's absolutely no way it reduces search time. A* is trivial to run per timestep. The time must be thousands to maybe hundreds of thousands of times slower. I publish in this area and this is a common thing for reviewers to bring up when authors don't report wall clock time. And then for papers to be rejected. What's the value in making an algorithm that's drastically slower? Not much. |
|
Perhaps as an important stepping stone? Deferred optimization and all that.