Show HN: Self-Parking Car Evolution
trekhleb.dev
Show HN: Self-Parking Car Evolution
1–10 of 45 posts
Re: Show HN: Self-Parking Car Evolution
#2Re: Show HN: Self-Parking Car Evolution
#3all the steps are well described and the code can be used as a template for other examples
Re: Show HN: Self-Parking Car Evolution
#4Group sizes of any more than about 10 make my machine slow to a crawl. Using the suggested population size of 500, then means it takes running 50 groups to pass 1 generation. With the suggested time of 17s, that's about 15 minutes per generation. The recommended 50 generations would therefore take over 12 hours.
And that's at the low-end of their recommendations. Population size of 1000 and 100 generations would take 50 hours.
I feel like usually with these things you want to run most of the generations headless, as fast as possible, and only show a few exemplars from each generation so the user can see how the evolution is progressing.
Re: Show HN: Self-Parking Car Evolution
#5Well it's outperforming Tesla FSD in generation 1.
Re: Show HN: Self-Parking Car Evolution
#6I would guess that mapping ”nothing here” to a value that is higher than the others would give better results. The software wouldn’t have to learn that weird inversion where the safest value is very close to the least safe ones.
Re: Show HN: Self-Parking Car Evolution
#7This is cute, but am I missing some way to make it run faster? It seems to only happen in real time. Group sizes of any more than about 10 make my machine slow to a crawl. Using the suggested population size of 500, then means it takes running 50 groups to pass 1 generation. With the suggested time of 17s, that's about 15 minutes per generation. The recommended 50 generations would therefore take over 12 hours. And t…
Re: Show HN: Self-Parking Car Evolution
#8This is cute, but am I missing some way to make it run faster? It seems to only happen in real time. Group sizes of any more than about 10 make my machine slow to a crawl. Using the suggested population size of 500, then means it takes running 50 groups to pass 1 generation. With the suggested time of 17s, that's about 15 minutes per generation. The recommended 50 generations would therefore take over 12 hours. And t…
Yes, currently the simulation performance is one of the biggest issues ( https://github.com/trekhleb/self-parking-car-evolution/issue... ). You may try to check the “Performance boost” checkbox that simplifies the geometry. It should give you approx x1.5 performance increase. But even with x1.5 boost the performance is still an issue, yes
> For better results, increase the population size to 500-1000 and wait for 50-100 generations
Do you have example output from that? I'd expect my computer to take months of running 24/7 to get there.
Re: Show HN: Self-Parking Car Evolution
#9Earlier quoted context omitted.
Yes, currently the simulation performance is one of the biggest issues ( https://github.com/trekhleb/self-parking-car-evolution/issue... ). You may try to check the “Performance boost” checkbox that simplifies the geometry. It should give you approx x1.5 performance increase. But even with x1.5 boost the performance is still an issue, yes
The page says: > For better results, increase the population size to 500-1000 and wait for 50-100 generations Do you have example output from that? I'd expect my computer to take months of running 24/7 to get there.
You may also press the "Restore Evolution" button and then press "Use demo checkpoint" to use some pre-trained data.
Re: Show HN: Self-Parking Car Evolution
#10> Whenever the sensor doesn't see any obstacles it reports the value of 0. On the contrary, if the value of the sensor is small but not zero (i.e. 0.01m) it would mean that the obstacle is close. I would guess that mapping ”nothing here” to a value that is higher than the others would give better results. The software wouldn’t have to learn that weird inversion where the safest value is very close to the least safe o…