Course from NTNU
Performed path planning through genetic algorithms in self-created scenarios, and compare different path-planning algorithm (A*).
- FlowChart:
- Result:
𝑓𝑖𝑡 = 𝑟1 ∗ 𝑝𝑎𝑡ℎ_𝑑𝑖𝑠𝑡𝑎𝑛𝑐𝑒 + 𝑟2 ∗ 𝑝𝑎𝑡ℎ_𝑠𝑚𝑜𝑜𝑡ℎ
When 𝑟1 = 1, 𝑟2 = 0, population = 40, Pc = 0.5, Pm = 0.8, iteration = 30
When 𝑟1 = 5, 𝑟2 = 2, population = 40, Pc = 0.5, Pm = 0.8, iteration = 30
When 𝑟1 = 5, 𝑟2 = 2, population = 40, Pc = 0.5, Pm = 0.8, iteration = 30