A-Star Path Planning (Making Obstacle and Random Obstacle)

Versión 1.0.0 (3,32 KB) por Putu Fadya
A-Star (A*) Path Planning is a widely used algorithm for finding the shortest path between two points in a grid while avoiding obstacles.
5.0
(1)
31 Descargas
Actualizado 5 dic 2024

Ver licencia

A-Star (A*) Path Planning is a widely used algorithm for finding the shortest path between two points in a grid while avoiding obstacles. It combines the advantages of Dijkstra's algorithm and a heuristic approach, making it efficient for many robotics and navigation applications
1. Grid Initialization:
  • Create a grid that represents the environment. Each cell in the grid can either be free (traversable) or occupied (an obstacle).
  • Define the start and goal positions in the grid.
2. Obstacle Creation:
  • Manual Obstacles: Specify cells in the grid as obstacles by marking them as "occupied."
  • Random Obstacles: Generate obstacles randomly by selecting cells in the grid based on a probability or specific criteria.

Citar como

Putu Fadya (2025). A-Star Path Planning (Making Obstacle and Random Obstacle) (https://la.mathworks.com/matlabcentral/fileexchange/176964-a-star-path-planning-making-obstacle-and-random-obstacle), MATLAB Central File Exchange. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R2021b
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Etiquetas Añadir etiquetas

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versión Publicado Notas de la versión
1.0.0