Get the latest tech news
(Ab)using general search algorithms on dynamic optimization problems (2023)
General Search Algorithms on Dynamic Optimization Problems In retrospect, my most ambitious blog yet. As it goes, I was reading “Artificial Intelligence.
For each algorithm I’ll give a quick refresher on how it works and, fingers crossed, will supply animations to show how it searches the state space. In contrast, the idea of Dijkstra’s algorithm, also known as a uniform-cost search in the AI literature, is to explore the most promising directions first, potentially finding an optimal solution long before the whole state space gets visited. In comparison, barring a few trivial to debug mistakes, I’ve programmed Bellman’s method and Pontryagin’s maximum principle in one go and each within a day.
Or read this on Hacker News