Next Article in Journal
Pollution from Highways Detection Using Winter UAV Data
Next Article in Special Issue
Robust Cooperative Control of UAV Swarms for Dual-Camp Divergent Tracking of a Heterogeneous Target
Previous Article in Journal
5G-NR Physical Layer-Based Solutions to Support High Mobility in 6G Non-Terrestrial Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Coordinated Vision-Based Tracking by Multiple Unmanned Vehicles

1
Department of Mechanical Engineering, University of Iowa, Iowa City, IA 52242, USA
2
Department of Mechanical and Aerospace Engineering, Naval Postgraduate School, Monterey, CA 93940, USA
*
Author to whom correspondence should be addressed.
Drones 2023, 7(3), 177; https://doi.org/10.3390/drones7030177
Submission received: 16 January 2023 / Revised: 27 February 2023 / Accepted: 3 March 2023 / Published: 5 March 2023
(This article belongs to the Special Issue Large Scale Cooperative UAS: Control Theory and Applications)

Abstract

:
We address the problem of coordinated vision-based tracking of a moving target using multiple unmanned vehicles that exchange information over a supporting time-varying network. The objective of this work is to formulate decentralized control algorithms that enable multiple vehicles to follow the target while coordinating their phase separation. A typical scenario involves multiple unmanned aerial vehicles that are required to monitor a moving ground object (target tracking) while maintaining a desired inter-vehicle separation (coordination). To solve the vision-based tracking problem, the yaw rate of each vehicle is used as the control input, while the speeds of the vehicles are adjusted to achieve coordination. It is assumed that the vehicles are equipped with an internal autopilot, which is able to track yaw rate and speed commands. The performance of the coordinated vision-based tracking algorithm is evaluated as a function of the target’s velocity, tracking performance of the onboard autopilot, and the quality of service of the communication network.

1. Introduction

Unmanned Vehicles (UxVs)—including air, ground, and marine robots—play a crucial role today in many complex missions, especially in hazardous situations, where the presence of human operators must be avoided. Numerous problems related to motion control of autonomous vehicles have been studied in recent years. One focus area of research delineated in the literature is the vision-based motion control UxVs. A variety of approaches based on visual feedback have been proposed in [1,2,3,4,5,6,7,8,9,10,11,12,13]. Typical applications considered in the literature include autonomous landing [10], aerial refueling [11], and vision-based target tracking (VBT) [7], where the objective is to control the motion of the UxVs relative to a static or moving target.
In spite of relevant theoretical and technological advances, the problem of vision-based motion control is still very challenging. In fact, the control system has to deal with poor, and insufficient, accuracy of the acquired data. Moreover, in the situation where only passive sensor data are available about the target, the control task must be defined using the information obtained in the camera frame only. Finally, the control engineer must take into account that processing image or video in general requires high computational resources, and that the information on the target’s and vehicle’s position and velocity might be unreliable or not available at all.
Another challenge to be addressed is the problem of vision-based motion control of multiple cooperative UxVs. Relevant work in the area of cooperative control of autonomous systems includes [14,15,16,17,18,19,20] (and the references therein). In these cases, one needs to establish communication between the vehicles. This compels the control designer to take into consideration the fact that the amount of information that can be exchanged could be limited and may vary over time. Cooperative motion control strategies must be developed that yield robust performance even in the presence of temporary loss of communication links and switching communication topologies.
Motivated by these challenges, we describe a solution to the Coordinated Vision-Based Tracking (CVBT) problem. The objective of this work is to enable a set of n vehicles, with dynamics described by the kinematic car model (i.e., Dubins’ car), to orbit around (track and monitor) a target while coordinating their phase separation with each other. Figure 1 depicts the control framework adopted in this paper. The work focuses on two main parts. First, we derive a control algorithm for the yaw rate to enable the vehicles involved in the mission to track a (static or moving) target and orbit around it (VBT). Second, we formulate control laws for the speed of each vehicle so that they maintain a predefined space separation while orbiting around the target (coordination).
At the VBT level, we show that VBT is achieved by using only vehicle-to-target relative line-of-sight (LOS) angles, which can be obtained from the visual measurement. This reduces the computational load required to acquire more complex information, such as the target’s position and velocity. The solution to the VBT problem presented in this paper builds on previous papers [21,22], where the authors demonstrate that the proposed control algorithm guarantees exponential convergence and ultimate boundedness of the VBT error in the case of static and moving targets. One fundamental assumption made in [21] is that the velocity of the unmanned vehicle is constant. In [22], such an assumption is relaxed and convergence of the VBT error to zero is guaranteed as long as the speed of the vehicle is lower and upper bounded by some constants. However, the work in [22] assumes that the UxV is equipped with an ideal inner-loop autopilot (AP), which guarantees that the difference between commanded and actual angular rates is always identical to zero. In the present paper, we address a more realistic case, where the AP can only ensure that such a difference is bounded. It is shown that the VBT algorithm is robust to non-perfect tracking of the VBT input commands. Performance of the outer-loop VBT controller is derived as a function of the performance of the inner-loop AP.
At the coordination level, motivated by [14], where the authors propose a solution to the cooperative path-following problem, we propose a control law for the speeds of the UxVs and show that coordination can be achieved by allowing the vehicles to exchange minimum information (the LOS angle only) between each other over a communication network. Performance of the coordination algorithm is analyzed, while taking into account non-ideal communication scenarios (such as failures, drop-outs, and switching topology). We further extend the coordination result by considering non-perfect tracking of the speed commands. We show that the controller’s performance is guaranteed as long as the difference between the commanded and actual speed of the vehicles remains bounded.
The main features of this paper are as follows: (i) VBT is achieved by using only a UxV-target-relative (LOS) angle; (ii) performance of the overall control architecture is guaranteed against communication failures among the UxVs and non-ideal tracking of the reference control commands by the autopilot.
The paper is organized as follows: Section 2 formulates the CVBT problem; it describes the kinematics of the systems of interest and introduces a set of assumptions and limitations on the onboard autopilot, as well as on the supporting communication network. Section 3 presents a control algorithm that solves the problem at hand. Section 4 illustrates the simulation results. Finally, conclusions are summarized in Section 5. Theoretical proofs of the results are reported in the Appendix A, Appendix B, Appendix C, Appendix D and Appendix E.

2. Problem Formulation

In what follows, we first consider a single UxV and characterize the dynamics of the kinematic errors, describing the VBT approach that was previously presented in [21]. Second, following a decentralized coordination strategy similar to the one presented in [23], we consider the case of multiple UxVs by introducing a set of appropriate coordination variables, along with assumptions and limitations on a given communication network. Table 1 lists the symbols and their definitions for clarity.

2.1. Vision-Based Tracking

