Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search
Keywords:Heuristic search, Planning and scheduling with mixed continuous and discrete states/actions/decisions
AbstractDomain-independent dynamic programming (DIDP) is a recently proposed model-based paradigm for combinatorial optimization where a problem is formulated as dynamic programming (DP) and solved by a generic solver. In this paper, we develop anytime heuristic search solvers for DIDP, which quickly find a feasible solution and continuously improve it to prove optimality. We implement six anytime heuristic search algorithms previously used as problem-specific methods and evaluate them on nine different problem classes. Our experimental results show that most of the anytime DIDP solvers outperform an existing A*-based solver, mixed-integer programming, and constraint programming in proving optimality, solution quality, and primal integral across multiple problem classes. In particular, complete anytime beam search (CABS) performs the best, improving on the best-known solution for one instance of traveling salesman problem with time windows and closing five instances of one-to-one multi-commodity pick-and-delivery traveling salesman problems.
How to Cite
Kuroiwa, R., & Beck, J. C. (2023). Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search. Proceedings of the International Conference on Automated Planning and Scheduling, 33(1), 245-253. https://doi.org/10.1609/icaps.v33i1.27201