|
-
Jan 9th, 2001, 04:54 PM
#1
Thread Starter
transcendental analytic
This problem would be much easier if it wasn't about optimation.
A path of a rocket has to be set trough an amount of moving checkpoints while each of them have a different maximum velocity of which the rocket can pass by (otherwise it misses it). The acceleration,initial velocity and position of each checkpoint is known(the acceleration is constant), and the rocket has a initial velocity and poision, known. The list of acceleration changes at certain time has to be calculated. And plus one thing, the length of the rockets acceleration vector can't pass a certain known value. I've done this but without the optimation: it has to be done as fast as possible (travel the path at shortest possible time)
Again, if it remained unclear. I want an algoritm to calculate the full route, which is a list of acceleration vectors and the time they will be active for the rocket. No mass/friction/gravity or other elements are involved.
Use  
writing software in C++ is like driving rivets into steel beam with a toothpick.
writing haskell makes your life easier:
reverse (p (6*9)) where p x|x==0=""|True=chr (48+z): p y where (y,z)=divMod x 13
To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
Click Here to Expand Forum to Full Width
|
Reply With Quote