- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper studies continuous-state control when executable dynamics and symbolic path predicates are available. SDTA-MDP groups states by possible program paths, estimates stopped-excursion costs, durations, and successor probabilities, and solves a reference frontier SMDP. Its block actions guide a local controller with task-defined terminal heuristics; bounded continuous actions use representative actions and local candidate refinement. The analysis establishes path-signature preservation, conditional successor-support correctness, and sampling-error bounds for the reference model. Seven small stochastic tasks evaluate control quality, representation size, and computational cost.
Critical strengths
Combining semantic partitions with temporal summaries is a useful integration direction. The paper clearly distinguishes path preservation from value preservation and limits its theoretical claims accordingly. The evaluation includes matched seeds, uncertainty estimates, preparation costs, and a local-lookahead ablation; several tasks achieve good control with few symbolic blocks.
Critical weaknesses
The contribution of the frontier SMDP to the executed controller is insufficiently established. Section 2.3 explicitly passes only the block action, while finite-action local search enumerates all actions independently of that input (lines 309-311). Its terminal potential is also task-defined rather than the frontier value (lines 340-342). Table 11 removes local lookahead, but does not test whether the frontier solve improves the same local controller.
The planning comparison does not resolve this concern: MPC holds each candidate action constant for six steps, whereas SDTA-MDP searches future action choices with a terminal heuristic (Appendix D). A matched local-planning baseline would better establish the benefit of time aggregation. The small task suite and substantial preparation times also leave the practical advantage uncertain.
Novelty needs sharper positioning. SymPar, Section 4 already includes existential elimination of disturbance variables and intersection of overlapping path conditions. The related-work discussion also omits symbolic dynamic programming for continuous states and actions, particularly Zamani et al. (AAAI 2012). These connections do not establish duplication, but narrow what is new.
Questions for authors
- What dependence on the solved frontier policy remains in finite-action execution? Please compare against the same partition, path filtering, heuristic, and lookahead with the frontier solve removed. For continuous actions, how much do fixed or randomized incumbent anchors change actions and performance?
- Does the advantage persist against a planner using the same action candidates, terminal potential, safety handling, and noise approximation, while allowing future actions to vary? Please report preparation and online costs separately.
- Since the reference distributions need not match actual block-entry distributions, how sensitive are block actions and performance to their choice? A focused sensitivity check would help assess the temporal summaries without requiring a global optimality theorem.
- Please distinguish the new components from SymPar's stochastic projection and from prior symbolic dynamic programming, including Zamani et al. (2012). Is the main advance the integration with time aggregation and local control?