A Case Study on Numerical Analysis of a Path Computation Algorithm
Gr\'egoire Boussu (Thales Research, Technology), Nikolai Kosmatov, (Thales Research, Technology), Franck V\'edrine (Universit\'e, Paris-Saclay, CEA, List)
TL;DR
This paper conducts a detailed numerical analysis of an industrial implementation of the fast marching algorithm, highlighting precision issues and evaluating analysis tools to improve trajectory computation reliability.
Contribution
It provides a case study applying numerical analysis tools to a real-world path computation algorithm, emphasizing practical challenges and solutions.
Findings
Identification of numerical precision issues in the implementation
Evaluation of analysis tools for trajectory computation accuracy
Recommendations for future improvements in control software
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.