matlab广度优先算法代码-Artificial_Intelligence_MATLAB:用MATLAB编码的人工智能算法

[{"title":"（ 64 个子文件 267KB ） matlab广度优先算法代码-Artificial_Intelligence_MATLAB:用MATLAB编码的人工智能算法","children":[{"title":"Artificial_Intelligence_MATLAB-master","children":[{"title":"decision_trees","children":[{"title":"count_tree_nodes.m <span style='color:#111;'> 395B </span>","children":null,"spread":false},{"title":"TreeNode.m <span style='color:#111;'> 537B </span>","children":null,"spread":false},{"title":"plot_decision_tree.m <span style='color:#111;'> 989B </span>","children":null,"spread":false},{"title":"roshambo.m <span style='color:#111;'> 2.08KB </span>","children":null,"spread":false},{"title":"part_01_example.m <span style='color:#111;'> 2.18KB </span>","children":null,"spread":false},{"title":"learn_decision_tree.m <span style='color:#111;'> 3.50KB </span>","children":null,"spread":false},{"title":"dt_intrinsic_info.m <span style='color:#111;'> 986B </span>","children":null,"spread":false},{"title":"dt_cond_entropy.m <span style='color:#111;'> 1.37KB </span>","children":null,"spread":false},{"title":"dt_entropy.m <span style='color:#111;'> 1.00KB </span>","children":null,"spread":false},{"title":"score_roshambo.m <span style='color:#111;'> 1.16KB </span>","children":null,"spread":false},{"title":"dt_info_gain.m <span style='color:#111;'> 800B </span>","children":null,"spread":false},{"title":"query_decision_tree.m <span style='color:#111;'> 1.42KB </span>","children":null,"spread":false},{"title":"dt_gain_ratio.m <span style='color:#111;'> 782B </span>","children":null,"spread":false}],"spread":false},{"title":"markov_decision_process","children":[{"title":"grid_world_setup.m <span style='color:#111;'> 954B </span>","children":null,"spread":false},{"title":"mdp_solve_bellman_operator.m <span style='color:#111;'> 1.03KB </span>","children":null,"spread":false},{"title":"cleaning_transition_model.m <span style='color:#111;'> 971B </span>","children":null,"spread":false},{"title":"part_01_example.m <span style='color:#111;'> 689B </span>","children":null,"spread":false},{"title":"mdp_get_optimal_policy.m <span style='color:#111;'> 1.15KB </span>","children":null,"spread":false},{"title":"mdp_solve_policy_iteration.m <span style='color:#111;'> 1.74KB </span>","children":null,"spread":false},{"title":"mdp_solve_policy_evaluation.m <span style='color:#111;'> 1.11KB </span>","children":null,"spread":false},{"title":"mdp_solve_value_iteration.m <span style='color:#111;'> 1.43KB </span>","children":null,"spread":false}],"spread":true},{"title":"search_algorithms","children":[{"title":"bidirectional_search.m <span style='color:#111;'> 4.13KB </span>","children":null,"spread":false},{"title":".DS_Store <span style='color:#111;'> 6.00KB </span>","children":null,"spread":false},{"title":"SearchProblem.m <span style='color:#111;'> 1.88KB </span>","children":null,"spread":false},{"title":"breadth_first_search.m <span style='color:#111;'> 1.50KB </span>","children":null,"spread":false},{"title":"submit_search_hardness.m <span style='color:#111;'> 335B </span>","children":null,"spread":false},{"title":"part2_example.m <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"DoubleQueue.m <span style='color:#111;'> 2.78KB </span>","children":null,"spread":false},{"title":"part1_example.m <span style='color:#111;'> 521B </span>","children":null,"spread":false},{"title":"PriorityQueue.m <span style='color:#111;'> 4.35KB </span>","children":null,"spread":false},{"title":"NetworkSearchProblem.m <span style='color:#111;'> 1.14KB </span>","children":null,"spread":false},{"title":"data","children":[{"title":"stanford_large_network_facebook_combined.txt <span style='color:#111;'> 834.34KB </span>","children":null,"spread":false},{"title":".DS_Store <span style='color:#111;'> 6.00KB </span>","children":null,"spread":false}],"spread":true},{"title":".gitignore <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"a_star_search.m <span style='color:#111;'> 2.50KB </span>","children":null,"spread":false},{"title":"Node.m <span style='color:#111;'> 398B </span>","children":null,"spread":false},{"title":"GridSearchProblem.m <span style='color:#111;'> 2.65KB </span>","children":null,"spread":false}],"spread":false},{"title":"README.md <span style='color:#111;'> 493B </span>","children":null,"spread":false},{"title":"planning_algorithms","children":[{"title":"part_02_example.m <span style='color:#111;'> 339B </span>","children":null,"spread":false},{"title":".DS_Store <span style='color:#111;'> 6.00KB </span>","children":null,"spread":false},{"title":"rrt_dubins.m <span style='color:#111;'> 3.63KB </span>","children":null,"spread":false},{"title":"part_01_example.m <span style='color:#111;'> 575B </span>","children":null,"spread":false},{"title":"DoubleQueue.m <span style='color:#111;'> 2.78KB </span>","children":null,"spread":false},{"title":"plot_n_queens.m <span style='color:#111;'> 598B </span>","children":null,"spread":false},{"title":"initialize_greedy_n_queens.m <span style='color:#111;'> 1.68KB </span>","children":null,"spread":false},{"title":"count_conflicts_n_queens.m <span style='color:#111;'> 1.21KB </span>","children":null,"spread":false},{"title":"min_conflicts_n_queens.m <span style='color:#111;'> 3.25KB </span>","children":null,"spread":false},{"title":"inference_method.m <span style='color:#111;'> 2.02KB </span>","children":null,"spread":false},{"title":"dubins","children":[{"title":"poly_triangle.m <span style='color:#111;'> 189B </span>","children":null,"spread":false},{"title":"check_free_space.m <span style='color:#111;'> 1.48KB </span>","children":null,"spread":false},{"title":"check_dubins_collision.m <span style='color:#111;'> 3.73KB </span>","children":null,"spread":false},{"title":"check_collision_count.m <span style='color:#111;'> 1.96KB </span>","children":null,"spread":false},{"title":"dubins_shortest.m <span style='color:#111;'> 4.21KB </span>","children":null,"spread":false},{"title":"plot_obstacle_poly.m <span style='color:#111;'> 660B </span>","children":null,"spread":false},{"title":"plot_dubins_path.m <span style='color:#111;'> 3.64KB </span>","children":null,"spread":false},{"title":"plot_rrt_dubins.m <span style='color:#111;'> 4.08KB </span>","children":null,"spread":false},{"title":"check_arc_polygon_collision.m <span style='color:#111;'> 5.39KB </span>","children":null,"spread":false},{"title":"dubins_curve.m <span style='color:#111;'> 4.42KB </span>","children":null,"spread":false},{"title":"poly_square.m <span style='color:#111;'> 180B </span>","children":null,"spread":false},{"title":"dubins_search_nearest.m <span style='color:#111;'> 979B </span>","children":null,"spread":false},{"title":"check_line_collision.m <span style='color:#111;'> 1.63KB </span>","children":null,"spread":false}],"spread":false},{"title":".gitignore <span style='color:#111;'> 0B </span>","children":null,"spread":false},{"title":"check_n_queens.m <span style='color:#111;'> 1.17KB </span>","children":null,"spread":false},{"title":"part_03_example.m <span style='color:#111;'> 1.06KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}],"spread":true}]