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://ntrs.nasa.gov/citations/20230018303
Cite the original work for its findings. Save a collection to share your selection of sources.