Scribd
Upload
5 views7 pages

Global College of Science and Technology

The document is a report on the A* search algorithm, detailing its function as an efficient method for finding the shortest path in a graph. It covers the algorithm's workings, advantages, disadvantages, limitations, and applications in fields like video games and robotics. The conclusion emphasizes A*'s effectiveness and versatility, while also acknowledging its memory usage and reliance on heuristic quality.

Uploaded by

darkside9547
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views7 pages

Global College of Science and Technology

The document is a report on the A* search algorithm, detailing its function as an efficient method for finding the shortest path in a graph. It covers the algorithm's workings, advantages, disadvantages, limitations, and applications in fields like video games and robotics. The conclusion emphasizes A*'s effectiveness and versatility, while also acknowledging its memory usage and reliance on heuristic quality.

Uploaded by

darkside9547
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 7

GLOBAL COLLEGE OF SCIENCE AND TECHNOLOGY

NAME : SOUMYADEEP GHOSH


PAPER CODE : BDS302
ROLL NO : 34540523013
REG. NO : 233452410084 (202324)
SUBJECT : ARTIFICIAL INTELLIGENCE & MACHINE
LEARNING – 1
TOPIC : REPORT ON A* SEARCH ALGORITHM
DEPERMENT : B.Sc. In Data Science
CONTENT

LIST OF TABLES PAGE NO.


Acknowledgement 3
Introduction 4
How It Works 4
Algorithm Steps 4-5
Advantages 5
Disadvantages 5-6
Limitations 6
Applications 6
Conclusion 7
ACKNOWLEDGEMENT

I would like to express my deep and sincere gratitude to my


research supervisor, whose guidance and feedback have been
crucial throughout the entire project. Their expertise and
unwavering support significantly enriched the depth and
quality of my work. I would like to acknowledge the constant
encouragement and understanding from my family and
friends. Their unwavering support provided the emotional
strength needed to navigate the challenges associated with
this endeavor.
A* Search Algorithm

Introduction
The A* search algorithm is a popular and efficient method
used for finding the shortest path from a start node to a goal
node in a graph. It combines features of Dijkstra's algorithm
and greedy best-first search to provide an optimal and
complete solution for pathfinding.

How It Works
Nodes and Costs: Each node in the search space has a cost
associated with it. The total cost of a node is represented by
the function f(n)=g(n)+h(n):
 g(n): The cost from the start node to the current node n.
 h(n): The heuristic estimate of the cost from node n to
the goal node. This heuristic helps guide the search.

Algorithm Steps
 Initialization: Start by adding the initial node to an open
list (nodes to be evaluated) and an empty closed list
(nodes already evaluated).
 Evaluation: While there are nodes in the open list:
 Remove the node with the lowest f(n) value.
 If this node is the goal node, the path has been
found.
 Otherwise, generate its neighbors, calculate
their costs, and update their values if a
cheaper path is found.
 Move the node to the closed list to prevent re-
evaluation.
 Path Construction: If the goal node is reached, backtrack
from the goal to the start to reconstruct the path.

Advantages
 Optimality: A* finds the shortest path if the heuristic is
admissible (i.e., it never overestimates the true cost).
 Efficiency: Balances exploration and exploitation, making
it faster than exhaustive search methods.

Disadvantages
 High Memory Use: A* needs to keep track of many
nodes, which can use up a lot of memory, especially for
large problems.
 Can Be Slow: For very large or complex problems, A*
might take a long time to find a solution because it
processes many nodes.
 Not Ideal for Changing Environments: A* assumes the
environment doesn’t change during the search. It’s less
effective if obstacles or costs change.
 Large Search Spaces: In huge or complex spaces, A* can
become slow and inefficient as it has to explore many
possibilities.
Limitations
 Memory Usage: Can be memory-intensive as it needs to
store all nodes in the open list.
 Heuristic Dependence: The performance is dependent
on the choice of heuristic function.

Applications
 Video Games: For character and vehicle movement.
 Robotics: For navigation and obstacle avoidance.
 Routing: In GPS and mapping systems for finding
efficient routes.

Conclusion
The A* search algorithm is a powerful tool for finding the
shortest path in various applications, from video games to
robotics. It combines efficiency with optimality by using a
heuristic to guide the search process. This makes it faster
than some other algorithms and ensures that it finds the best
path when a good heuristic is used. However, A* does have
some limitations. It can use a lot of memory, relies heavily on
the quality of the heuristic, and may be slow for very large or
dynamic environments. Despite these challenges, A* remains
a popular choice due to its effectiveness and versatility in
many pathfinding problems.

You might also like