A Case Study on Numerical Analysis of a Path Computation Algorithm
Lack of numerical precision in control software -- in particular, related to trajectory computation -- can lead to incorrect results with costly or even catastrophic consequences. Various tools have been proposed to analyze the precision of program computations. This paper presents a case study on numerical analysis of an industrial implementation of the fast marching algorithm, a popular path computation algorithm frequently used for trajectory computation. We briefly describe the selected tools, present the applied methodology, highlight some attention points, summarize the results and outline future work directions.
Authors
- Nikolaï Kosmatov (ORCID: https://orcid.org/0000-0003-1557-2813)
- Franck Védrine
- Grégoire Boussu
Institutions
- Commissariat à l'Énergie Atomique et aux Énergies Alternatives (FR)
- Université Paris-Saclay (FR)
- Thales (Australia) (AU)
- Laboratoire d'Intégration des Systèmes et des Technologies (FR)
- Thales (France) (FR)
Publication Details
- Journal
- Electronic Proceedings in Theoretical Computer Science
- Published
- 2024-11-20
- DOI
- https://doi.org/10.4204/eptcs.411.8
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Agence Nationale de la Recherche