1 citations · 1 across the 4 of their papers we have counts for
4 papers
Reinforcement Learning-based Heuristics to Guide Domain-Independent Dynamic Programming
Minori Narita, Ryo Kuroiwa, J. Christopher Beck
Domain-Independent Dynamic Programming (DIDP) is a state-space search paradigm based on dynamic programming for combinatorial optimization. In its current implementation, DIDP guid…
Optimization Models for the Quadratic Traveling Salesperson Problem
Yuxiao Chen, Nivetha Sathish, Anubhav Singh +2
The quadratic traveling salesperson problem (QTSP) is a generalization of the traveling salesperson problem, in which all triples of consecutive customers in a tour determine the t…
Domain-Independent Dynamic Programming
Ryo Kuroiwa, J. Christopher Beck
For combinatorial optimization problems, model-based paradigms such as mixed-integer programming (MIP) and constraint programming (CP) aim to decouple modeling and solving a proble…
PRP Rebooted: Advancing the State of the Art in FOND Planning
Christian Muise, Sheila A. McIlraith, J. Christopher Beck
Fully Observable Non-Deterministic (FOND) planning is a variant of classical symbolic planning in which actions are nondeterministic, with an action's outcome known only upon execu…