Developed a continuous-space Genetic Algorithm (GA) solution for finding collision-free paths in highly cluttered environments while minimizing path length. This project was submitted as the final assignment for CS 686: Introduction to Artificial Intelligence at the University of Waterloo.
For an in-depth explanation of the algorithm and its implementation, refer to the paper titled "A Genetic Algorithm Approach to Path Planning in Cluttered 2D Environments" available in this repository. An example path found is shown below:
