Memory-Bounded A*

Summary

Memory-Bounded A is an informed search algorithm^[1]. Memory-Bounded A is known by 4 alternative names across languages and contexts.^[2]

Key Facts

• Memory-Bounded A*'s instance of is recorded as informed search algorithm^[3].
• Memory-Bounded A*'s instance of is recorded as pathfinding algorithm^[4].
• A search algorithm is named after Memory-Bounded A^[5].
• Memory-Bounded A's based on is recorded as A search algorithm^[6].
• Memory-Bounded A's subclass of is recorded as A search algorithm^[7].
• Memory-Bounded A*'s described by source is recorded as Artificial Intelligence: A Modern Approach^[8].
• Memory-Bounded A's different from is recorded as Simplified Memory-Bounded A^[9].
• Memory-Bounded A*'s computes solution to is recorded as shortest path problem^[10].

Body

Designation and Status

Recorded instance of include informed search algorithm^[3] and pathfinding algorithm^[4].

History and Context

A search algorithm is named after Memory-Bounded A^[5].

Why It Matters

Memory-Bounded A* is known by 4 alternative names across languages and contexts.^[2]