The results show that this form of regression can dramatically generalize partial states across multiple domains, reducing the number of variables considered for execution monitoring by up to 70%, and demonstrate that the resulting execution monitor is robust enough to recover frequently in an environment with unexpected changes.
Abstract
In automated planning, logical regression is an operation that returns the most general condition necessary for an action to achieve a particular formula. It has many applications, such as allowing for more robust plan execution and providing compact policies for non-deterministic planning. Although relatively simple to calculate in basic planning settings, logical regression becomes significantly more complex when additional factors, such as axioms, are present. We introduce a methodology for approximating the logical regression of an action in a domain that includes axioms; an approximation that limits conditions to partial states. Our method produces minimal partial states while avoiding the recalculation of axioms. To demonstrate the impact of our methods, we embed our form of regression in an execution monitoring context, a well-established setting that can benefit greatly from logical regression. Our results show that this form of regression can dramatically generalize partial states across multiple domains, reducing the number of variables considered for execution monitoring by up to 70%, and demonstrate that the resulting execution monitor is robust enough to recover frequently in an environment with unexpected changes: several domains recover over 50% of the time in our tests.
This work introduces a semantic-preserving PDDL-to-Lean conversion, and uses an LLM to generate both the generalized plan and the formal proof that it solves every instance satisfying the domain constraints, and evaluates this approach on 13 commonly used benchmark domains.
Katharina Stein, Chaahat Jain, J. Hoffmann et al.· 0 citations
It is shown a proof-of-the-concept lifted planner can sometimes solve the BPP problem by using a domain-independent heuristic that guides search for a plan.
This paper introduces Conditional TPOs (cTPOs), which extend TPOs with richer relative-timing constraints and conditional event activations based on environmental conditions and proves that this decomposition is complete and preserves plan optimality while improving the interpretability of complex tasks.
Current open-weight models cannot guarantee satisfaction of the test constraints required for reliable automated model repair, and this paper evaluates the ability of recent open-weight large language models to perform this repair task using an LLM-only approach.
It is argued that domain abstractions offer a framework that lends itself much better to simple numeric planning, with abstract state spaces that are computed incrementally using counterexample-guided abstraction refinement (CEGAR), avoiding the exhaustive exploration of PDBs.
M. Fritzsche, Mikhail Gruntov, Alexander Shleyfman et al.· Proceedings of the Internati...· 0 citations
Planned Test-Time Scaling (PTTS) provides a general framework for improving test-time scaling by coordinating reasoning branches, with zero-shot and trainable instantiations that yield substantial performance gains.
Xue-Qing Wu, Lang-Xing Bai, Hritik Bansal et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.