|
7 | 7 | "RB-1018-dijkstra-algorithm" |
8 | 8 | ], |
9 | 9 | "wiki_links": [ |
10 | | - "Heuristic Methods", |
11 | | - "Russell & Norvig Artificial Intelligence Modern Approach", |
12 | | - "Cormen Introduction to Algorithms", |
13 | | - "Informed Search Strategy", |
14 | | - "AlgorithmicFramework", |
15 | | - "Hash Table", |
16 | | - "International Planning Competition", |
17 | | - "Video Game AI", |
18 | | - "Heuristic Search", |
19 | | - "Data Structures", |
20 | | - "Informed Search", |
21 | | - "Iterative Deepening A*", |
22 | | - "Evaluation Function", |
23 | | - "Admissible Heuristic", |
24 | | - "Algorithmic Efficiency", |
25 | | - "Optimal Pathfinding", |
26 | | - "Google Maps Platform", |
27 | | - "Graph Theory", |
28 | | - "Graph Algorithms", |
29 | | - "Search Algorithms", |
30 | | - "Distance Heuristics", |
31 | | - "Best-First Search", |
| 10 | + "Path Reconstruction", |
| 11 | + "Bidirectional Search", |
| 12 | + "Hart, Nilsson, Raphael 1968 Formal Basis for Heuristic Determination", |
32 | 13 | "Open Set", |
33 | | - "AlgorithmicLayer", |
34 | 14 | "Pathfinding", |
35 | | - "Graph Representation", |
36 | | - "Priority Queue Data Structure", |
37 | | - "Uniform Cost Search", |
38 | | - "Dijkstra's Algorithm", |
| 15 | + "Cost Function", |
| 16 | + "AlgorithmicLayer", |
39 | 17 | "Autonomous Navigation", |
40 | | - "Bidirectional Search", |
41 | | - "ApplicationLayer", |
42 | | - "Greedy Best-First Search", |
43 | | - "Closed Set", |
44 | 18 | "Unity Technologies NavMesh Documentation", |
45 | | - "Motion Planning", |
| 19 | + "Heuristic Function", |
| 20 | + "ApplicationLayer", |
| 21 | + "Priority Queue", |
46 | 22 | "Optimal Path Discovery", |
47 | | - "Heuristic Evaluation", |
48 | | - "Goal-Directed Search", |
49 | | - "ROS Navigation Stack", |
50 | | - "AI-GroundedDomain", |
| 23 | + "Heuristic Search", |
| 24 | + "Robotics Industry Association Automation Statistics", |
| 25 | + "Optimization Algorithms", |
| 26 | + "Hash Table", |
51 | 27 | "Graph Data Structure", |
52 | | - "Cost Function", |
53 | | - "Logistics Optimization", |
54 | | - "Node Expansion", |
55 | | - "Navigation", |
56 | | - "Hart, Nilsson, Raphael 1968 Formal Basis for Heuristic Determination", |
57 | | - "Distance Metric", |
58 | | - "Breadth-First Search", |
| 28 | + "Heuristic Evaluation", |
| 29 | + "Motion Planning", |
| 30 | + "Russell & Norvig Artificial Intelligence Modern Approach", |
59 | 31 | "ComputationAndIntelligenceDomain", |
60 | | - "Robotics Industry Association Automation Statistics", |
61 | 32 | "Network Routing", |
| 33 | + "Heuristic Methods", |
| 34 | + "Node Expansion", |
| 35 | + "Algorithmic Efficiency", |
| 36 | + "ROS Navigation Stack", |
62 | 37 | "Route Planning", |
63 | | - "Priority Queue", |
64 | | - "Heuristic Function", |
65 | | - "Path Reconstruction", |
66 | | - "Optimization Algorithms", |
67 | | - "Robotics Control" |
| 38 | + "Distance Metric", |
| 39 | + "Data Structures", |
| 40 | + "Breadth-First Search", |
| 41 | + "Graph Representation", |
| 42 | + "Navigation", |
| 43 | + "Priority Queue Data Structure", |
| 44 | + "Dijkstra's Algorithm", |
| 45 | + "AlgorithmicFramework", |
| 46 | + "Optimal Pathfinding", |
| 47 | + "Admissible Heuristic", |
| 48 | + "Best-First Search", |
| 49 | + "Iterative Deepening A*", |
| 50 | + "Logistics Optimization", |
| 51 | + "AI-GroundedDomain", |
| 52 | + "Evaluation Function", |
| 53 | + "Goal-Directed Search", |
| 54 | + "Distance Heuristics", |
| 55 | + "Uniform Cost Search", |
| 56 | + "Informed Search Strategy", |
| 57 | + "Video Game AI", |
| 58 | + "Greedy Best-First Search", |
| 59 | + "Google Maps Platform", |
| 60 | + "Search Algorithms", |
| 61 | + "Closed Set", |
| 62 | + "Graph Theory", |
| 63 | + "International Planning Competition", |
| 64 | + "Robotics Control", |
| 65 | + "Informed Search", |
| 66 | + "Graph Algorithms", |
| 67 | + "Cormen Introduction to Algorithms" |
68 | 68 | ], |
69 | 69 | "ontology": { |
70 | 70 | "term_id": "AI-1004", |
|
0 commit comments