Approximate solutions of moving target search problems using dynamic programming | lit.salon