NASA NTRS · 20230018303
Formal Verification, Distributed Computing, and Path Planning Algorithms
Abstract
The safety- and mission-critical nature of much of the work done at NASA requires algorithms and software to be exceedingly reliable. Formal methods techniques are one way of ensuring this high level of robustness. This talk will discuss the development and formal verification of autonomous aircraft path planning algorithms related to the Bellman-Ford shortest path algorithm, including consideration of distributed computation of the algorithm.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Aaron Dutle, Esther Conrad. Formal Verification, Distributed Computing, and Path Planning Algorithms. https://engineeringpapers.com/record/nasa%3A20230018303/formal-verification-distributed-computing-and-path-planning-algorithms
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Engineering Papers by Indiciae: BibTeX · RIS.