https://github.com/walid-git/pathplanner

A graphical tool to simulate robot path planning with obstacles using two different algorithms : Dijkstra and A*
https://github.com/walid-git/pathplanner

astar-algorithm astar-java dijkstra-algorithm dijkstra-gui dijkstra-shortest-path java javafx path-planning pathfinding shortest-path-algorithm shortest-paths

Last synced: about 2 months ago
JSON representation

A graphical tool to simulate robot path planning with obstacles using two different algorithms : Dijkstra and A*

• Host: GitHub
• URL: https://github.com/walid-git/pathplanner
• Owner: walid-git
• License: mit
• Created: 2019-03-29T18:54:17.000Z (over 6 years ago)
• Default Branch: tmp
• Last Pushed: 2019-04-16T09:38:42.000Z (over 6 years ago)
• Last Synced: 2025-05-15T22:40:19.262Z (6 months ago)
• Topics: astar-algorithm, astar-java, dijkstra-algorithm, dijkstra-gui, dijkstra-shortest-path, java, javafx, path-planning, pathfinding, shortest-path-algorithm, shortest-paths
• Language: Java
• Size: 3.37 MB
• Stars: 7
• Watchers: 0
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# PathPlanner

A graphical tool to simulate robot path planning with obstacles using two different algorithms : Dijkstra and A*

![](pathFinder.gif)

This program is developed using javaFx, it allows you to select a starting point in the map and then set the destination to start the path search algorithm. The two available algorithms are Dijkstra and A*.

![](pathFinder1.gif)

You can draw your own obstacles map and save it to use it later. 

![](mapSaving.gif)

The source code is available in the src/sample directory.

You can execute it directly using the executable jar file is in the Jar directory.