Automatic differentiation of non-holonomic fast marching for computing most threatening trajectories under sensors surveillance - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

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

Résumé

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.
Fichier principal
Vignette du fichier
llncs.pdf (1.29 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01503607 , version 1 (12-04-2017)

Identifiants

Citer

Jean-Marie Mirebeau, Johann Dreo. Automatic differentiation of non-holonomic fast marching for computing most threatening trajectories under sensors surveillance. International Conference on Geometric Science of Information, Nov 2017, Paris, France. pp.791-800. ⟨hal-01503607⟩
344 Consultations
155 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More