andy
3606944190
Affected files: .obsidian/graph.json .obsidian/workspace-mobile.json .obsidian/workspace.json Food/Meal Plan.md Lab/Linux/Alpine.md Lab/Linux/KDE.md Lab/Scratch Domain.md Lab/Windows/Active Directory.md Languages/Spanish/README.md Languages/Spanish/Spanish.md Money/Accounts.md Money/Monthly/23-04.md Money/Monthly/23-05.md Money/Monthly/23-06.md Projects/Mixonomer.md Projects/NoteCrawler.md Projects/Projects.md Projects/README.md Projects/Selector.md Projects/To Do App.md Projects/img/selector-arch.png STEM/AI/Classification/Supervised/SVM.md STEM/AI/Neural Networks/CNN/FCN/Super-Resolution.md STEM/AI/Neural Networks/CNN/GAN/GAN.md STEM/AI/Neural Networks/CNN/GAN/cGAN.md STEM/AI/Neural Networks/CNN/Interpretation.md STEM/AI/Neural Networks/Deep Learning.md STEM/AI/Neural Networks/MLP/MLP.md STEM/AI/Neural Networks/Properties+Capabilities.md STEM/AI/Neural Networks/RNN/Representation Learning.md STEM/AI/Pattern Matching/Markov/Markov.md STEM/AI/Searching/Informed.md STEM/AI/Searching/README.md STEM/AI/Searching/Searching.md STEM/AI/Searching/Uninformed.md STEM/CS/Languages/Javascript.md STEM/CS/Languages/Python.md STEM/CS/Languages/dotNet.md STEM/CS/Resources.md STEM/IOT/Cyber-Physical Systems.md STEM/IOT/Networking/Networking.md STEM/IOT/Networking/README.md STEM/IOT/Software Services.md STEM/img/cyberphysical-social-data.png STEM/img/cyberphysical-system-types.png STEM/img/cyberphysical-systems.png STEM/img/depth-first-cons.png STEM/img/depth-first.png STEM/img/iot-mesh-network.png STEM/img/iot-network-radar.png STEM/img/iot-network-types 1.png STEM/img/iot-network-types.png STEM/img/markov-start-end-matrix.png STEM/img/markov-start-end-probs.png STEM/img/markov-start-end.png STEM/img/markov-state-duration.png STEM/img/markov-state.png STEM/img/markov-weather.png STEM/img/search-bidirectional.png STEM/img/search-breadth-first.png STEM/img/search-lim-goal.png STEM/img/search-lim1.png STEM/img/search-lim2.png STEM/img/search-lim3-2.png STEM/img/search-lim3.png STEM/img/search-lim4.png STEM/img/searching-graph-tree.png STEM/img/searching-graph.png Work/Freelancing.md
1023 B
1023 B
Best First
- Uniform cost uses an evaluation function
- Doesn't necessarily direct towards goal
- Doesn't know how far to goal
- Only cost so far
- Still blind
- Look forward
- Lot of techniques aiming to define best node
- Expand node closest to goal
- Greedy
- Expand node on least cost solution path
- A*
Greedy
- Estimate distance to goal
- Often can't determine exactly
- This cost is a heuristic
- Could be crow-flies distance
- Expand nodes in increasing order of heuristic cost
- Fast
- Not optimal
- Simple heuristic
A*
- Combines advantages of uniform cost and greedy search
- Optimal & Complete
h(n)- Estimate of distance to goal
- Greedy
g(n)- Cost of cumulative path
- Uniform cost
f(n)=g(n)+h(n)- Heuristic must be admissible
- Underestimates the distance to the goal
- Never overestimates
- Monotonic
- Expand other low cost paths
- Pathmax
- For heuristics which might not be monotonic
- Select last option if going in wrong direction