![]() |
Torpedo Fire Control Problem
Hey guys,
I've been a long time fan of the SH series (3 and 4; haven't had money/willingness to battle DRM for 5 yet). Well, I was taking a course and we had to choose a semester-end project and solve the problem. I modeled my problem after a Torpedo Fire Control Problem due to my recent revival of interest in the SH series (SH5). I made a lot of assumptions as I'm sure many of you will be quick to point out :O:. I thought the document may make for an interesting read for some of you, especially those unfamiliar with time optimal control theory. I did my best to model the problem as a "real-life" encounter while keeping it simple enough so that I could solve the problem within the 2 weeks I had. I apologize if my writing style is a bit dry and technical. You could probably just jump down to the "Numerical Analysis" and Case 1 or Case 2 sections to see what the final solutions are. If you have questions, I'll try to answer. Gah, I would have attached it but alas I cannot. http://tinyurl.com/2fk22xn |
All times are GMT -5. The time now is 06:38 AM. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2025, Jelsoft Enterprises Ltd.
Copyright © 1995- 2025 Subsim®
"Subsim" is a registered trademark, all rights reserved.