92614a29b2 cse598/mt1/AI_midterm_notes.md Go to file vivin notes Latest commit e5a5126 on Mar 5, 2015 History 1 contributor 446 lines (309 sloc) 38.3 KB Raw Blame AgentsAgent perceives its environment therough sensors and acts upon that environment through actuators. A percept re...
proto Basic Midterm Mar 29, 2019 .gitattributes Initial commit Mar 5, 2019 .gitignore update .gitignore Mar 28, 2019 Control_Robots.py commit Mar 28, 2019 Final-test.py Merge branch 'master' into hu Apr 7, 2019 Midterm-beta.py add RRT for global path planning Apr 7, 2019 Obstacle.py...
The algorithm does this by gradually increasing the depth (first 0, then 1, then 2, and so on) until a node is found. This occurs when the depth limit reaches d, the depth of the shallowest goal-node. Iterative deepening combines the benefits of DFS and BFS.Completeness: It is ...