OPTIMIZATION ALGORITHMS FOR PROJECTILE MOTION: MAXIMIZING RANGE AND DETERMINING OPTIMAL LAUNCH ANGLE

A. Alridha
{"title":"OPTIMIZATION ALGORITHMS FOR PROJECTILE MOTION: MAXIMIZING RANGE AND DETERMINING OPTIMAL LAUNCH ANGLE","authors":"A. Alridha","doi":"10.14710/jfma.v6i2.20750","DOIUrl":null,"url":null,"abstract":"In this paper, we undertake an in-depth exploration of the optimization of parameters governing the trajectory of a projectile. Our primary objective is the determination of the optimal launch angle and initial velocity that yield the maximum achievable range for the projectile. To accomplish this, we leverage five distinct optimization methodologies, specifically the Nelder-Mead, Powell, L-BFGS-B, TNC, and SLSQP algorithms, in pursuit of our research goals. This paper offers a comprehensive analysis of the optimization procedures, shedding light on the impact of these diverse algorithms on the resultant outcomes. For each set of optimized parameters, the manuscript conducts extensive simulations of the projectile’s trajectory, presenting visual depictions of the paths traversed by the projectile. Additionally, our study incorporates comparative charts to emphasize the performance distinctions among various algorithms with respect to both maximum range and launch angle.","PeriodicalId":359074,"journal":{"name":"Journal of Fundamental Mathematics and Applications (JFMA)","volume":"120 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Fundamental Mathematics and Applications (JFMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14710/jfma.v6i2.20750","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we undertake an in-depth exploration of the optimization of parameters governing the trajectory of a projectile. Our primary objective is the determination of the optimal launch angle and initial velocity that yield the maximum achievable range for the projectile. To accomplish this, we leverage five distinct optimization methodologies, specifically the Nelder-Mead, Powell, L-BFGS-B, TNC, and SLSQP algorithms, in pursuit of our research goals. This paper offers a comprehensive analysis of the optimization procedures, shedding light on the impact of these diverse algorithms on the resultant outcomes. For each set of optimized parameters, the manuscript conducts extensive simulations of the projectile’s trajectory, presenting visual depictions of the paths traversed by the projectile. Additionally, our study incorporates comparative charts to emphasize the performance distinctions among various algorithms with respect to both maximum range and launch angle.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
弹丸运动的优化算法:最大射程和确定最佳发射角
在本文中,我们深入探讨了如何优化控制弹丸轨迹的参数。我们的主要目标是确定最佳发射角和初始速度,使弹丸达到最大射程。为了实现这一目标,我们采用了五种不同的优化方法,特别是 Nelder-Mead、Powell、L-BFGS-B、TNC 和 SLSQP 算法。本文对优化程序进行了全面分析,阐明了这些不同算法对结果的影响。对于每一组优化参数,手稿都对弹丸的轨迹进行了大量模拟,直观地描述了弹丸所经过的路径。此外,我们的研究还纳入了比较图表,以强调各种算法在最大射程和发射角度方面的性能差异。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A BACKTRACKING APPROACH FOR SOLVING PATH PUZZLES MATHEMATICAL MODEL OF MEASLES DISEASE SPREAD WITH TWO-DOSE VACCINATION AND TREATMENT FROZEN INITIAL LIABILITY METHOD TO DETERMINE NORMAL COST OF PENSION FUND WITH VASICEK INTEREST RATE MODEL TOPOLOGY OF QUASI-PSEUDOMETRIC SPACES AND CONTINUOUS LINEAR OPERATOR ON ASYMMETRIC NORMED SPACES FLOWER POLLINATION ALGORITHM (FPA): COMPARING SWITCH PROBABILITY BETWEEN CONSTANT 0.8 AND DOUBLE EXPONENTGUNAKAN DOUBLE EXPONENT
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1