Journal of Automation and Information Sciences

ISSN for PRINT: 1064-2315

For Online Access

Best Paper Award Selection - Editorial Board Site

2004, Volume36

Issue 1

68 pages

DOI: 10.1615/JAutomatInfScien.v36.i1

Issue price - $221.00

Alexey P. Ignatenko
Institute of Software Systems of National Academy of Sciences of Ukraine, Kyiv, Ukraine

Arkadiy A. Chikriy
V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine, Kiev, Ukraine

The method of proportional navigation in the simple pursuit problem in n-dimensional space is studied. Interconnection of the method with methods of parallel pursuit and pursuit path is investigated. A parametric equation describing all mentioned pursuit methods is formulated. The resolving function of the proportional navigation method is introduced and substantiated. Boundedness of time of the family of proportional navigation methods is proved.

DOI: 10.1615/JAutomatInfScien.v36.i1.30 Download article, 19-27 pages

Article price - $35.00

<< Previous article   Next article >>