Skip to content

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.

Notifications You must be signed in to change notification settings

emflynn13/robot_moving

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit
 
 

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

No packages published

Languages