Consider the horizontal projection of the UxV and target-relative kinematics in the inertial frame I illustrated in Figure 2. Let v g ( t ) R 3 and ψ ( t ) R be the UxV’s velocity vector and heading angle, respectively. Let V g ( t ) R be the magnitude of v g ( t ) . Let V t ( t ) be the speed of the target and ψ t ( t ) be its heading angle. Let ρ ( t ) R be the horizontal distance between the UxV and the target. Let λ ( t ) R be the LOS phase angle, let λ g ( t ) R 3 denote the LOS vector, and let λ p ( t ) R 3 be the vector perpendicular to λ g ( t ) . Finally, let η ( t ) R denote the angle between λ p ( t ) and v g ( t ) , which can be written as
η ( t ) = ψ ( t ) ( λ ( t ) π 2 ) .
Since the rotational speed of the LOS can be expressed as
λ ˙ ( t ) = V g ( t ) cos ( η ( t ) ) ρ ( t ) V t ( t ) cos ( ψ t ( t ) ( ψ ( t ) η ( t ) ) ) ρ ( t ) ,
one can compute the derivative of Equation (1):
η ˙ ( t ) = V g ( t ) cos η ( t ) V t ( t ) cos ( ψ t ( t ) ψ ( t ) + η ( t ) ) ρ ( t ) + ψ ˙ ( t ) .
Next, define η ^ ( t ) η ( t ) / ρ d .
In what follows, η ^ ( t ) plays the role of guidance tracking error. Obviously, if η ^ ( t ) = 0 , then η ( t ) = 0 , and it follows from Equation (1) that the angle between the UxV velocity vector and the LOS vector equals π 2 rad. This results in the UxV orbiting around the target, which constitutes part of the control objective. In fact, to accomplish VBT, the control law must also enable the UxV to orbit along a desired circle. This can be achieved when driving the horizontal range ρ ( t ) to a desired constant value, ρ d [ ρ d m i n , ρ d m a x ] R . By projecting the horizontal components of the UxV velocity vector onto the LOS, one can express the dynamics of ρ ( t ) as follows:
ρ ˙ ( t ) = V g ( t ) sin η ( t ) + V t ( t ) sin ( ψ t ( t ) ψ ( t ) + η ( t ) ) .
Finally, by defining ρ e ( t ) 1 / ρ ( t ) 1 / ρ d , we can write the dynamics of the VBT error states
η ^ ˙ ( t ) = V g ( t ) cos ( η ^ ( t ) ρ d ) ρ d ρ e ( t ) + 1 ρ d + ψ ˙ ( t ) ρ d + V t ( t ) cos ( η ^ ( t ) ρ d ψ r ( t ) ) ρ e ( t ) + 1 ρ d ρ d ρ ˙ e ( t ) = ρ e ( t ) + 1 ρ d 2 V g ( t ) sin ( η ( t ) ) ρ e ( t ) + 1 ρ d 2 V t ( t ) sin ( η ^ ( t ) ρ d ψ r ( t ) ) ,
where ψ r ( t ) ψ ( t ) ψ t ( t ) . Before providing a formal statement of the problem at hand, we give a set of assumptions that must be satisfied:
Assumption 1.
The speed of the UxV is bounded as follows:
0 < V g , m i n V g ( t ) V g , m a x .
Assumption 2.
The speed of the target to be tracked satisfies
0 V t , m i n V t ( t ) V t , m a x .
Assumption 3.
The UxV is equipped with an autopilot capable of following speed and yaw rate commands, V c ( t ) and ψ ˙ c ( t ) . The tracking performance of the autopilot satisfies
| V c ( t ) V g ( t ) | < δ V , | ψ ˙ c ( t ) ψ ˙ ( t ) | < δ ψ ,
for all t 0 and for some δ V , δ ψ > 0 .
Finally, the VBT control problem can be defined as follows:
Problem 1.
Vision-Based Tracking (VBT): Consider a UxV and a target with speeds satisfying Assumptions 1 and 2. Assume that the UxV is equipped with an autopilot satisfying Assumption 3. Then, the objective of VBT is to define a control law for the commanded angular velocity of the UxV, ψ ˙ c ( t ) , such that the error vector x ( t ) [ η ^ ( t ) , ρ e ( t ) ] , with dynamics in Equation (3), converges to a neighborhood of zero.
Remark 1.
The control algorithm utilizes feedback from image processing software (centroid position in camera frame) and an on-board inertial measurement unit, typical for modern autopilots. Hence, only the line of sight (LOS) to the target is assumed to be known, justifying the use of the term “vision-based tracking”. The crucial aspect of the approach is achieving convergence of the horizontal range to a desired value ρ d , without knowledge of the actual range ρ ( t ) , target position, or velocity.

2.2. Coordination

Consider now a set of n UxVs and let V g , i ( t ) , ψ i ( t ) , and λ i ( t ) be the speed, the heading angle, and the LOS angle of the i-th vehicle ( i { 1 , , n } ), respectively. Furthermore, let η ^ i ( t ) and ρ e , i ( t ) be its VBT errors with the dynamics described in Equation (3). The objective of coordination is to drive the difference between the UxVs LOS phase angles to a desired value, in order to maintain a desired phase separation. Thus, we consider the i-th and j-th vehicles to be coordinating at time t if their LOS angles satisfy the condition
λ i ( t ) λ j ( t ) = λ d ,
where λ d R is the desired separation in terms of LOS angle. Finally, without loss of generality, it is convenient to set λ d = 0 ; when a specific phase shift is desired, λ d can be assigned a desired constant value. Therefore, the coordination problem for multiple UxVs reduces to achieving λ i ( t ) λ j ( t ) = 0 ,   i , j { 1 , , n } , i j , t > 0 .
To guarantee coordination, the states λ 1 ( t ) , , λ n ( t ) have to be exchanged between the UxVs over a communication network. In this paper, we use the notation and tools from algebraic graph theory. Introduction to the material and further relevant reading can be found in [24]. Let L ( t ) be the Laplacian matrix of the communication graph Γ ( t ) . Let Q R ( n 1 ) × n be such that Q 1 n = 0 and Q Q = I n 1 , with 1 n = [ 1 , 1 , , 1 ] R n . Let G i ( t ) denote the set of vehicles positioned in a neighborhood of the i-th UxV. Now, we can define a set of assumptions that the communication network must satisfy [25]:
Assumption 4.
The i-th UxV can only communicate with the neighboring set G i ( t ) .
Assumption 5.
The communication between two vehicles is bidirectional, with no time delays.
Assumption 6.
The connectivity of the communication graph Γ ( t ) satisfies
1 n 1 T t t + T L ¯ ( τ ) d τ μ I n 1 t 0 ,
where L ¯ ( t ) Q L ( t ) Q has the same spectrum of L ( t ) without the eigenvalue λ 1 ( L ( t ) ) = 0 , and the parameters T > 0 , μ ( 0 , 1 ] describe the quality of service of the communication network.
It is worth noting that Assumption 6 stipulates that the communication graph Γ ( t ) is only required to be connected in an integral sense over the time range T rather than pointwise in time. In fact, the graph may be disconnected during some interval of time or may even fail to be connected at all times. In this sense, it is general enough to capture packet dropouts, loss of communication, switching topologies, etc. Small values of T and large values of μ indicate better quality of the communication network.
Finally, the coordination problem can be defined as follows:
Problem 2.
Coordination: Consider a set of n UxVs with speed satisfying Assumption 1 and a target with speed satisfying Assumption 2. Assume that the vehicles are equipped with an autopilot satisfying Assumption 3. Finally, suppose that the UxVs are supported by a communication network satisfying Assumptions 4–6. Then, the objective is to design feedback control laws for the commanded speeds V c , i ( t ) , i { 1 , , n } such that the difference between the LOS angles of the n UxVs converge to a neighborhood of zero, i.e.,
λ i ( t ) λ j ( t ) 0 , i , j { 1 , , n } , i j , t > 0 ,
and such that the speeds of the vehicles converge to predefined constant values, i.e.,
V g , i ( t ) V d , i , i { 1 , , n } , t > 0 .

3. Main Result

In this section, we first present the outer-loop nonlinear controller that uses the angular velocity ψ ˙ c , i ( t ) to solve Problem 1. Then, we formulate a control law for the speed commands V c , i ( t ) , i { 1 , , n } , which solves Problem 2.

3.1. Vision-Based Tracking

