Heuristic Search Algorithms
Four-dimensional A-star
Introduced by Giorgio et al. in Artificial Intelligence Control in 4D Cylindrical Space for Industrial Robotic ApplicationsThe aim of 4D A* is to find the shortest path between two four-dimensional (4D) nodes of a 4D search space - a starting node and a target node - as long as there is a path. It achieves both optimality and completeness. The former is because the path is shortest possible, and the latter because if the solution exists the algorithm is guaranteed to find it.
Source: Artificial Intelligence Control in 4D Cylindrical Space for Industrial Robotic Applications
Papers
| Paper | Code | Results | Date | Stars |
|---|
Tasks
| Task | Papers | Share |
|---|---|---|
| Industrial Robots | 1 | 33.33% |
| Motion Planning | 1 | 33.33% |
| Trajectory Planning | 1 | 33.33% |
Usage Over Time
Components
| Component | Type |
|
|---|---|---|
| 🤖 No Components Found | You can add them if they exist; e.g. Mask R-CNN uses RoIAlign |
