https://github.com/hirudikaanupama/autonomous-robot-path-planning-program
A program to find the shortest path between a start and a target location
https://github.com/hirudikaanupama/autonomous-robot-path-planning-program
breadth-first-search data-structures-and-algorithms graph-algorithms java linked-list object-oriented-programming queue
Last synced: 2 months ago
JSON representation
A program to find the shortest path between a start and a target location
- Host: GitHub
- URL: https://github.com/hirudikaanupama/autonomous-robot-path-planning-program
- Owner: HirudikaAnupama
- Created: 2024-06-19T08:11:46.000Z (12 months ago)
- Default Branch: master
- Last Pushed: 2024-10-23T15:07:44.000Z (8 months ago)
- Last Synced: 2024-10-23T18:59:46.160Z (8 months ago)
- Topics: breadth-first-search, data-structures-and-algorithms, graph-algorithms, java, linked-list, object-oriented-programming, queue
- Language: Java
- Homepage:
- Size: 37.1 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
Path Finding Program
Finds the shortest path through a grid network based on the entered origin and destination
## Introduction
This java program consists of 7 classes and can be easily debugged, developed and updated.
#### _GridRepresentation_
This class represents the grid network implementation.
Generates grid newtwork with coordinates after entering grid size.
#### _SetObstacles_
This class represents the implementation of the obstacle placement algorithm.
Generates grid newtwork with obstacles after entering obstacle count and placement.
#### _SetRobotStates_
This class represents the implementation of placing starting and goal placement algorithm.
Generates grid newtwork with starting and goal point after entering starting and goal point coordinates.
#### _PathFindingAlgorithm_
This class represents the implementation of breadth first search graph algorithm.
The program generates the shortest path from the start point to the end point given the grid size, obstacle coordinates, start and goal point coordinates.
#### _CustomLinkedList_
This class represents the custom linked list implimentation for storing the shortest path coordinates.Linked list can dynamically adjust the size of nodes.
#### _CustomQueue_
This class represents a custom queue implementation for breadth-first search. The queue follows the principle of first-come-first-served, which helps implement a breadth-first search.
## More information on functionality
From these links, you can watch videos on how to run the program and how it works.
- Youtube - https://youtu.be/MLuandDnpAQ?si=Laao4fKj8lIn8Ln4
- Tik tok - https://www.tiktok.com/@hirudika_anupama/video/7382702601244134663?lang=en
## Key Features
- Implementation of data structures and algorithms
- Correct handling and use of Java Object Oriented Programming concepts
- Correctly building a code from scratch.
## Installation
- **First of all you need to install git and java into your computer**.
- **Then open command prompt and select your project installation directory as below code,**
_cd "At this point you must provide your directory"_
Eg : _cd desktop_
- **Then place this code. After executing this code the project is in the selected directory.**
_git clone https://github.com/HirudikaAnupama/path-finding-program.git_
- **Then navigate to the installed project src folder using command prompt.**
Eg : _cd C:\Users\LENOVO\Desktop\path-finding-program\src_
- **After you can place these commands seperatly.**
_javac PathFindingProgram\*.java_
_java PathFindingProgram.Main_
## Contact
- Author: Hirudika Anupama
- Email: [email protected]
- GitHub: https://github.com/HirudikaAnupama