Recall from Section 2 that the main objective of the VBT control algorithm is to drive the states ( η ^ ( t ) , ρ e ( t ) ) to a neighborhood of zero. To this end, we propose the following guidance law [21]:
ψ ˙ c ( t ) = V g ( t ) ρ d cos ( η ( t ) ) k η η ( t ) .
Then, the solution to the VBT problem for a single UxV can be summarized in the following Lemma:
Lemma 1.
Vision-Based Tracking (VBT): Consider a UxV with speed V g ( t ) satisfying Assumption 1 and a moving target with speed satisfying Assumption 2. Let the commanded angular rate ψ ˙ c ( t ) be governed by Equation (4) and assume that the vehicle is equipped with an autopilot satisfying Assumption 3. Moreover, assume that at time t = 0 the error vector satisfies
x ( 0 ) = [ η ^ ( 0 ) , ρ e ( 0 ) ] Ω v { x : x P x c 2 } ,
with c = c ρ ρ d λ m i n ( P ) ; c ρ satisfies
c ρ c ρ 2 4 + ( 2 + c ρ + c ρ / 6 ) 2 < ρ d V g , m a x ( λ m i n ( W ) 2 λ v λ m a x ( P ) ) 2 λ m a x ( P ) ,
with P and W being positive definite matrices, 0 < λ v < λ m i n ( W ) 2 λ m a x ( P ) , and
k η > m a x 2 V g / ρ d 4 V g / V g , m i n 1 , 1 .
Then, if the velocity of the target V t ( t ) and the angular speed tracking performance of the autopilot (i.e., δ ψ ) satisfy
V t , m a x ( 1 + c ρ ) 1 + ( 1 + c ρ ) 2 λ v ρ d 2 + δ ψ 2 λ v ρ d < c ρ ρ d ,
the VBT error x ( t ) , with the dynamics described in Equation (3), is ultimately bounded with bound | | x ( t ) | | c ρ ρ d .
Corollary 1.
Under the assumptions stated in Lemma 1, if the velocity of the target is V t = 0 , t 0 and the autopilot has ideal performance of (i.e., δ ψ = δ V = 0 ), the VBT error converges exponentially to zero as follows:
| | x ( t ) | | λ m a x ( P ) λ m i n ( P ) | | x ( 0 ) | | e λ v t .
Proof .
The proofs of Lemma 1 and Corollary 1 are given in Appendix A and Appendix B, respectively.

3.2. Coordinated Vision-Based Tracking

To drive the LOS angles of the UxVs to the same increasing value, the speed of the vehicles is adjusted based on the coordination information exchanged over the communication network. Since, by assumption, each UxV can only communicate with a neighboring set of vehicles, denoted as G i ( t ) , we let the commanded velocity V c , i ( t ) for the i-th vehicle be governed by
V c , i ( t ) = u coord , i ( t ) ρ d , i cos ( η i ( t ) ) ,
where
u coord , 1 ( t ) = a j G 1 ( t ) ( λ 1 ( t ) λ j ( t ) ) + V d , 1 ρ d , 1 ,
u coord , i ( t ) = a j G i ( t ) ( λ i ( t ) λ j ( t ) ) + χ I , i ( t ) , i = 2 , . . . , n ,
χ ˙ I , i ( t ) = b j G i ( t ) ( λ i ( t ) λ j ( t ) ) , χ I , i ( 0 ) = V d , i ρ d , i , i = 2 , . . . , n ,
with vehicle 1 elected as leader of the fleet, and a , b > 0 . Note that V d , 1 , V d , 2 , , V d , n are constant desired speeds that satisfy V d , 1 ρ d , 1 = V d , 2 ρ d , 2 = = V d , n ρ d , n , in order to maintain the same turn rate around the target. Moreover, the following inequalities must hold to guarantee feasibility of the mission:
0 < V g , m i n / δ < V d , m i n V d , j V d , m a x < δ V g , m a x ,
j { 1 , , n } , where 0 < δ < 1 .
Remark 2.
Parameter δ guarantees that a margin is left between the minimum (and maximum) UxV’s velocity and the desired speed, therefore ensuring the existence of a solution for the coordination problem. In fact, assume that the desired speed for the i-th UxV is V d , i = V g , m i n . It follows that, if the vehicle is required to slow down in order to coordinate with the rest of the fleet, it would not be possible since no margin is left between the desired and minimum feasible velocities.
Next, we define the coordination error vector as
ζ ( t ) [ ζ 1 ( t ) , ζ 2 ( t ) ] ,
where
ζ 1 ( t ) = Q λ ( t ) , ζ 2 ( t ) = χ I ( t ) V d ρ d 1 n ,
λ ( t ) [ λ 1 ( t ) , . . . , λ n ( t ) ] R n ,
χ I ( t ) [ χ I , 2 ( t ) , . . . , χ I , n ( t ) ] R n 1 ,
where 1 n = [ 1 , 1 , , 1 ] R n and
V d ρ d V d , 1 ρ d , 1 = . . . = V d , n ρ d , n .
Note that, from the properties of Q, if at time t we have ζ 1 ( t ) = 0 , then λ ( t ) span { 1 n } , which implies that λ i ( t ) = λ j ( t ) for all i , j { 1 , , n } . Moreover, if at the same time ζ 2 ( t ) = 0 , then the commanded speed of each vehicle is equal to its desired constant speed, which is
V c , i = V d , i , i { 1 , , n } .
Before stating the main result of the paper, let us define c v , c c > 0 as c v c ρ ρ d , m a x λ m i n ( P ) , and
c c m i n V g , m a x V d , m a x / c η 2 κ 1 ρ d , m a x ( a n + 1 ) κ 2 κ 1 c ρ ρ d , m a x , V d , m i n V g , m i n 2 κ 1 ρ d , m a x ( a n + 1 ) κ 2 κ 1 c ρ ρ d , m a x ,
where P is a positive definite matrix, c ρ satisfies Equation (6), and
c ρ < m i n 1 2 k n ( ( 1 + a ) n + 1 + a ) ρ k 2 , V g , m a x V d , m a x / c η 2 κ 2 ( a n + 1 ) , V d , m i n V g , m i n 2 κ 2 ( a n + 1 ) ,
where k > 2 ; 0 < c η 1 ; and some positive ρ k , κ 1 and κ 2 .
Finally, the main result is stated in the following Theorem:
Theorem 1.
Coordinated Vision-Based Tracking (CVBT): Consider a set of n UxVs and a target with speed satisfying Assumption 2. Let the commanded angular rate of the UxVs be governed by Equation (4), and let the commanded speed be governed by Equation (8). Assume that the UxVs are equipped with autopilots satisfying Assumption 3. Suppose that the UxVs communicate over a network satisfying Assumptions 4–6. If at time t = 0 the VBT error and the coordination error satisfy
x i ( 0 ) Ω v { x i : x i P x i c v 2 } , i { 1 , , n } ,
and
ζ ( 0 ) Ω c { ζ : | | ζ | | c c } ,
respectively, then we have the following:
(i)
The velocities of the UxVs satisfy Assumption 1;
(ii)
The VBT error x ( t ) , with dynamics described in Equation (3), is ultimately bounded with bound
| | x ( t ) | | c ρ ρ d ,
if the velocity of the target V t ( t ) and the angular rate tracking performance of the autopilot (i.e., δ ψ ) satisfy
V t , m a x ( 1 + c ρ ) 1 + ( 1 + c ρ ) 2 λ v ρ d 2 + δ ψ 2 λ v ρ d < c ρ ρ d ;
(iii)
The coordination error vector ζ ( t ) defined in Equation (10) satisfies the following bound:
| | ζ ( t ) | | κ 1 * | | ζ ( 0 ) | | e λ c ( 1 θ ) t + κ 2 * sup τ [ 0 , t ] | | u x v ( τ ) | | ,
where u x v ( t ) = 3 m a x V d , m a x ρ d , m i n ρ d , m a x | | x | | , V t , m a x ρ m i n , δ V ρ m i n , and κ 1 , κ 2 are positive constants.
Corollary 2.
Under the same assumptions stated in Theorem 1, if the velocity of the target is V t = 0 , t 0 , and the autopilot has ideal performance (i.e., δ ψ = δ V = 0 ), we have the following:
(i)
The velocities of the UxVs satisfy Assumption 1;
(ii)
The VBT error x ( t ) , with dynamics described in Equation (3), converges exponentially to zero (see Equation (7));
(iii)
The coordination error vector ζ ( t ) defined in Equation (10) converges exponentially to zero as follows:
| | ζ ( t ) | | κ ¯ 1 | | ζ ( 0 ) | | e λ c t + κ ¯ 2 | | x ( 0 ) | | e λ v + λ c 2 t ,
where κ ¯ 1 , κ ¯ 2 are positive constants, with rate of convergence λ c = γ ¯ ( 1 + k n ) ρ k , with γ ¯ a n μ T ( 1 + a n T ) 2 , and
ρ k m a x 2 k γ ¯ 1 + k n , 1 , 1 + 1 4 γ ¯ 2 + ( k n + 1 ) 2 γ ¯ 2 k 2 n 3 , k > 2 .
Proof .
The proofs of Theorem 1 and Corollary 2 are given in Appendix C and Appendix D, respectively.
Remark 3.
The maximum guaranteed rate of convergence can be obtained by letting a = 1 n T , which is
m a x a > 0 λ c = μ 4 T 2 ( 1 + k n ) ρ k .
Moreover, it is worth noticing that if one modifies the control laws given in Equation (9) as follows:
u coord , i ( t ) = a j G 1 ( t ) ( λ i ( t ) λ j ( t ) ) + V d , i ρ d , i ,
χ ˙ I , i ( t ) = b j G i ( t ) ( λ i ( t ) λ j ( t ) ) , χ I , i ( 0 ) = V d , i ρ d , i , i = 1 , . . . , n ,
i.e., all the UxVs involved in the mission are leaders; then, one can show [23] that the rate of convergence reduces to
λ c = μ 4 T 2 ( 1 + k ) ρ k .
This implies that the rate of convergence depends on the quality of the communication network, and it scales with the number of vehicles.

4. Simulation Results

This section presents the simulation results. In the proposed scenario, six UxVs are asked to rotate around a target along two orbits of different radius, while maintaining a phase separation of π 3 rad from each other. In particular, UxV1—elected as the leader—UxV3, and UxV5 are required to rotate on an orbit of radius 100 m , while UxV2, UxV4, and UxV6 rotate on an orbit of radius 150 m . The desired speeds at which the UxVs are asked to converge are V d , 1 = V d , 3 = V d , 5 = 25 m / s and V d , 2 = V d , 4 = V d , 6 = 37.5 m / s .
We assume that the vehicles can only communicate with each other when the distance between them is less than 250 m . All-to-all communication is never achieved throughout the mission. In Figure 3, the black lines connecting vehicle i and vehicle j indicate that the two UxVs are communicating. For clarity of presentation, these lines are shown only at four different time instances ( t = 0 s , 180 s , 300 s , 600 s ).
To illustrate the performance of the CVBT controller in the presence of non-ideal tracking of reference commands, we implemented a proportional controller as follows
V ˙ g ( t ) = k V ( V c ( t t d ) V g ( t ) ) , ψ ¨ ( t ) = k ψ ( ψ ˙ c ( t t d ) ψ ˙ ( t ) ) ,
with gains k V = 0.2 , k ψ = 0.05 , and time delay t d = 0.1 s . The time delay is intentionally introduced to simulate the effects of real-world delays that can impact the performance of an unmanned vehicle’s autopilot system.
The control gains of the CVBT controller have been chosen as follows: k η = 2 , a = 0.1 , b = 0.05 . The imposed speed limits are V g , m i n = 17 m / s and V g , m a x = 32 m / s .

Mission

At t = 0 s , the target is positioned at [ 400 ; 400 ] m with velocity V t ( t ) = 0 , and the UxVs are positioned in a straight-line formation near the target, as depicted in Figure 3. When the mission begins, the UxVs start approaching the desired orbits with different speed profiles. Figure 4 and Figure 5 show the convergence to a neighborhood of zero of the VBT error. Figure 6 and Figure 7 illustrate the coordination error and the actual speeds. The slow rate of convergence depends on the facts that the UxVs start the mission far away from each other and each vehicle is able to communicate with only few of its neighbors (see Figure 3, black lines).
At t = 200 s , the target starts moving in the northeast direction at a speed of V t ( t ) = 5 m / s . As it can be seen in Figure 7, the speeds of the vehicles oscillate around the desired values. The reason is that the trajectory of the UxVs at this time is not a circular orbit, as it is in the case of a stationary target (this can be noted from the trajectory of UxV1 depicted in Figure 3), and following this trajectory requires oscillatory (linear and angular) velocity commands. Finally, Figure 4, Figure 5 and Figure 6 show the oscillatory behavior of the VBT and the coordination errors, which, however, remain bounded as expected.
At t 380 s , the target reaches position [ 200 ; 200 ] m and stops (i.e., V t ( t ) = 0 m / s ). Again, the speeds converge to the desired values, while the VBT and the coordination error converge close to zero.
A video of these results and the Matlab code used to generate the plots can be found at the following link: https://github.com/venanziocichella/Cooperative-Vision-Based-Tracking (accessed on 2 March 2023).

5. Conclusions

In this paper, a solution for the coordinated vision-based tracking problem is given. The proposed control laws enable n unmanned vehicles (UxVs) to move around a target along n desired orbits, while coordinating with each other (i.e., maintaining a desired phase shift). The yaw rate is used to solve the vision-based tracking problem. The coordination between the UxVs is achieved by adjusting the speed of each vehicle. Non-perfect tracking performance of an on-board autopilot is considered. First, a solution to the vision-based tracking problem is given considering the case of a single UxV. Second, we provide a solution to the coordination problem. The simulation results validate the theoretical findings.

Author Contributions

Conceptualization, V.C. and I.K.; methodology, V.C. and I.K.; software, V.C and I.K.; validation, V.C and I.K.; investigation, V.C. and I.K.; resources, V.C. and I.K.; writing—original draft preparation, V.C. and I.K.; writing—review and editing, V.C and I.K.; supervision, V.C. and I.K.; project administration, V.C. and I.K.; funding acquisition, V.C. and I.K. All authors have read and agreed to the published version of the manuscript.

Funding

Venanzio Cichella was supported by Amazon and by the Office of Naval Research (grants N000141912106 and N000142112091). Isaac Kaminer was supported by the Office of Naval Research (grants N0001421WX01974, N0001419WX00155, N0001422WX01906) and NPS CRUSER.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. Proof of Lemma 1

