2 ms·
Couple issues. (1) Optimization is much, much bigger than graph traversal and sorting. (2) Modern route-finding algorithms are to your on-paper-Dijkstra what
by bo1024 6y ago
Couple issues.
(1) Optimization is much, much bigger than graph traversal and sorting.
(2) Modern route-finding algorithms are to your on-paper-Dijkstra what a rocket ship is to your bicycle.
(3) I think you're under the same misconception I'm talking about: graph traversal is absolutely a fundamental of AI. Ask anyone what the main AI textbook is, they'll tell you it's Russell and Norvig: http://aima.cs.berkeley.edu/ http://aima.cs.berkeley.edu/
The first topic they cover is graph traversal and search.
- TeMPOraL 6y ago> (2) Modern route-finding algorithms are to your on-paper-Dijkstra what a rocket ship is to your bicycle. Let's not get ahead of ourselves. Modern path-finding algorithms are Dijkstra + lots of heuristics piled on top. > graph traversal is absolutely a fundamental of AI. I agree. But being a fundamental of AI does not make it AI itself.
- angry_octet 6y agoDijkstra + hacks is a rather unjust simplification... Some good examples of modern approaches, though a bit dated now: http://algo2.iti.kit.edu/routeplanning.php http://algo2.iti.kit.edu/routeplanning.php Relevant conf: https://icaps20.icaps-conference.org/ https://icaps20.icaps-conference.org/ (ML techniques are increasingly being used to solve these problems, and graph algorithms are used in ML, but are not AI/ML.)
- kinkrtyavimoodh 6y agoAnd a rocket is Newton's laws + lots of heuristics piled on top. Sometimes the heuristics ARE the point.
- pathseeker 6y agoSure, but they certainly aren't AI. They were written by people and do not learn based on new inputs.
- pathseeker 6y ago>graph traversal is absolutely a fundamental of AI A is fundamental of B does not mean B is A.