-
Notifications
You must be signed in to change notification settings - Fork 0
This Java-based project aims to efficiently solve the robot pathfinding problem, calculating the path that a robot should take to minimize energy consumption while moving from the top-left corner to the bottom-right corner of a square grid of size n x n. The problem is solved using Dynamic Programming, specifically employing a bottom-up approach.
emflynn13/robot_moving
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
About
This Java-based project aims to efficiently solve the robot pathfinding problem, calculating the path that a robot should take to minimize energy consumption while moving from the top-left corner to the bottom-right corner of a square grid of size n x n. The problem is solved using Dynamic Programming, specifically employing a bottom-up approach.
Topics
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published