- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes Last Deceptive State-guided Deceptive Planning (LDS-DP). It selects a state classified as deceptive that has the highest value for the real goal, uses a DDM-style linear program to plan from the start to that state, and then follows a shortest path to the real goal. The authors motivate this design by arguing that DPP can expose the real goal prematurely and that DDM can continue taking costly deception-aware actions after the last deceptive state. Experiments in deterministic and mildly stochastic grid worlds compare LDS-DP with DPP, DDM, and other baselines. They report shorter paths after the last deceptive state and broadly similar measured deception to DDM.
Critical strengths
A clear, implementable approach to the paper's chosen objective. Given the objective of placing the last deceptive state as close as possible to the real goal and then minimizing travel after that state, the paper provides a concrete procedure: select a switching state using precomputed goal values, plan a deception-aware route to it, and follow a shortest path thereafter. This makes the chosen objective operational and allows its consequences to be evaluated. The strength of this contribution depends on the separate question of whether this objective is preferable to optimizing deception over the complete trajectory.
Critical weaknesses
-
The paper does not justify its ordering of optimization objectives.LDS-DP first fixes the deceptive state closest to the real goal, then minimizes deception cost on a route to that state, and finally follows a shortest path. This prioritizes a short post-LDS tail before considering the deception and travel cost of the complete route. It is unclear why this ordering is preferable to a route with a somewhat earlier LDP but stronger deception, fewer truthful states, or lower cost overall. The theoretical result establishes a shortest truthful tail under the stated assumptions; it does not establish that this choice improves the overall deception-travel trade-off. The experiments report similar mean real-goal posteriors for LDS-DP and DDM, rather than an improvement in whole-trajectory deception, and do not report deceptive density or directly compare their full-route deception objectives. This matters because the paper presents DDM's continued optimization after the LDS as a deficiency, whereas DDM deliberately optimizes deception over the complete trajectory.
-
The claimed LDS contribution is insufficiently distinguished from DPP's LDP. The trajectory-level definition of LDS closely matches DPP's LDP. DPP already aims to bring the LDP as close as possible to the real goal, characterizes the closest deceptive node as the limiting boundary, and explicitly discusses finding it by evaluating nodes. If the DPP baselines expose the goal earlier, the cause may lie in their particular target-selection or path-generation procedures, rather than in the LDP concept or criterion. The paper should state which specific limitation of those procedures its state selection resolves and what, if anything, is conceptually new about LDS.
-
The first-stage planner appears to be a direct adaptation of DDM. Once the switching state is fixed, the paper uses DDM's deception cost and LP formulation, changing the absorbing target from the real goal to the selected state. This is a concrete integration, but the paper does not clearly identify a new optimization mechanism in this stage or explain what it achieves beyond applying DDM to a different terminal state. In combination with the close relationship between LDS and LDP, this leaves the methodological contribution insufficiently differentiated from the two cited works.
Questions for authors
-
Justification of the optimization objective: Why is it appropriate to choose the deceptive state closest to the real goal before optimizing the path from the start? A path through this state may have a costly or temporarily truthful prefix, while a path with a more distant LDP may be more deceptive over its full duration. What assumption, application objective, or result establishes that minimizing the final truthful tail should take priority over whole-trajectory deception cost, deceptive density, or the time of first exposure? Without such a justification, it is difficult to assess whether the proposed method solves the motivating problem or simply optimizes a different metric from DDM.
-
Evidence for the claimed advantage of this objective: The paper already compares mean real-goal posterior along the trajectories and finds no significant difference between LDS-DP and DDM. Can the authors report, under a common observer model, deceptive density or the fraction of truthful states, first exposure, and each method's full-trajectory deception cost, alongside path length? A controlled comparison that varies the switching state while holding the first-stage planner fixed would help show whether prioritizing the closest deceptive state improves whole-route deception or its trade-off with travel cost, rather than only shortening the final tail by construction.