Consider System (3). Add and subtract ψ ˙ c / ρ d in the first equation, and substitute the control law in Equation (4) to obtain
η ^ ˙ = V g cos ( η ^ ρ d ) ρ d ρ e k η η ^ ( t ) + ψ ˙ ψ ˙ c ρ d + V t cos ( η ^ ρ d ψ r ) ρ e + 1 ρ d ρ d ρ ˙ e = ρ e + 1 ρ d 2 V g sin ( η ) ρ e + 1 ρ d 2 V t sin ( η ^ ρ d ψ r ) .
After simple algebraic manipulations, we can rewrite the previous system of equations as
x ˙ = A x x + f * ( x ) + ψ ˙ ψ ˙ c ρ d 0 ,
where x = [ η ^ , ρ e ] ,
A x = k η V g / ρ d V g / ρ d 0 ,
f * ( x ) = V g ρ e ( 1 cos ( η ^ ρ d ) ) / ρ d V g ( ρ e + 1 / ρ d ) 2 sin ( η ^ ρ d ) V g ρ d η ^ + V t ( ρ e + 1 / ρ d ) cos ( η ^ ρ d ψ r ) / ρ d V t ( ρ e + 1 / ρ d ) 2 sin ( η ^ ρ d ψ r ) .
In [21], the authors show that x Ω v , f * ( x ) satisfies the following bound
| | f * ( x ) | | V g ρ d γ | | x | | + V t , m a x ( 1 + c ρ ) ρ d 2 1 + ( 1 + c ρ ) 2 ,
γ c ρ c ρ 2 4 + 2 + c ρ + c ρ 6 2 .
Next, consider the following Lyapunov function
V ( x ) = x P x , P = ρ d V g , m i n k η 1 1 ρ d V g , m i n k η .
Letting
W = 2 k η 2 ρ d V g , m i n 2 V g ρ d k η k η 2 V g ρ d > 0 ,
and noting that A x P + P A x = W , the derivative of the Lyapunov function can be computed as
V ˙ = x W x + 2 f * ( x ) P x + 2 ψ ˙ ψ ˙ c ρ d 0 P x .
Defining λ v such that 0 < λ v < λ m i n ( W ) 2 λ m a x ( P ) , and recalling Assumption 3 and the bound in Equation (A1), one can write
V ˙ λ m i n ( W ) | | x | | 2 + 2 λ m a x ( P ) | | f * | | | | x | | + 2 δ ψ ρ d λ m a x ( P ) | | x | | λ m i n ( W ) 2 λ m a x ( P ) ρ d V g γ | | x | | 2 + 2 λ m a x ( P ) ρ d V t , m a x ( 1 + c ρ ) ρ d 1 + ( 1 + c ρ ) 2 + δ ψ | | x | | 2 λ v λ m a x ( P ) | | x | | 2 + 2 V t , m a x ( 1 + c ρ ) ρ d 2 1 + ( 1 + c ρ ) 2 + δ ψ ρ d λ m a x ( P ) | | x | | 2 λ m a x ( P ) | | x | | λ v | | x | | V t , m a x ( 1 + c ρ ) 1 + ( 1 + c ρ ) 2 ρ d 2 δ ψ ρ d .
It follows that V ˙ < 0 if
V t , m a x ( 1 + c ρ ) 1 + ( 1 + c ρ ) 2 λ v ρ d 2 + δ ψ λ v ρ d < | | x | | .
Finally, we can conclude that if V t , m a x and δ ψ are sufficiently small and satisfy Condition (14), then | | x | | c ρ ρ d , t 0 , which completes the proof.

Appendix B. Proof of Corollary 1

The proof follows easily from the proof of Lemma 1 given in Appendix A. Consider the candidate Lyapunov function introduced in Equation (A2). Letting V t = 0 and δ ψ = 0 , from Equation (A3) it follows that
V ˙ ( x ( t ) ) 2 λ v λ m a x ( P ) | | x ( t ) | | 2 2 λ v V ( x ( t ) ) .
Applying the comparison lemma, we obtain
| | x ( t ) | | λ m a x ( P ) λ m i n ( P ) | | x ( 0 ) | | e λ v t .

Appendix C. Proof of Theorem 1

The proof of Theorem 1 unfolds in two main steps:
  • Part (a): Assuming that the speed of the UxVs V g , i , i { 1 , , n } satisfies Assumption 1, and the Vision-Based Tracking error lies inside the bounded region Ω v defined in Equation (11) at time t = 0 , using the result obtained in Lemma 1, we demonstrate that the coordination error satisfies the bound given in Equation (15).
  • Part (b): We prove that if the initial conditions of the vision-based tracking error and coordination error satisfy x ( 0 ) Ω v and ζ ( 0 ) Ω c , respectively, then the control law for the speed V c , i given in Equation (8), together with the bounds presented in Assumption 3, satisfy Assumption 1 t 0 ; therefore, x Ω v , t 0 .
Part (b) implies that Part (a) holds t 0 , thus proving Theorem 1.

Appendix C.1. Part (a)

