Automatic differentiation of non-holonomic fast marching for computing most threatening trajectories under sensors surveillance

From MaRDI portal
Publication:1689236

DOI10.1007/978-3-319-68445-1_91zbMATH Open1428.65002arXiv1704.03782OpenAlexW2752922522MaRDI QIDQ1689236FDOQ1689236


Authors: Jean-Marie Mirebeau, Johann Dreo Edit this on Wikidata


Publication date: 12 January 2018

Abstract: We consider a two player game, where a first player has to install a surveillance system within an admissible region. The second player needs to enter the the monitored area, visit a target region, and then leave the area, while minimizing his overall probability of detection. Both players know the target region, and the second player knows the surveillance installation details.Optimal trajectories for the second player are computed using a recently developed variant of the fast marching algorithm, which takes into account curvature constraints modeling the second player vehicle maneuverability. The surveillance system optimization leverages a reverse-mode semi-automatic differentiation procedure, estimating the gradient of the value function related to the sensor location in time N log N.


Full work available at URL: https://arxiv.org/abs/1704.03782




Recommendations





Cited In (5)





This page was built for publication: Automatic differentiation of non-holonomic fast marching for computing most threatening trajectories under sensors surveillance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689236)