Тёмный

What are Genetic Algorithms? 

argonaut
Подписаться 942
Просмотров 27 тыс.
50% 1

Welcome to a new series on evolutionary computation!
To start, we'll be introducing genetic algorithms - a simple, yet effective technique for solving difficult computational problems. We'll then visually demonstrate their use with a genetic maze solving simulation.
Source code
↪ Simulations written in Java using Processing.
↪ Genetic Camouflage: github.com/argonautcode/genet...
↪ Genetic Maze Solver: github.com/argonautcode/genet...
Socials
↪ Twitter: / argonautcode
Chapters
00:00 Intro
00:26 Biology
02:05 Genetic Camouflage
06:02 Genetic Maze-Solvers
10:00 Maze-Solvers, Take 2
11:50 Outro

Опубликовано:

 

9 июл 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 37   
@PhaltuManas
@PhaltuManas 2 месяца назад
just found this video while learning genetic algorithms for exams, and can't wait for the next video.😊
@kamikamen_official
@kamikamen_official 5 месяцев назад
Biology meets Computer Science. This is so cool.
@ziad-explains
@ziad-explains Год назад
I am glad to have discovered this channel by chance!
@freedom_aint_free
@freedom_aint_free 3 месяца назад
Wow, it's been year since the last video !? Please keep 'em coming! I could swear that you would show the NEAT algorithm in the next video ? Please do it !
@peralser
@peralser 2 месяца назад
Amazing explanation!! Clear and very useful!! Thanks
@samad.chouihat4222
@samad.chouihat4222 9 месяцев назад
A nice example for explaining local maxima problem.. watching this from the Algerian Sahara, keep uploading videos
@norbert6994
@norbert6994 2 месяца назад
great video! keep up the good work!
@m.sadramahmoudi3262
@m.sadramahmoudi3262 Год назад
That was just wonderful! Thank you for your high-quality work
@onadebt
@onadebt 5 месяцев назад
underrated af
@revimfadli4666
@revimfadli4666 Год назад
I really like how this went from the absolute basics, until the rarely discussed greedy fitness problem
@argonautcode
@argonautcode Год назад
Thank you, I’m glad you liked the explanation!
@revimfadli4666
@revimfadli4666 Год назад
Speaking of neuroevolution maze solver, would you test a maze that doesn't "cheat" by making the longest(highest entropy) path also the correct path(like the example maze in some novelty search papers)? Something like the deceptive tartarus environment perhaps? Though I reckon it might be a tough challenge better saved for later(or even bleeding edge AI research). Having multiple longest paths with only 1 correct answer might be a simpler approach
@argonautcode
@argonautcode Год назад
Very interesting thoughts! I'll be looking into simpler approaches first, as they are easier to explain, but I'll certainly want to revisit more advanced ideas in the future!
@revimfadli4666
@revimfadli4666 Год назад
@@argonautcode you're welcome! I see, guess the maze with multiple longest paths would me more suitable for that
@prestonbourne
@prestonbourne 4 месяца назад
I'd love if you shared how you made the visuals for this video, particularly what'd you use for the fitness function visualizer and statistics
@sAIkeyy
@sAIkeyy 11 месяцев назад
Absolutely loved the explanation on this one!
@GlitchingLater
@GlitchingLater 3 месяца назад
this is pretty well made!! thank you
@halihammer
@halihammer 10 месяцев назад
Very cool visualizations. I liked it very much!
@dinohsu1019
@dinohsu1019 7 месяцев назад
Sorry, where's the next episode?
@migueltorrinhapereira7473
@migueltorrinhapereira7473 2 месяца назад
Well explained. Also, the local maximum problem could be solved by using BFS to compute the distance of every legal maze square to the exit, and using that distance as the fitness function. Right?
@argonautcode
@argonautcode Месяц назад
Yep, you could definitely use BFS!
@aeuludag
@aeuludag 6 месяцев назад
Really great video!
@yogpanjarale
@yogpanjarale 11 месяцев назад
wow amazing explanations and animations
@simonec3511
@simonec3511 29 дней назад
really interesting, looking forward to jump on the code,. It would be nice to have it in python instead of java but, any one has his own preferences! thanks for the video!
@amirmetaller
@amirmetaller Год назад
great work friend, thank you and keep it up please
@oXRiPerXo
@oXRiPerXo 7 месяцев назад
I’m curious how to implement this problem with the visualisations. Seeing is believing, and I’d love to make something like this to begin to comprehend it. Do you have any recommendations or planned tutorials on how we could create this maze problem? Thanks. Subscribed!
@damus6665
@damus6665 Год назад
Very cool video!
@victorian1134
@victorian1134 9 месяцев назад
Amazing !
@sricharansureshkumar1471
@sricharansureshkumar1471 3 месяца назад
i was using Genetic algorithm to tune a PID controller, my problem is that the values of Kp, Kd, Ki of the PID controller is in decimal values. how do i convert these decimals values to binary values and perform crossover and mutation.
@Blooper1980
@Blooper1980 Год назад
More please.
@abdulhamedeid935
@abdulhamedeid935 5 месяцев назад
can you open source the codes for us to experiment with it, codes for the visualize and how did you do such an amazing animations
@laughingvampire7555
@laughingvampire7555 8 месяцев назад
I would say that more than inspired is an abstraction of the concept of evolution in biology and then it can be generalized in the realm of logic and information theory, starting with a set for population of autonomous agents, called P, and then each of these autonomous agents have information and then they have a process of recombination of this information. With any of these sets you can implement evolution. The obvious example in real life would be biological evolution, another example is ideas and the process of recombination is dialog and the equivalent to species would be culture.
@overratedprogrammer
@overratedprogrammer Год назад
Representation in a maze is harder than you initially think. I'm having trouble trying to do this. Basically how do you know how many genomes/moves an individual should have? Since they can't really ever grow in genome/move count?
@argonautcode
@argonautcode Год назад
While it’s a little tricky to grow move count, it’s not so difficult to lower it. For example, if an individual solves the maze with moves to spare, we can just ignore the remaining moves. So the idea is that we need a large enough move count so that the individuals have moves to spare. The exact number you pick for this would depend on your maze size and complexity, but it’s generally better to shoot high. We can then reduce the move count over time, relying on the genetic algorithm to pressure individuals to optimize their moves.
@revimfadli4666
@revimfadli4666 7 месяцев назад
What if, instead of a single population whose fitness comes from both proximity and exploration, you split them into 2 subpopulations; explorers and improvers/exploiters. Each only gains fitness from its namesake. However, each generation the culled 50% in both subpopulations are filled children from both subpopulations, so the exploration and exploitation percolate
@beardo_fit3160
@beardo_fit3160 27 дней назад
waiting for next video.
@Srindal4657
@Srindal4657 Месяц назад
Maybe you should consider multiple species, rather than a single one
Далее
The Most Important Algorithm in Machine Learning
40:08
Просмотров 316 тыс.
Simulating the Evolution of Multicellularity
17:52
Просмотров 18 тыс.
You've Been Lied To About Genetics
14:13
Просмотров 854 тыс.
Why Does Diffusion Work Better than Auto-Regression?
20:18
I programmed some creatures. They Evolved.
56:10
Просмотров 4,1 млн
Genetic Algorithms Explained By Example
11:52
Просмотров 315 тыс.