First, we note that the result given in Equation (13) follows directly from Lemma 1 if Assumption 1 is satisfied. Thus, we can state that
| | x i | | c ρ ρ d , m a x , i { 1 , , n } , t 0 .
Second, from [25] Lemma 5, it follows that if the matrix L ¯ = Q L Q satisfies Assumption 6; then, a generic system with dynamics
ϕ ˙ = a L ¯ ϕ
converges exponentially to zero as follows:
| | ϕ ( t ) | | k ϕ | | ϕ ( 0 ) | | e γ ¯ t ,
with k ϕ = 1 , γ ¯ a n μ T ( 1 + a n T ) 2 . This implies that ([26] Theorem 4.12), for any constants m 3 and m 4 satisfying 0 < m 3 m 4 , there exists a continuously differentiable, symmetric, positive definite matrix M ( t ) R n 1 × n 1 that satisfies the following inequalities:
0 < m 1 I n 1 m 3 2 a n I n 1 M ( t ) m 4 2 γ ¯ I n 1 m 2 I n 1 ,
M ˙ a L ¯ M a M L ¯ m 3 I n 1 m 2 I n 1 .
Now, let us consider the first derivative of λ i , which can be rewritten as follows:
λ ˙ i = V c , i cos η i ρ i V t β i + ( V g , i V c , i ) cos η i ρ i ,
where β i = cos ( ψ t ( ψ i η i ) ) / ρ i . Substituting the control law given by Equation (8), we obtain
λ ˙ i = u coord , i + u coord , i ρ d , i ρ e , i V t β i + ( V g , i V c , i ) cos η i ρ i ,
which can be written in vector form as
λ ˙ = u coord + Δ e u coord V t β + Δ v ,
with
Δ v = ( V g , 1 V c , 1 ) cos η 1 ρ 1 ( V g , n V c , n ) cos η n ρ n ,
Δ e = ρ d , 1 ρ e , 1 0 0 0 ρ d , 2 ρ e , 2 0 0 0 ρ d , n ρ e , n ,
and λ , u coord , and β being the set of the individual variables collected in a column vector (e.g., λ = [ λ 1 , , λ n ] ).
Similarly, by defining C [ 0 n 1 I n 1 ] R n 1 × n and V d ρ d V d , 1 ρ d , 1 = . . . = V d , n ρ d , n , Equation (9) can be written in vector form as
u c o o r d = a L λ + V d ρ d χ I , χ ˙ I = b C L λ ,
Then, consider the coordination error vector ζ = [ ζ 1 , ζ 2 ] , where
ζ 1 = Q λ , ζ 2 = χ I V d ρ d .
Differentiating ζ 1 with respect to time, we obtain
ζ ˙ 1 = Q λ ˙ , = Q u coord + Δ e u coord V t β + Δ v , = a L ¯ ζ 1 + Q C ζ 2 a Q Δ e L Q ζ 1 + Q Δ e V d ρ d + Q Δ e C ζ 2 Q V t β + Q Δ v .
Similarly, differentiating ζ 2 , we have
ζ ˙ 2 = χ ˙ I , = b C L λ , = b C L Q ζ 1 , = b C Q L ¯ ζ 1 .
Combining Equations (A7) and (A8), we can write the dynamics of the coordination error vector in compact form as follows:
ζ ˙ = A ζ ζ + A ¯ ζ ζ + B ζ + B V t + B Δ v ,
where
A ζ = a L ¯ Q C b C Q L ¯ 0 ,
A ¯ ζ = a Q Δ e L Q Q Δ e C 0 0 ,
B ζ = Q Δ e V d ρ d 0 , B V t = Q V t β 0 , B Δ v = Q Δ v 0 .
Let us apply the change of variables
z = S ζ ζ , S ζ = I n 1 0 b a C Q I n 1 ,
with dynamics given by
z ˙ = S ζ A ζ S ζ 1 z + S ζ A ¯ ζ S ζ 1 z + S ζ ( B ζ + B V t + B Δ v ) .
Next, consider the following Lyapunov function candidate
V c = z M c z ,
with
M c = M 0 0 a 3 b 3 ( C Q Q C ) 1 ,
where M satisfies Equations (A5) and (A6). Noting that 1 n λ ( C Q Q C ) 1 , we can state that V c is bounded as follows:
m i n m 1 , a 3 b 3 | | z | | 2 V c m a x m 2 , a 3 b 3 n | | z | | 2 .
Computing the time derivative of V c , and letting Z = Q C , we obtain
V ˙ c = z T M ˙ a L ¯ M a M L ¯ + b a ( Z Z T M + M Z Z T ) M Z a b Z Z T M a b Z T 2 a 2 b 2 I n 1 z + z T a Q L Δ e Q T M a M Q Δ e L Q T + b a Z C T Δ e Q T M + b a M Q Δ e C Z T M Q Δ e C + a 3 b 2 Q L Δ e Q T Z ( Z T Z ) 1 a b Z C T Δ e Q T Z ( Z T Z ) 1 C T Δ e Q T M + a 3 b 2 ( Z T Z ) 1 Z T Q Δ e L Q T a b ( Z T Z ) 1 Z T Q Δ e C Z T a 2 b 2 ( C T Δ e Q T Z ( Z T Z ) 1 + ( Z T Z ) 1 Z T Q Δ e C ) z + ( B ζ + B V t + B Δ v ) T S ζ M c z + z T M c S ζ ( B ζ + B V t + B Δ v ) .
Using Equation (A6), | | Q C | | = | | Z | | = 1 , | | Δ e | | ρ d , m a x sup i { 1 , . . . , n } ( | | x i | | ) c ρ and | | L | | n , we can write
V ˙ c z m 3 I n 1 + b a ( Z Z M + M Z Z ) M a b I n 1 Z Z M a b I n 1 2 a 2 b 2 I n 1 z + z 2 a m 2 n + 2 b a m 2 + m 2 + a 3 b 2 n 2 + a b n c ρ 0 0 2 a 2 b 2 n + m 2 + a 3 b 2 n 2 + a b n c ρ z + 2 | | B ζ + B V t + B Δ v | | | | S ζ | | | | M c | | | | z | | .
Letting
λ M = m a x 2 a m 2 n + 2 b a m 2 + m 2 + a 3 b 2 n 2 + a b n , 2 a 2 b 2 n + m 2 + a 3 b 2 n 2 + a b n ,
inequality Equation (A12) reduces to
V ˙ c z W c z + 2 | | B ζ + B V t + B Δ v | | | | S ζ | | | | M c | | | | z | | ,
with
W c = ( m 3 λ M c ρ ) I n 1 b a ( Z Z M + M Z Z ) a b I n 1 M Z Z a b I n 1 M 2 a 2 b 2 λ M c ρ I n 1 .
At this point, one can show (see Appendix E) that, for some choice of a , b , m 3 , and m 4 , the following inequality is satisfied:
W c 2 λ c V c ,
where λ c = γ ¯ ( 1 + k n ) ρ k , which allows us to write
V ˙ c 2 λ c V c + 2 m a x m 2 , a 3 b 3 n V d , m a x ρ d , m i n ρ d , m a x | | x | | + V t , m a x ρ m i n + δ V ρ m i n | | z | | .
Applying [26] Theorem 4.19, and letting
u x v = 3 m a x V d , m a x ρ d , m i n ρ d , m a x | | x | | , V t , m a x ρ m i n , δ V ρ m i n ,
one can conclude that the system Equation (A10) is ISS, with input u x v ( t ) , and that the following inequality is satisfied t 0 :
| | z ( t ) | | m a x m 2 , a 3 b 3 n m i n m 1 , a 3 b 3 | | z ( 0 ) | | e λ c ( 1 θ ) t + m a x m 2 , a 3 b 3 n m i n m 1 , a 3 b 3 3 2 1 λ c θ sup 0 τ t | | u x v ( τ ) | | ,
with θ satisfying 0 < θ < 1 . Finally, recalling the transformation given in Equation (A9), we can conclude that
| | ζ ( t ) | | κ 1 | | ζ ( 0 ) | | e λ c ( 1 θ ) t + κ 2 sup 0 τ t | | u x v ( τ ) | | ,
with
κ 1 = | | S ζ 1 | | m a x m 2 , a 3 b 3 n m i n m 1 , a 3 b 3 | | S ζ | | , κ 2 = | | S ζ 1 | | m a x m 2 , a 3 b 3 n m i n m 1 , a 3 b 3 3 2 1 λ c θ .

Appendix C.2. Part (b)

We will prove the claim by contradiction. Assume that at some time t > 0 the Vision-Based Tracking error of the i-th UxV is such that x i ( t ) Ω v . Thus, there exists a time t such that
V ( x i ( t ) ) = c v 2 , V ˙ ( x i ( t ) ) > 0 ,
while
V ( x i ( τ ) ) c v 2 , τ [ 0 , t ) .
Notice that Equations (A17) and (A18) imply that
ρ e , i ( τ ) c ρ ρ d , m a x , η i ( τ ) c ρ , τ [ 0 , t ] ,
where
c ρ < m i n 1 2 k n ( ( 1 + a ) n + 1 + a ) ρ k 2 , V g , m a x V d , m a x / c η 2 κ 2 ( a n + 1 ) , V d , m i n V g , m i n 2 κ 2 ( a n + 1 ) .
The choice of k and ρ k in Appendix E, together with the definition of c ρ , implies that there exists a positive constant c η such that cos ( η i ( τ ) ) c o s ( c ρ ) c η > 1 2 ; therefore, the velocity command V g , i ( τ ) given in (8) is well-defined τ [ 0 , t ] . Moreover, from the proof given in Appendix C, Part (a), it follows that the coordination error at time t satisfies
| | ζ ( t ) | | κ 1 | | ζ ( 0 ) | | e λ c ( 1 θ ) t + κ 2 sup 0 τ t | | u x v ( τ ) | | ,
where, by assumption, | | ζ ( 0 ) | | c c with
c c m i n V g , m a x V d , m a x / c η 2 κ 1 ρ d , m a x ( a n + 1 ) κ 2 κ 1 c ρ ρ d , m a x , V d , m i n V g , m i n 2 κ 1 ρ d , m a x ( a n + 1 ) κ 2 κ 1 c ρ ρ d , m a x ,
Consider now the speed of the i-th vehicle at time τ given by
V g , i ( t ) = u c o o r d , i ( t ) ρ d , i c o s ( η i ( t ) ) .
Noting that u c o o r d , i satisfies
( a n + 1 ) | | ζ ( t ) | | + V d , i ρ d , i u c o o r d , i ( t ) ( a n + 1 ) | | ζ ( t ) | | + V d , i ρ d , i ,
we can find the following bound for the speed
2 ( a n + 1 ) ρ d , i | | ζ ( t ) | | + V d , i V g , i ( t ) 2 ( a n + 1 ) ρ d , i | | ζ ( t ) | | + V d , i c η .
Hence, from the result in Equation (A19), from the choice of c v and c c , and for sufficiently small values of V t , m a x , the following bound is verified at time t :
V g , m i n V g , i ( t ) V g , m a x .
Using the proof given in Appendix A, we can show that V ˙ ( x ( t ) ) < 0 , thus contradicting the claim in Equation (A17).

Appendix D. Proof of Corollary 2

