I used the basic concept of GA to minimize the distance in pathfinding problems. Here are some results showing how average distance and minimum distance changed with each generation. I used 90% crossover and 10% mutation throughout the evolution process. Distance values I used in this example are between 0 to 100 and 50% nodes are connected.
-
Notifications
You must be signed in to change notification settings - Fork 0
IsuruKalhara/ga_path_planner_python
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
Genetic Algorithm based path finding app. Trying to minimize the distance.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published