Multiagent Pathfinding Under Rigid, Optimization, and Uncertainty Constraints

Many contemporary navigation applications rely on the well-known A* algorithm for pathfinding. We present a pathfinding technique utilizing the cross-entropy method and Bayesian networks that is capable of finding paths for multiple agents while satisfying rigid, optimization, and uncertainty constraints.