AI RESEARCH
Value Functions for Temporal Logic: Optimal Policies and Safety Filters
arXiv CS.LG
•
ArXi:2605.01051v1 Announce Type: cross While Bellman equations for basic reach, avoid, and reach-avoid problems are well studied, the relationship between value optimality and policy optimality becomes subtle in the undiscounted infinite-horizon setting, particularly for complicated tasks. Greedily maximizing the Q-function can produce policies that indefinitely defer task completion for reach-avoid problems, or equivalently, Until specifications, even when the value function is optimal.