Ideas

 Traveling salesman problem: Wikipedia: “The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.”   In the mathematics literature, it appears that the first mention of the TSP was...

As promised I will start my high altitude journey. My aim is to come up with some videos until next summer. Yes you are right it is too much time but I need to start from some where and there is too much to learn. Here are some basic sketches how it is designed for in the first place   Basic calculation and assumptions. From: http://www.chem.hawaii.edu/uham/lift.html Lift of Helium Balloons Dia. Ft.  Vol. l     Lift...

This is the final comparison and list of learnings from my self made Drones

This is how it looks like.