The optimal control of a “blind” UAV searching for a target moving on a road network and heading at a known speed toward a set of goal vertices is considered. To aid the UAV, some roads in the network have been instrumented with Unattended Ground Sensors (UGSs) that detect the target's passage. When the UAV arrives at an instrumented node, the UGS therein informs the UAV if and when the target visited the node. In addition, the UAV can choose to wait/loiter for an arbitrary time at any UGS location/node. At time 0, the target passes by an entry node on his way towards one of the exit nodes. The UAV also arrives at this entry node after some delay and is thus informed about the presence of the target/target in the network, whereupon the chase is on - the UAV is tasked with capturing the target. Because the UAV is blind, capture entails the UAV and target being collocated at an UGS location. If this happens, the UGS is triggered and this information is instantaneously relayed to the UAV, thereby enabling capture. On the other hand, if the target reaches one of the exit nodes without being captured, he is deemed to have escaped. For a given initial delay, we compute the pursuit policy, if it exists, that achieves capture in minimum time, under worst-case target actions.
[1]
Pramod P. Khargonekar,et al.
Optimal Cooperative Pursuit on a Manhattan Grid
,
2013
.
[2]
Hua Chen,et al.
Continuous-Time Intruder Isolation Using Unattended Ground Sensors on a General Graph
,
2014
.
[3]
T. Başar.
Control theory : twenty-five seminal papers (1932-1981)
,
2001
.
[4]
Pramod P. Khargonekar,et al.
Optimal minimax pursuit evasion on a Manhattan grid
,
2013,
2013 American Control Conference.
[5]
Shreyas Sundaram,et al.
Pursuit on a graph under partial information from sensors
,
2016,
2017 American Control Conference (ACC).