This algorithm was developed to be implemented in the pick and placing operation for a Delta Robot.
The problem is defined a follows.
There exists two types of items inside the workspace of a pick-and-place robot (Delta). They have to be sorted in to two conveyors as shown in the figure. There may exist infinite number of paths when the number of items increases. However, the the robot prefers the shortest path to perform its pick-and-place operation within the shortest time.
The proposed genetic algorithm will calculate preferably most optimized shortest path in a short time, compared to use brute-force (calculate every possible path distance and find out the shortest path).
The fitness function is obviously the length of the path. Single point crossover was used with single point mutation.
This led to my first publication :),,, at ICCAR 2020 at Singapore.
Interested?? Drop a message for any clarification. charithprem@gmail.com
Comments