Extended Performance Guarantees for Receding Horizon Search with Terminal Cost
Benjamin Biggs,Daniel J. Stilwell,James McMahon,Benjamin Biggs,Daniel J. Stilwell,James McMahon
The computational difficulty of planning search paths that seek to maximize a general deterministic value function increases dramatically as desired path lengths increase. Mobile search agents with limited computational resources often utilize receding horizon methods to address the path planning problem. Unfortunately, receding horizon planners may perform poorly due to myopic planning horizons. ...
