Path Planning Method Using Threat Probability Maps

Resource Overview

A path planning approach based on threat probability maps that first constructs a probabilistic threat model and then employs the A-star algorithm for optimal path search with implementation details.

Detailed Documentation

This paper presents a path planning method utilizing threat probability maps. The methodology involves two key phases: first, constructing a threat probability map that visualizes threat likelihoods across different geographical locations using probabilistic modeling techniques. Second, implementing the A*-search algorithm for trajectory optimization, where the algorithm evaluates nodes by combining the actual cost from the start node (g-cost) with a heuristic estimate to the goal (h-cost). The implementation typically uses a priority queue to efficiently select the most promising paths while incorporating threat probabilities as risk-weighted costs in the evaluation function. This approach enables autonomous vehicles to navigate around potential threats during flight operations, significantly enhancing mission safety and operational reliability through mathematically-grounded risk assessment.