Optimal periodic patrolling trajectories of UUVs guarding a channel

Given a number of patrollers, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximize the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 2011 American Control Conference s. 888 - 893
Hlavní autoři: Chung, H., Polak, E., Royset, J. O., Sastry, S. S.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2011
Témata:
ISBN:1457700808, 9781457700804
ISSN:0743-1619
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Given a number of patrollers, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximize the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' sensors are imperfect and that their motions are subject to turn rate constraints, and that the intruder travels straight down a channel with constant speed. Using discretization of time and space, we approximate the optimal control problem with a large-scale nonlinear programming problem which we solve to obtain an approximately stationary solution and a corresponding optimized trajectory for each patroller. In numerical tests, we obtain new insight - not easily obtained using geometric calculations - into efficient patrol trajectory design for up to two patrollers in a narrow channel where interaction between the patrollers is unavoidable due to their limited turn rate.
ISBN:1457700808
9781457700804
ISSN:0743-1619
DOI:10.1109/ACC.2011.5990745