DocumentCode
2908395
Title
Optimal minimax pursuit evasion on a Manhattan grid
Author
Krishnamoorthy, K. ; Darbha, Swaroop ; Khargonekar, Pramod P. ; Casbeer, D. ; Chandler, P. ; Pachter, M.
Author_Institution
InfoSciTex Corp., Dayton, OH, USA
fYear
2013
fDate
17-19 June 2013
Firstpage
3421
Lastpage
3428
Abstract
The optimal control of a pursuer searching for a slower moving evader on a Manhattan grid road network is considered. The pursuer does not have on-board capability to detect the evader and relies instead on Unattended Ground Sensors (UGSs) to locate the evader. We assume that all the intersections in the road network have been instrumented with UGSs. When an evader passes by an UGS location, it triggers the UGS and this time-stamped information is stored by the UGS. When the pursuer arrives at an UGS location, the UGS informs the pursuer if and when the evader passed by. When the evader and the pursuer arrive at an UGS location simultaneously, the UGS is triggered and this information is instantly relayed to the pursuer, thereby enabling “capture”.We derive exact values for the optimal worst case time to capture the evader on the Manhattan grid and the corresponding pursuit policy.
Keywords
minimax techniques; network theory (graphs); optimal control; Manhattan grid road network; UGS; network intersection; optimal minimax pursuit evasion; time stamped information; unattended ground sensor; Delays; Games; History; Roads; Sensors; Switches; Trajectory;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference (ACC), 2013
Conference_Location
Washington, DC
ISSN
0743-1619
Print_ISBN
978-1-4799-0177-7
Type
conf
DOI
10.1109/ACC.2013.6580360
Filename
6580360
Link To Document