Simulation of robots intelligently moving towards goals/around obstacles (based on Amazon warehouse robots)
Note: This is based on a series of assignments from Joey Freund's 2016 "Introduction to Software Engineering" course at the University of Toronto (although the assignments were written in Java rather than JavaScript).
A grid can be used to represent the floor plan of a warehouse. Grid cells can contains racks.
For example, below is a floor plan of a small, rectangular warehouse containing a few racks.
Robots can move "vertically" and "horizontally" in the grid. A robot may have a destination/goal cell that it attempts to reach.
Where there are multiple robots with goals,
- the path from each robot to its goal is planned, and
- multiple robots attempt reach their goals in parallel
- All robots get to their destination, whenever it is possible
- Robots don’t crash into walls or into one another
- Robots do not take unnecessarily long paths
- Robots do not stand idle when they can move and get closer to their destination
- React + Redux
- path planning algorithm
- robot movement animation
Licensed under the MIT License. See LICENSE for more information.