A-Star Algorithm MATLAB Implementation

This repository contains the MATLAB implementation of a* (A-Star) search algorithm.

Introduction

A* search algorithm is a heuristic search algorithm used to find the shortest path between two points. It uses both cost and heuristic function to evaluate the best path. In this implementation, the heuristic function used is Euclidean distance.

Requirements

• MATLAB

How to use

1. Clone the repository.
2. Open the script a_star_algorithm.m in MATLAB.
3. Change the start and goal points according to your need.
4. Run the script.
5. The output will consist of the shortest path and the cost to reach the goal.

Implementation Details

The implementation is based on a grid map where each cell can be either free or occupied. The cost of moving between two adjacent cells is one. If a cell is occupied then it has an infinite cost.

The heuristic function used is Euclidean distance which can be easily changed according to the user's preference.

References

1. Wikipedia-A* search algorithm
2. MATLAB documentation