Since V t = δ V = δ ψ = 0 , from Corollary 1, we obtain the following result
| | x ( t ) | | λ m a x ( P ) λ m i n ( P ) | | x ( 0 ) | | e λ v t .
Now, rewrite inequality Equation (A15) as follows:
| | ζ ( t ) | | κ 1 | | ζ ( s ) | | e λ c ( 1 θ ) ( t s ) + κ 2 sup s τ t | | u x v ( τ ) | | ,
where t s 0 . Apply Equation (A21) with s = t / 2 to obtain
| | ζ ( t ) | | κ 1 | | ζ ( t / 2 ) | | e λ c ( 1 θ ) ( t / 2 ) + κ 2 sup t / 2 τ t | | u x v ( τ ) | | .
Apply Equation (A21) with s = 0 and t replaced by t / 2 to obtain the estimate of ζ ( t / 2 ) as
| | ζ ( t / 2 ) | | κ 1 | | ζ ( 0 ) | | e λ c ( 1 θ ) ( t / 2 ) + κ 2 sup 0 τ t / 2 | | u x v ( τ ) | | .
Combining Equations (A22) and (A23), we obtain
| | ζ ( t ) | | κ 1 e λ c ( 1 θ ) ( t / 2 ) κ 1 | | ζ ( 0 ) | | e λ c ( 1 θ ) ( t / 2 ) + κ 2 sup 0 τ t / 2 | | u x v ( τ ) | | + κ 2 sup t / 2 τ t | | u x v ( τ ) | | .
Notice that from V t = δ V = 0 it follows that
sup 0 τ t | | u x v ( τ ) | | = V d , m a x ρ d , m a x ρ d , m i n sup 0 τ t | | x ( τ ) | | .
Using Equation (A20), we can write
sup 0 τ t / 2 ( | | x ( τ ) | | ) λ m a x ( P ) λ m i n ( P ) | | x ( 0 ) | | , sup t / 2 τ t ( | | x ( τ ) | | ) λ m a x ( P ) λ m i n ( P ) | | x ( 0 ) | | e λ v t / 2
Therefore, combining Equation (A24) with the previous two inequalities, and letting
κ ¯ 1 κ 1 2 , κ ¯ 2 ( 1 + κ 1 ) κ 2 λ m a x ( P ) λ m i n ( P ) V d , m a x ρ d , m a x ρ d , m i n ,
we obtain
| | ζ ( t ) | | κ ¯ 1 | | ζ ( 0 ) | | e λ c t + κ ¯ 2 | | x ( 0 ) | | e λ v + λ c 2 t ,
thus proving Corollary 2.

Appendix E. Proof of Inequality Equation (A13)

To prove inequality Equation (A13), we need to show that the following matrix is positive semi-definite:
( m 3 2 λ c m 2 ) I n 1 b a ( Z Z M + M Z Z ) λ M c ρ I n 1 a b I n 1 M Z Z a b I n 1 M 2 a 2 b 2 I n 1 a b λ c n I n 1 λ M c ρ I n 1 0 .
Using the Shur complement, sufficient conditions for Equation (A26) to hold are
2 a 2 b 2 I n 1 a b λ c n I n 1 λ M c ρ I n 1 > 0 ,
and
( m 3 2 λ c m 2 ) I n 1 b a ( Z Z M + M Z Z ) λ M c ρ I n 1 a b I n 1 M Z 2 a 2 b 2 ( I n 1 a b λ c n I n 1 ) λ M c ρ I n 1 1 Z a b I n 1 M 0
Equation (A27) is satisfied if the following holds:
2 a 2 b 2 1 a b λ c n b 2 a 2 λ M c ρ > 0 .
Letting λ c = γ ¯ ( 1 + k n ) ρ k and a b = ( k n + 1 ) ρ k γ ¯ k n , the previous inequality reduces to
2 a 2 b 2 1 1 k b 2 a 2 λ M c ρ > 0 .
Now, consider the term b 2 a 2 λ M c ρ and recall that
λ M = m a x 2 a m 2 n + 2 b a m 2 + m 2 + a 3 b 2 n 2 + a b n , 2 a 2 b 2 n + m 2 + a 3 b 2 n 2 + a b n ,
Letting m 3 = m 4 = 2 ρ k ( 1 + k n ) k n , noting that m 2 = m 4 2 γ ¯ = a b , choosing ρ k > 1 , and recalling the fact that c ρ < 1 2 k n ( ( 1 + a ) n + 1 + a ) ρ k 2 , one can show that the following relation holds:
b 2 a 2 λ M c ρ 1 k ρ k 2 ,
Therefore, Equation (A29) is satisfied if the following inequality is true:
2 a 2 b 2 1 2 k > 0 ,
which is guaranteed from the choice k > 2 .
Now, consider inequality Equation (A28). Defining
α I n 1 a b λ c n I n 1 b 2 a 2 λ M c ρ I n 1 1 ,
we obtain
( m 3 2 λ c m 2 ) I n 1 b a ( Z Z M + M Z Z ) λ M c ρ I n 1 a b I n 1 M Z b 2 2 a 2 α 1 Z a b I n 1 M 0 .
Using the fact that | | Z | | = 1 , | | M | | m 3 2 γ ¯ , and after straightforward computations, the previous inequality reduces to
m 3 1 λ c γ ¯ 2 1 α 2 a 2 b 2 1 k n ρ k 2 1 2 α 1 8 b 2 a 2 m 3 2 0 .
Finally, substituting
m 3 = 2 ρ k ( 1 + k n ) k n , λ c = γ ¯ ( 1 + k n ) ρ k , a b = ( 1 + k n ) ρ k γ ¯ k n ,
and choosing
ρ k m a x 2 k γ ¯ 1 + k n , 1 , 1 + 1 4 γ ¯ 2 + ( k n + 1 ) 2 γ ¯ 2 k 2 n 3 ,
we can show that Equation (A30) is verified, which completes the proof.

