You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.