• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - No thumbnail

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

Mirebeau, Jean-Marie; Dreo, Johann (2017), Automatic differentiation of non-holonomic fast marching for computing most threatening trajectories under sensors surveillance, in Frank Nielsen; Frédéric Barbaresco, Geometric Science of Information Third International Conference, GSI 2017, Paris, France, November 7-9, 2017, Proceedings, Springer : Berlin Heidelberg, p. 791-800. 10.1007/978-3-319-68445-1_91

Type
Communication / Conférence
External document link
https://hal.archives-ouvertes.fr/hal-01503607
Date
2017
Book title
Geometric Science of Information Third International Conference, GSI 2017, Paris, France, November 7-9, 2017, Proceedings
Book author
Frank Nielsen; Frédéric Barbaresco
Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-319-68444-4
Pages
791-800
Publication identifier
10.1007/978-3-319-68445-1_91
Metadata
Show full item record
Author(s)
Mirebeau, Jean-Marie
Dreo, Johann cc
Abstract (EN)
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.
Subjects / Keywords
optimization; motion planning; sensor placement; Anisotropic fast marching

Related items

Showing items related by title and author.

  • Thumbnail
    On the Accuracy of Anisotropic Fast Marching 
    Mirebeau, Jean-Marie (2012) Document de travail / Working paper
  • Thumbnail
    Anisotropic Fast-Marching on cartesian grids using Lattice Basis Reduction 
    Mirebeau, Jean-Marie (2014) Article accepté pour publication ou publié
  • Thumbnail
    Efficient Fast Marching with Finsler metrics 
    Mirebeau, Jean-Marie (2013) Article accepté pour publication ou publié
  • Thumbnail
    Vessel Tree Extraction using Radius-Lifted Keypoints Searching Scheme and Anisotropic Fast Marching Method 
    Chen, Da; Mirebeau, Jean-Marie; Cohen, Laurent D. (2016) Article accepté pour publication ou publié
  • Thumbnail
    Minimal Stencils for Discretizations of Anisotropic PDEs Preserving Causality or the Maximum Principle 
    Mirebeau, Jean-Marie (2016) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo