Application of dynamic programming for path planning for observation of mobile ground targets in the controlled area

Abstract

In this article we consider a path planning problem for a UAV performing reconnaissance of mobile ground targets. We suggest an algorithm which uses dynamic programming for solving a path planning problem and allows us to determine the domain of attraction in the form of a "twisted" elliptic cylinder.

About the authors

G. N. Lebedev

Moscow Aviation Institute (State Technical University)

Author for correspondence.
Email: kaf301@mai.ru

doctor of technical sciences, professor

Russian Federation

A. V. Efimov

Moscow Aviation Institute (State Technical University)

Email: astrowave@gmail.com

engineer

Russian Federation

References

Statistics

Views

Abstract: 295

PDF (Russian): 109

Dimensions

PlumX

Refbacks

  • There are currently no refbacks.

Copyright (c) 2019 VESTNIK of Samara University. Aerospace and Mechanical Engineering

License URL: https://journals.ssau.ru/index.php/vestnik/about/editorialPolicies#custom-2

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies