I don't think that anyone has put a lot of effort in developing such a method.
The problem on such a method is, that it would be require a lot of searching for pieces, the algorithms are hard to recognize and so on. At least nobody have proven otherwise.
I'm into speedsolving (solving the cube as fast as possible). Basically we happily choose methods with a 10 more moves, over one with crappy recognition, bad (slow to execute) algorithms, ...
For instance the top guys in speedcubing average about 8 seconds on average on a cube, but still use a method with 50 moves. I doubt that times like that would be possible with a method averaging 35 moves or so.
But back to the question:
There are a few methods out there, that require fewer moves than the popular ones. I can't give you numbers for the worst case, nobody has made any efforts in calculating these yet. But I can give you average numbers of turns.
Snyder 2: 40 moves on average, the developer claims to have ideas for a 30 move method, but never explored it.
Heise Method: 40 moves on average, more famous than Snyder method. You will probably find much more documentation on this method.
Big parts of these methods are only ideas though. Parts of these methods depend on building random blocks. There are no algorithms for these, all you need is lots of brain power, experience and random tricks. A beginner or even an intermediate cuber you will get nowhere near those 40 moves on average.
This may be a bit off topic. But in speedsoving competition there is also a event called Fewest Moves. Each competitor gets a piece of paper with instruction on how to scramble the cube, and the competitor has 1 hour to find a short solution to this scramble. The competitor with the shortest solution wins. In this 1 hour you can scramble and solve as many cubes as you want, try different tricks, and so on.
Good people find sub 30 solutions quite regularly. Tomoaki Okayama from Japan even found a 20 move solution once.
The main method people use at a fewest move event depend also a lot on intuitive block building. And use lots of 'tricks' someone can't use in a regular solve. For instance someone can find a skeleton (e.g. all pieces solved except 3 corners) and then solve the missing pieces somewhere at a suitable place in the middle of the solve.
But good fmc solver can also find quite short solutions on a linear solve (where you can't undo moves). You might wanna check out this video: FMC Head to Head