Generalized Planning: Non-Deterministic Abstractions and Trajectory Constraints
IJCAI, pp. 873-879, 2017.
We study the characterization and computation of general policies for families of problems that share a structure characterized by a common reduction into a single abstract problem. Policies $\mu$ that solve the abstract problem P have been shown to solve all problems Q that reduce to P provided that $\mu$ terminates in Q. In this work,...More
PPT (Upload PPT)