A Star: Fundamentals and Applications

Because of its completeness, optimality, and optimal efficiency, the A* method, which is employed for graph traversal and path search, is utilized in a variety of subfields within the discipline of computer science. Because it saves all of the created nodes in memory, its space complexity is a significant disadvantage in practical terms. Consequently, in practical travel-routing systems, it is often outperformed by algorithms that can pre-process the graph to achieve higher speed, as well as by approaches that are memory-bounded; despite this, A* is still the best answer in many different scenarios.

How You Will Benefit

(I) Insights, and validations about the following topics:

Chapter 1: A* Search Algorithm

Chapter 2: Graph Theory

Chapter 3: Heuristic in Computer Science

Chapter 4: Best-First Search

Chapter 5: Dijkstra's Algorithm

Chapter 6: Any-Angle Path Planning

Chapter 7: Admissible Heuristic

Chapter 8: Consistent Heuristic

Chapter 9: Memory-Bound Function

Chapter 10: Pathfinding

(II) Answering the public top questions about a star.

(III) Real world examples for the usage of a star in many fields.

(IV) 17 appendices to explain, briefly, 266 emerging technologies in each industry to have 360-degree full understanding of a star' technologies.

Who This Book Is For

Professionals, undergraduate and graduate students, enthusiasts, hobbyists, and those who want to go beyond basic knowledge or information for any kind of a star.