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

Version 1.0.0 (3,32 KB) von 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)
33 Downloads
Aktualisiert 5. Dez 2024

Lizenz anzeigen

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.

Zitieren als

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

Kompatibilität der MATLAB-Version
Erstellt mit R2021b
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Tags Tags hinzufügen

Community Treasure Hunt

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

Start Hunting!

Version Veröffentlicht Versionshinweise
1.0.0