Presenting an innovative algorithm to find the best path for a flying object

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:

In this article, we intend to address the issue of routing of flying objects such as drones, missiles, etc., using the proposed innovative algorithm. For this purpose, an innovative algorithm has been presented on a precise line that provides the best path without hitting obstacles to guide a flying object to intercept and reach the target. The environmental conditions are assumed in such a way that a flying object has no prior knowledge of the environment in which it is located, and it learns about its surroundings through the sensors embedded in it, which have a limited exploration area. Existing obstacles can be considered fixed or moving, and their movements are also unknown to the flying object, and they can also be of different geometric shapes. Finally, the flying object must reach a fixed target by which it can be reached. Also, the effectiveness of the proposed algorithm will be measured in the case that the flying object must avoid and pass through a security or forbidden space with a certain confidence interval.

Language:
Persian
Published:
Journal of Aerospace Defense, Volume:2 Issue: 1, 2023
Pages:
114 to 129
magiran.com/p2679845  
دانلود و مطالعه متن این مقاله با یکی از روشهای زیر امکان پذیر است:
اشتراک شخصی
با عضویت و پرداخت آنلاین حق اشتراک یک‌ساله به مبلغ 1,390,000ريال می‌توانید 70 عنوان مطلب دانلود کنید!
اشتراک سازمانی
به کتابخانه دانشگاه یا محل کار خود پیشنهاد کنید تا اشتراک سازمانی این پایگاه را برای دسترسی نامحدود همه کاربران به متن مطالب تهیه نمایند!
توجه!
  • حق عضویت دریافتی صرف حمایت از نشریات عضو و نگهداری، تکمیل و توسعه مگیران می‌شود.
  • پرداخت حق اشتراک و دانلود مقالات اجازه بازنشر آن در سایر رسانه‌های چاپی و دیجیتال را به کاربر نمی‌دهد.
In order to view content subscription is required

Personal subscription
Subscribe magiran.com for 70 € euros via PayPal and download 70 articles during a year.
Organization subscription
Please contact us to subscribe your university or library for unlimited access!