Tholen, Kyle and Sunkara, Vishwamithra and Chakravarthy, Animesh and Ghose, Debasish (2018) Achieving Overlap of Multiple, Arbitrarily Shaped Footprints Using Rendezvous Cones. In: JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 41 (6). pp. 1290-1307.
PDF
Jou_Gui_Con_Dyn_41-6_1290_2018.pdf - Published Version Restricted to Registered users only Download (3MB) | Request a copy |
Abstract
This paper addresses the problem of achieving the overlap of footprints of unmanned aerial vehicles used for search and surveillance or for establishing communication between remote areas. The need of the footprints to overlap is dictated by the requirement that no part of the sensed area is left uncovered in a search and surveillance operation or by the need to position a relay unmanned aerial vehicle in the overlap region of two distant unmanned aerial vehicles in order to enable them to communicate with each other. The problem is generalized by considering arbitrarily shaped footprints that can arise in various applications. The concept of a rendezvous cone, which invokes several notions from hyperbolic geometry and collision dynamics in the relative velocity framework, is used as the basis for the development of nonlinear analytical guidance laws that enable the overlap of footprints to the requisite depth. Simulations are presented that demonstrate the effectiveness of the developed guidance laws.
Item Type: | Journal Article |
---|---|
Publication: | JOURNAL OF GUIDANCE CONTROL AND DYNAMICS |
Publisher: | AMER INST AERONAUTICS ASTRONAUTICS, 1801 ALEXANDER BELL DRIVE, STE 500, RESTON, VA 22091-4344 USA |
Additional Information: | Copy right for this article belong to AMER INST AERONAUTICS ASTRONAUTICS, 1801 ALEXANDER BELL DRIVE, STE 500, RESTON, VA 22091-4344 USA |
Department/Centre: | Division of Mechanical Sciences > Aerospace Engineering(Formerly Aeronautical Engineering) |
Date Deposited: | 05 Jun 2018 14:07 |
Last Modified: | 05 Jun 2018 14:07 |
URI: | http://eprints.iisc.ac.in/id/eprint/59948 |
Actions (login required)
View Item |