The disclosure of the present patent application relates to aerial monitoring and surveillance, and particularly to a method of managing aerial patrols of a region of interest carried out by unmanned aerial vehicles (UAVs).
Traditional methods for monitoring and countering adversarial unmanned aerial vehicles (UAVs), such as closed-circuit television (CCTV) cameras and radar, have limitations due to their stationary nature and narrow scope, thus resulting in limited scalability. In response, the development of systems utilizing remotely controlled UAVs for enhanced patrolling missions is of great interest, particularly due to patrolling UAVs offering greater flexibility and scalability. However, present UAV patrol system face challenges, including the need for continuous communication with a base station, which restricts operational flexibility. Additionally, the predictability of their patrolling patterns can be easily circumvented by unauthorized drones, thus highlighting the necessity for advancements in UAV autonomy to improve decision-making and operations, particularly in scenarios where real-time human intervention is not feasible. Thus, a method of managing unmanned aerial vehicle patrols solving the aforementioned problems is desired.
The method of managing unmanned aerial vehicle (UAV) patrols is a method for organizing and managing a fleet of UAVs for patrolling a geographic region for the detection of threats. The fleet of UAVs forms a network in communication with a base station. Within the base station, a geographic map is converted into a three-dimensional occupancy map, and a region of interest therein is identified. The three-dimensional occupancy map may be divided into a grid of cells to define a coordinate system corresponding to geographic locations. The three-dimensional occupancy map assists in identifying occupied and unoccupied spaces. During patrols, the UAVs visit two types of waypoints: critical waypoints and strategic waypoints. The set of critical waypoints are established within the region of interest and each of the critical waypoints has a set of coordinates on the three-dimensional occupancy map associated therewith. An operator within the base station may use the three-dimensional occupancy map to identify the critical waypoints in the region of interest, where the critical waypoints may be, as an example, landmarks or locations of known strategic value. Alternatively, the critical waypoints can be generated automatically by the base station during an initialization phase.
To establish the strategic waypoints, a set of seed points are generated using a beta probability distribution. Voronoi tessellation is applied to produce the set of strategic waypoints within the region of interest by using the set of seed points as an input. Each of the strategic waypoints has a set of coordinates on the three-dimensional occupancy map associated therewith. The set of coordinates associated with each of the strategic waypoints is a centroid of a corresponding Voronoi cell produced by the Voronoi tessellation. The beta probability distribution, f(x; α, β), used to generate the set of seed points is given by
where B(α, β) is the beta function, x is a random variable ranging between 0 and 1, and α and β are shape parameters. For each of the seed points, the beta probability distribution, f(x; α, β), is applied twice to produce a set of abstract coordinates (xβ, yβ), where each of xβ and yβ ranges between 0 and 1. The set of abstract coordinates (xβ, yβ) for each of the seed points is scaled to a set of geographic coordinates (xgeo, ygeo) on the three-dimensional occupancy map as xgeo=xβ×W and ygeo=yβ×L, where W is the width of the three-dimensional occupancy map and L is the length of the three-dimensional occupancy map.
A priority score is assigned to each of the critical waypoints and each of the strategic waypoints. The priority score, P, for each of the critical waypoints and each of the strategic waypoints is given by P=B+(T×A), where B is a base score, T is a total number of threats previously encountered at the corresponding one of the critical and strategic waypoints, and A is a threat adjustment value, where each of the critical waypoints has a base score, B, of s, where s is a generic base score, and each of the strategic waypoints has a base score, B, of s×u, where 0<u<1. The threat adjustment value, A, has a value of 10 for each of the threats previously encountered at the corresponding one of the critical and strategic waypoints.
A plurality of UAVs is divided into a set of leader UAVs and a set of follower UAVs. The critical and strategic waypoints are clustered by applying k-mean clustering based on the total number of leader UAVs. A risk factor is assigned to each of the clusters, and the UAVs are assigned to the clusters based on the respective risk factors of the clusters. The risk factor, R, for each of the clusters is given by
where S is a sum of the priority scores of the critical and strategic waypoints within the respective cluster, and U is a total number of the UAVs assigned to the respective cluster.
Each of the UAVs visits the critical and strategic waypoints within the cluster assigned thereto. The choice of a particular one of the critical and strategic waypoints to be visited is based on a weighted score. The weighted score, Sw, is given by Sw=(WI×I)+(WD×D)+(WP×P), where I is an idleness time, D is a distance between a corresponding one of the UAVs and the corresponding one of the critical and strategic waypoints, and P is the priority score of the corresponding one of the critical and strategic waypoints. WI is a weight for the idleness, WD is a weight for the distance, and WP is a weight for the priority score.
Additionally, the follower UAVs may each have the capability of generating decoy waypoints at regular intervals. The decoy waypoints have randomly selected coordinates within the corresponding cluster of the corresponding one of the follower UAVs. Further, when a threat is detected, leader and follower UAVs may have the capability to transition into a chaser UAV. Upon detection of a potential threat, the chaser UAV continuously monitors the potential threat.
These and other features of the present subject matter will become readily apparent upon further review of the following specification.
Similar reference characters denote corresponding features consistently throughout the attached drawings.
The method of managing unmanned aerial vehicle (UAV) patrols is a method for organizing and managing a fleet of UAVs for patrolling a geographic region for the detection of threats. As illustrated in
As will be discussed in detail below, the UAVs are divided into groups, including leader UAVs 104 and follower UAVs 106. Either type of UAV (leader or follower) may transition into a chaser UAV 108, as will be discussed in detail below. Although only two leader UAVs 104, four follower UAVs 106 and one chaser UAV 108 are shown in
The base station 102 may be, for example, a ground-based control center or command post. The base station 102 is responsible for planning the mission, assigning initial roles to individual UAVs and facilitating the exchange of data, commands and feedback between the UAVs 104, 106, 108 and the control team as needed. The base station 102 has software and geospatial analysis tools for mission planning and data analysis. As shown in
As shown in
As illustrated in
It should be understood that
To establish the strategic waypoints 128, a set of seed points are generated using a beta probability distribution. Voronoi tessellation is applied to produce the set of strategic waypoints 128 within the region of interest 130 by using the set of seed points as an input. Each of the strategic waypoints 128 has a set of coordinates on the three-dimensional occupancy map 152. The set of coordinates associated with each of the strategic waypoints 128 is a centroid of a corresponding Voronoi cell produced by the Voronoi tessellation. The Voronoi tessellation optimizes the strategic waypoints 128 by minimizing their proximity to one another, thus reducing the overall density of waypoints 126, 128 while maintaining strategic coverage. By reducing instances of strategic waypoints 128 being excessively close to one another, redundancy in patrolling is minimized.
The beta probability distribution, f(x; α, β), used to generate the set of seed points is given by
where B(α, β) is the beta function, x is a random variable ranging between 0 and 1, and α and β are shape parameters. For each of the seed points, the beta probability distribution, f(x; α, β), is applied twice to produce a set of abstract coordinates (xβ, yβ), where each of xβ and yβ ranges between 0 and 1. The set of abstract coordinates (xβ, yβ) for each of the seed points is scaled to a set of geographic coordinates (xgeo, ygeo) on the three-dimensional occupancy map 152 as xgeo=xβ×W and ygeo=yβ×L, where W is the width of the three-dimensional occupancy map 152 and L is the length of the three-dimensional occupancy map 152. By setting the shape parameter α higher than the shape parameter β, the strategic waypoints 128 will be more concentrated on the border 132 of the region of interest 130, which is important since the border 132 is assumed to be an intruder's entry point into the region of interest 130. In
A priority score is assigned to each of the critical waypoints 126 and each of the strategic waypoints 128. The priority score, P, for each of the critical waypoints 126 and each of the strategic waypoints 128 is given by P=B+(T×A), where B is a base score, Tis a total number of threats previously encountered at the corresponding one of the critical and strategic waypoints 126, 128, and A is a threat adjustment value, where each of the critical waypoints 126 has a base score, B, of s, where s is a generic base score, and each of the strategic waypoints 128 has a base score, B, of s×u, where 0<u<1. The threat adjustment value, A, has a value of 10 for each of the threats previously encountered at the corresponding one of the critical and strategic waypoints 126, 128. As indicated above, the priority score, P, is calculated based on waypoint type and the number of encountered threats. Critical waypoints 126 have the highest score, indicating that they should be revisited more frequently. Strategic waypoints 128 have a “medium” priority score. This priority score is further adjusted based on the number of threats encountered at the waypoint.
As noted above, the fleet of UAVs is divided into a set of leader UAVs 104 and a set of follower UAVs 106. The leader UAVs 104 and the follower UAVs 106 form the network 100 in communication with the base station 102. The critical and strategic waypoints 126, 128 are clustered by applying k-mean clustering based on the total number of leader UAVs 104. The number of clusters is determined based on the number of UAVs such that each UAV is assigned a set of waypoints that can be efficiently covered within an allocated time frame. A risk factor is assigned to each of the clusters, and the UAVs are assigned to the clusters based on the respective risk factors of the clusters. The risk factor, R, for each of the clusters is given by
where S is a sum of the priority scores of the critical and strategic waypoints 126, 128 within the respective cluster, and U is a total number of the UAVs assigned to the respective cluster.
The clusters have different states: “Assigned”, “Reassigning” and “Unassigned”. The state of the cluster is “Assigned” when it has a leader UAV 104; the state is “Reassigning” when there is at least one follower UAV 106 but no leader UAV 104; and, otherwise, the state is “Unassigned” when there is neither a follower UAV 106 nor a leader UAV 104. The risk factor is initialized to zero before the mission starts and adjusts dynamically based on the number of UAVs in each cluster and the total priority score of all waypoints 126, 128. This prioritization ensures focused surveillance where it is most needed. For each cluster, the topological map 154 is created using visibility graphs. The topological map 154 and visibility graphs help understand which waypoints are directly visible to each other, indicating a clear line of sight. In cases where there is no direct line of sight between two waypoints (i.e., they are not directly connected in the visibility graph), a path planning algorithm is used. This algorithm finds a feasible path between these waypoints, considering the occupancy map 152 to avoid obstacles.
Each of the UAVs visits the critical and strategic waypoints 126, 128 within the cluster assigned thereto. The choice of a particular one of the critical and strategic waypoints 126, 128 to be visited is based on a weighted score. The weighted score, Sw, is given by Sw=(WI×I)+(WD×D)+(WP×P), where I is an idleness time, D is a distance between a corresponding one of the UAVs and the corresponding one of the critical and strategic waypoints, and P is the priority score of the corresponding one of the critical and strategic waypoints. WI is a weight for the idleness, WD is a weight for the distance, and WP is a weight for the priority score. The idleness time, I, is the time since the waypoint was last visited. A longer idleness time increases a waypoint's priority for visitation. The distance, D, represents the distance from the UAV's current position to the waypoint. Shorter distances are generally preferred to minimize travel time.
In addition to the above factors, each waypoint 126, 128 also has a current threat condition associated therewith. The current threat condition indicates whether a potential threat at a certain waypoint is “Active” or “Inactive”. When the threat condition becomes “Active”, the number of threats, T, is automatically increased by one. Further, each waypoint 126, 128 has a visiting status associated therewith. The visiting status of a waypoint follows a specific cycle: “Unvisited”, “Visit”, or “Visited”. Initially, all waypoints are “Unvisited”. When a waypoint is under monitoring, its status changes to “Visit”. After the monitoring is complete, the waypoint's status is updated to “Visited”. After a certain period, waypoints automatically revert to “Unvisited” with a higher priority score which elapses faster. Following cluster selection, each UAV independently navigates the waypoints 126, 128 within its cluster. During its navigation, the UAV checks whether there is an intruder. If an intruder is detected, the UAV informs the base station 102 and tracks the intruder until the base station 102 acknowledges that it is in full control of the situation.
Each leader UAV 104 selects its cluster based on the risk factor. Once the cluster status is “Assigned”, the leader UAV 104 makes real-time decisions on the waypoint to be visited, considering factors such as idleness, distance and priority score. Each follower UAV 106 independently selects the waypoint to be visited, considering factors such as idleness, distance and priority score, similar to the leader UAV 104. Additionally, the follower UAVs 106 may each have the capability of generating decoy waypoints 129 at regular intervals. The decoy waypoints 129 have randomly selected coordinates within the corresponding cluster of the corresponding one of the follower UAVs 106. The decoy waypoints 129 are dynamically created and randomly positioned targets that emerge temporarily and vanish once visited. Their primary purpose is to mislead potential intruders, preventing them from recognizing the usual landmarks and routes the UAVs utilize. By intermittently introducing these unpredictable waypoints, the UAVs can effectively obscure their regular patrol patterns, making it more challenging for unauthorized entities to predict or learn their standard operating paths. This strategy enhances the overall security and unpredictability of UAV patrolling missions.
Further, when a threat is detected, leader and follower UAVs 104, 106 may have the capability to transition into a chaser UAV 108. Upon detection of a potential threat, the chaser UAV 108 continuously monitors the potential threat. The chaser role of the UAV is activated when a potential threat is identified. When a UAV transitions to a chaser UAV 108, it becomes focused on monitoring the detected intruder. The chaser UAV 108 continues to monitor the target until it receives specific instructions from the base station 102 or executes a predetermined action, such as forcing a landing, if no instructions are received within a specific timeframe.
A shared memory system is used to maintain dynamic replicas of the environment maps 150, 152, 154 stored in the memory 114 of base station 102 and to bolster fleet autonomy and improve decision-making processes. The shared memory system supports a decentralized command structure while offering hierarchical layered access and visibility to both the UAVs and the base station 102 according to their operational roles. To facilitate communication, at least two UAVs are designated as communication overlay UAVs 107, ensuring access to the shared memory. In
In the intra-cluster layer, the follower UAVs 106 have access to information within their cluster, including the roles and positions of all UAVs, the overall cluster status (“Assigned”, “Reassigning” and “Unassigned”), the waypoints' attributes, and the cluster risk factor. The leader UAVs 104 have access to the inter-cluster layer. In addition to the intra-cluster information, the inter-cluster layer facilitates the exchange of information between different clusters. The inter-cluster layer includes details on the status of other clusters based on the presence or absence of leader UAVs 104, the number of follower UAVs 106, and other clusters' risk factors. The global layer provides the threat management system and base station 102 with a comprehensive overview of the mission that covers UAV statuses, cluster conditions, UAV health, mission progression, and critical event notifications. The base station 102 intermittently receives updates that facilitate information flow and enable informed responses by operational teams.
Upon initialization, the base station 102 loads the critical and strategic waypoints, clusters and their initial states into the shared memory. The base station 102 assigns roles (i.e., leader or follower UAV) and clusters the UAVs based on the availability of the UAVs and the state of each cluster. If an unassigned cluster exists, the next available UAV is designated as a leader UAV and assigned to that cluster, marking the cluster as “Assigned”. If all clusters are already assigned, the base station 102 assigns the UAV a follower role and directs it to the cluster, considering the cluster risk factor. The base station 102 then starts the patrolling phase.
As discussed above, during the patrolling phase, the UAVs patrol their assigned areas with autonomy, deciding in real-time which waypoints to visit. This decision-making process employs a heuristic algorithm to adapt to changing conditions and prioritize surveillance tasks. Additionally, at regular intervals, follower UAVs 106 add and visit decoy waypoints 129 to increase unpredictability. The decoy waypoints 129 disappear after being visited. Each UAV is responsible for making the decision of which waypoint to visit next, changing its status from “Unvisited” to “Visiting” and, subsequently, to “Visited”. After a certain period, waypoints revert to “Unvisited” status that have a higher priority score elapsing faster.
As discussed above, the cluster risk factors, waypoint priority scores and the cluster states are automatically calculated in the shared memory. When a threat is encountered at a waypoint, both the risk factor for the cluster containing this waypoint and the priority score of the waypoint itself are updated. Moreover, the risk factor is recalculated if the number of UAVs in the cluster changes. The cluster state is updated if the status of leadership within the cluster shifts, specifically transitioning to “Assigned” when a leader UAV 104 is present, to “Reassigning” when at least one follower UAV 106 remains but no leader UAV 104 is present, and to “Unassigned” when there are neither follower nor leader UAVs are in the cluster.
The UAVs may switch roles in response to changes in operational requirements. When a leader UAV 104 identifies a threat, it transitions to a chaser UAV 108 to closely monitor the situation. This change automatically marks the original cluster as “Reassigning” if the cluster has follower UAVs 106, potentially triggering a follower UAV 106 to step up as the new leader UAV 104, or “Unassigned” if the cluster has no follower UAVs 106, triggering a request for support from other clusters in the shared memory to ensure uninterrupted surveillance. A leader UAV 104 may transition to a follower role if it currently has follower UAVs 106 in its cluster and another cluster is identified as having a higher risk factor.
If a follower UAV 106 detects that its cluster status is “Reassigning” in the shared memory, it elevates itself to a leader role. This self-promotion is crucial for maintaining continuous coverage and adapting to evolving surveillance needs. When a follower UAV 106 discovers a threat in its cluster, it changes to a chaser role and updates its new role in the shared memory. If a threat is “Inactive”, a chaser UAV 108 checks if there is an “Unassigned” cluster. If an “Unassigned” cluster exists, the chaser UAV 108 becomes its leader UAV 104. If not, the chaser UAV 108 becomes a follower UAV 106 within a cluster with a higher risk factor. Additionally, a leader UAV 104 may transition to lead another cluster if the other cluster is “Unassigned” under specific conditions: a) if the current cluster has follower UAVs 106; or b) if the current cluster has no follower UAVs 106 but the other cluster has a higher risk factor.
It is to be understood that the method of managing unmanned aerial vehicle patrols is not limited to the specific embodiments described above, but encompasses any and all embodiments within the scope of the generic language of the following claims enabled by the embodiments described herein, or otherwise shown in the drawings or described above in terms sufficient to enable one of ordinary skill in the art to make and use the claimed subject matter.
Number | Name | Date | Kind |
---|---|---|---|
9334052 | Pasko | May 2016 | B2 |
9599994 | Bogdanowicz | Mar 2017 | B1 |
10200814 | Zhang | Feb 2019 | B1 |
12125392 | Colpitts | Oct 2024 | B1 |
20060235610 | Ariyur | Oct 2006 | A1 |
20080243372 | Bodin | Oct 2008 | A1 |
20120210853 | Abershitz | Aug 2012 | A1 |
20170131727 | Kurdi | May 2017 | A1 |
20180012370 | Aghamohammadi | Jan 2018 | A1 |
20180074520 | Liu | Mar 2018 | A1 |
20190035285 | Priest | Jan 2019 | A1 |
20190227540 | Suvitie | Jul 2019 | A1 |
20190353794 | Hiroi | Nov 2019 | A1 |
20200041653 | Hiroi | Feb 2020 | A1 |
20200064869 | Pickett | Feb 2020 | A1 |
20210304625 | Ali | Sep 2021 | A1 |
20210358315 | Moster | Nov 2021 | A1 |
20210405660 | Liu | Dec 2021 | A1 |
20220005361 | de la Cruz | Jan 2022 | A1 |
20220318720 | Li | Oct 2022 | A1 |
20220365534 | Kuhlman | Nov 2022 | A1 |
20230315128 | Bradley | Oct 2023 | A1 |
20240077871 | Choi | Mar 2024 | A1 |
20240361775 | Lee | Oct 2024 | A1 |
Number | Date | Country |
---|---|---|
106705970 | Jul 2020 | CN |
111580563 | Aug 2020 | CN |
110488871 | Feb 2022 | CN |
112327923 | Apr 2022 | CN |
112666981 | Nov 2022 | CN |
115930962 | Apr 2023 | CN |
110926477 | Jul 2023 | CN |
117369510 | Jan 2024 | CN |
117369515 | Jan 2024 | CN |
Entry |
---|
Bertuccelli et al. “Robust UAV search for environments with imprecise probability maps.” Proceedings of the 44th IEEE Conference on Decision and Control. IEEE, 2005. |
Bertuccelli et al. “Search for dynamic targets with uncertain probability maps.” 2006 American Control Conference. IEEE, 2006. |
Lim et al. “Waypoint guidance of cooperative UAVs for intelligence, surveillance, and reconnaissance.” 2009 IEEE International Conference on Control and Automation. IEEE, 2009. |
Zhu et al. “Decentralized probabilistic multi-robot collision avoidance using buffered uncertainty-aware Voronoi cells.” Autonomous Robots 46.2 (2022): 401-420. |