A Fast Marching Method for Pursuit-Evasion Games

Auteurs-es

  • Emiliano Cristiani
  • Maurizio Falcone

DOI :

https://doi.org/10.1685/

Résumé

Fast Marching (FM) Methods were introduced by J. A. Sethian in 1996 to solve the eikonal equation M19_CristianiFalcone0.png on M19_CristianiFalcone1.png with Dirichlet boundary conditions in the case that M19_CristianiFalcone2.png does not change sign. Since then some improvements have been proposed in order to extend the FM technique to more generale equations. The main assumptions for these methods is the convexity of the Hamiltonian M19_CristianiFalcone3.png. We present an extension of the FM method based on a semi-Lagrangian discretization to (non-convex) minmax Hamiltonians which appear in pursuit-evasion games and an extension of FM method for the eikonal equation to the case that M19_CristianiFalcone2.png changes sign and it is time-dependent. [DOI: 10.1685 / CSC06059] About DOI

Téléchargements

Publié

2007-10-01

Numéro

Vol. 1 (2006)

Rubrique

Articles

Licence

Authors who submit to this journal agree to the following terms: a) Authors retain copyright over their work, while allowing the SIMAI to place this accepted work under a Creative Commons Attribution License (CC license), which allows others to freely access, use, and share the work, with an acknowledgement of the work's authorship. b) Authors are able to waive the terms of the CC license and enter into separate, additional contractual arrangements for the non-exclusive distribution and subsequent publication of this work (e.g., publish a revised version in a journal, post it to an institutional repository or publish it in a book). with an acknowledgement of its initial publication on “Communications to SIMAI Congress”. c) In addition, authors are encouraged to post and share their work online (e.g., in institutional repositories or on their website).