References

  1. Mcfadyen, A.; Mejias, L. A survey of autonomous vision-based see and avoid for unmanned aircraft systems. Prog. Aerosp. Sci. 2016, 80, 1–17. [Google Scholar] [CrossRef]
  2. Al-Kaff, A.; Armingol, J.M.; de La Escalera, A. A vision-based navigation system for Unmanned Aerial Vehicles (UAVs). Integr. Comput. Aided Eng. 2019, 26, 297–310. [Google Scholar] [CrossRef]
  3. Asl, H.J. Robust vision-based tracking control of VTOL unmanned aerial vehicles. Automatica 2019, 107, 425–432. [Google Scholar]
  4. Cichella, V.; Kaminer, I.; Dobrokhodov, V.; Hovakimyan, N. Coordinated vision-based tracking for multiple UAVs. In Proceedings of the 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Hamburg, Germany, 28 September–2 October 2015; IEEE: New York, NY, USA, 2015; pp. 656–661. [Google Scholar]
  5. Lawrence, A. Modern Inertial Technology: Navigation, Guidance, and Control; Springer: Berlin/Heidelberg, Germany, 1998. [Google Scholar]
  6. Redding, J.D.; McLain, T.W.; Beard, R.W.; Taylor, C.N. Vision-based target localization from a fixed-wing miniature air vehicle. In Proceedings of the American Control Conference, Minneapolis, MN, USA, 14–16 June 2006; IEEE: New York, NY, USA, 2006; p. 6. [Google Scholar]
  7. Campbell, M.E.; Wheeler, M. Vision-based geolocation tracking system for uninhabited aerial vehicles. J. Guid. Control. Dyn. 2010, 33, 521–532. [Google Scholar] [CrossRef]
  8. Bar-Shalom, Y. Tracking and Data Association; Academic Press Professional, Inc.: Cambridge, MA, USA, 1987. [Google Scholar]
  9. Ljung, L. Asymptotic behavior of the extended Kalman filter as a parameter estimator for linear systems. Autom. Control. IEEE Trans. 1979, 24, 36–50. [Google Scholar] [CrossRef] [Green Version]
  10. Ghyzel, P.A. Vision-Based Navigation for Autonomous Landing of Unmanned Aerial Vehicles. Ph.D. Thesis, Naval Postgraduate School, Monterey, CA, USA, 2000. [Google Scholar]
  11. Valasek, J.; Gunnam, K.; Kimmett, J.; Junkins, J.L.; Hughes, D.; Tandale, M.D. Vision-based sensor and navigation system for autonomous air refueling. J. Guid. Control. Dyn. 2005, 28, 979–989. [Google Scholar] [CrossRef]
  12. Aicardi, M.; Casalino, G.; Bicchi, A.; Balestrino, A. Closed loop steering of unicycle like vehicles via Lyapunov techniques. Robot. Autom. Mag. IEEE 1995, 2, 27–35. [Google Scholar] [CrossRef]
  13. Frew, E.W.; Lawrence, D.A.; Morris, S. Coordinated standoff tracking of moving targets using Lyapunov guidance vector fields. J. Guid. Control. Dyn. 2008, 31, 290–306. [Google Scholar] [CrossRef]
  14. Kaminer, I.; Pascoal, A.M.; Xargay, E.; Hovakimyan, N.; Cichella, V.; Dobrokhodov, V. Time-Critical Cooperative Control of Autonomous Air Vehicles; Butterworth-Heinemann: Oxford, UK, 2017. [Google Scholar]
  15. Cichella, V.; Choe, R.; Mehdi, S.B.; Xargay, E.; Hovakimyan, N.; Dobrokhodov, V.; Kaminer, I.; Pascoal, A.M.; Aguiar, A.P. Safe coordinated maneuvering of teams of multirotor unmanned aerial vehicles: A cooperative control framework for multivehicle, time-critical missions. IEEE Control Syst. Mag. 2016, 36, 59–82. [Google Scholar]
  16. Mesbahi, M.; Hadaegh, F.Y. Formation flying control of multiple spacecraft via graphs, matrix inequalities, and switching. J. Guid. Control. Dyn. 2001, 24, 369–377. [Google Scholar] [CrossRef]
  17. Pereira, F.L.; De Sousa, J.B. Coordinated control of networked vehicles: An autonomous underwater system. Autom. Remote Control 2004, 65, 1037–1045. [Google Scholar] [CrossRef] [Green Version]
  18. Stipanović, D.M.; Inalhan, G.; Teo, R.; Tomlin, C.J. Decentralized overlapping control of a formation of unmanned aerial vehicles. Automatica 2004, 40, 1285–1296. [Google Scholar] [CrossRef]
  19. Ma, L.; Hovakimyan, N. Vision-based cyclic pursuit for cooperative target tracking. J. Guid. Control. Dyn. 2013, 36, 617–622. [Google Scholar] [CrossRef]
  20. Ma, L.; Hovakimyan, N. Cooperative target tracking with time-varying formation radius. In Proceedings of the European Control Conference, Linz, Austria, 15–17 July 2015; IEEE: New York, NY, USA, 2015. [Google Scholar]
  21. Dobrokhodov, V.; Kaminer, I.; Jones, K.; Ghabcheloo, R. Vision-based tracking and motion estimation for moving targets using unmanned air vehicles. J. Guid. Control. Dyn. 2008, 31, 907–917. [Google Scholar] [CrossRef]
  22. Cichella, V.; Kaminer, I.; Dobrokhodov, V.; Hovakimyan, N. Cooperative Vision-Based Tracking of Multiple UAVs. In Proceedings of the AIAA Guidance, Navigation, and Control Conference, Boston, MA, USA, 19–22 August 2013. [Google Scholar]
  23. Xargay, E.; Kaminer, I.; Pascoal, A.; Hovakimyan, N.; Dobrokhodov, V.; Cichella, V.; Aguiar, A.P.; Ghabcheloo, R. Time-Critical Cooperative Path Following of Multiple Unmanned Aerial Vehicles over Time-Varying Networks. AIAA J. Guid. Control. Dyn. 2013, 36, 499–516. [Google Scholar] [CrossRef] [Green Version]
  24. Biggs, N. Algebraic Graph Theory; Cambridge University Press: New York, NY, USA, 1993. [Google Scholar]
  25. Panteley, E.; Loría, A. Uniform Exponential Stability for Families of linear Time-Varying Systems. In Proceedings of the IEEE Conference on Decision and Control, Sydney, Australia, 12–15 December 2000; pp. 1948–1953. [Google Scholar]
  26. Khalil, H.K. Nonlinear Systems; Prentice Hall: Englewood Cliffs, NJ, USA, 2002. [Google Scholar]
Figure 1. Coordinated vision-based target tracking—general framework.
Figure 1. Coordinated vision-based target tracking—general framework.
Drones 07 00177 g001
Figure 2. Vision-based target tracking—problem formulation.
Figure 2. Vision-based target tracking—problem formulation.
Drones 07 00177 g002
Figure 3. Coordinated vision-based tracking mission—2D paths.
Figure 3. Coordinated vision-based tracking mission—2D paths.
Drones 07 00177 g003
Figure 4. Vision-based tracking error for each vehicle.
Figure 4. Vision-based tracking error for each vehicle.
Drones 07 00177 g004
Figure 5. Vision-based tracking error for each vehicle.
Figure 5. Vision-based tracking error for each vehicle.
Drones 07 00177 g005
Figure 6. Coordination error.
Figure 6. Coordination error.
Drones 07 00177 g006
Figure 7. Actual speeds of the vehicles.
Figure 7. Actual speeds of the vehicles.
Drones 07 00177 g007
Table 1. Symbols and definitions.
Table 1. Symbols and definitions.
SymbolDefinition
UxVUnmanned (ground, aerial, underwater, surface) vehicle
I Inertial frame
V g ( t ) , v g ( t ) Speed and velocity of the UxV at time t
V c , i ( t ) , ψ ˙ c , i ( t ) Speed and angular rate commands for UxV i at time t
ψ ( t ) Heading angle of the UxV at time t
V t ( t ) , ψ t ( t ) Speed and heading angle of the UxV at time t
ρ ( t ) Horizontal distance between UxV and target at time t
λ ( t ) Line of sight phase angle at time t
η ^ ( t ) Vision-based angle tracking error at time t
ρ d Desired range
ρ e ( t ) Vision-based distance tracking error at time t
x ( t ) Vision-based tracking error vector at time t
G i ( t ) Neighborhood of vehicle i at time t
Λ ( t ) Communication graph
L ( t ) Laplacian of the graph at time t
T , μ Parameters representing the quality of the communication network
ζ ( t ) Coordination error vector at time t
h i j ( t ) Heterogeneity parameter between nodes i and j at time t
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Cichella, V.; Kaminer, I. Coordinated Vision-Based Tracking by Multiple Unmanned Vehicles. Drones 2023, 7, 177. https://doi.org/10.3390/drones7030177

AMA Style

Cichella V, Kaminer I. Coordinated Vision-Based Tracking by Multiple Unmanned Vehicles. Drones. 2023; 7(3):177. https://doi.org/10.3390/drones7030177

Chicago/Turabian Style

Cichella, Venanzio, and Isaac Kaminer. 2023. "Coordinated Vision-Based Tracking by Multiple Unmanned Vehicles" Drones 7, no. 3: 177. https://doi.org/10.3390/drones7030177

APA Style

Cichella, V., & Kaminer, I. (2023). Coordinated Vision-Based Tracking by Multiple Unmanned Vehicles. Drones, 7(3), 177. https://doi.org/10.3390/drones7030177

Article Metrics

Back to TopTop