Search Results for author:
Found 4 papers, 0 papers with code
Scalable FastMDP for Pre-departure Airspace Reservation and Strategic De-conflict
Our results show that on commodity GPU hardware we can perform flight plan scheduling against 2000-3000 known flight plans and with server-class hardware the performance can be higher.
An Efficient Algorithm for Multiple-Pursuer-Multiple-Evader Pursuit/Evasion Game
We present a method for pursuit/evasion that is highly efficient and and scales to large teams of aircraft.
Memoryless Exact Solutions for Deterministic MDPs with Sparse Rewards
The algorithm to solve the MDP does not depend on the size of the state space for either time or memory complexity, and the ability to follow the optimal policy is linear in time and space with the path length of following the optimal policy from the initial state.
Fast Online Exact Solutions for Deterministic MDPs with Sparse Rewards
Markov Decision Processes (MDPs) are a mathematical framework for modeling sequential decision making under uncertainty.
