RMA*
Abstract
Pathfinding is a problem that has been researched for decades. There are still however areas for improvement. Restricting the memory used is one such area. This chapter presents Restricted Memory A* (RMA*), which builds upon the A* algorithm but looks to cap the number of nodes that can be stored in memory at any one time. This speeds up the search time and reduces the memory requirements. RMA* has been tested in random grid-based environments, showing positive improvements upon the standard A* algorithm.
Fields of Study & Subjects
Robotic Path Planning Algorithms
Artificial Intelligence in Games
AI-based Problem Solving and Planning
Publication details
- Journal / source
- CRC Press eBooks
- Pages
- 256–268
- Publication date
- 4 March 2026
- Language
- EN
- Document type
- Book chapter