cleanup trajectory optimization examples (now everything uses the new interface)

to be included in drake v 0.9.7
i was under the impression that solveTraj will provide a small random number seed if you don't specific initial trajectories.  (i believe i read documentation that said so, but didn't check to be sure)

On Oct 12, 2014, at 4:13 PM, Andres Valenzuela <notifications@github.com> wrote:

> In examples/CartPole/CartPolePlant.m:
> 
> >          h = t;
> >          dh = [1,zeros(1,size(x,1))];
> >        end
> >        
> > -      info=0;
> > -      while (info~=1)
> > -        utraj0 = PPTrajectory(foh(linspace(0,tf0,31),randn(1,31)));
> > +      traj_init.x = PPTrajectory(foh([0,tf0],[x0,xf]));
> > +      for attempts=1:10
> What's the purpose of this loop? I don't see anything non-deterministic here - what can change between iterations that would make it fail one time and succeed the next?
> 
> —
> Reply to this email directly or view it on GitHub.
>