MORetro* uses weighted scalarization and BO-informed sampling on multi-objective A* search to produce Pareto-optimal synthesis routes with optimality guarantees for fixed single-step models.
Multiobjective A* search with consistent heuristics , volume =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.AI 2verdicts
UNVERDICTED 2representative citing papers
Defines plan disruption and provides planning compilations to jointly minimize action costs and state modifications in AI planning tasks.
citing papers explorer
-
From Feasible to Practical: Pareto-Optimal Synthesis Planning
MORetro* uses weighted scalarization and BO-informed sampling on multi-objective A* search to produce Pareto-optimal synthesis routes with optimality guarantees for fixed single-step models.
-
Planning with Minimal Disruption
Defines plan disruption and provides planning compilations to jointly minimize action costs and state modifications in AI planning tasks.