Combinatorial reconfiguration is the problem of transforming one solution of a combinatorial
problem into another, where each transformation may only apply small changes to a solution …

SymK is a planner that performs symbolic search using Binary Decision Diagrams to find a
single optimal or the best k plans. It is designed to be a versatile planner by supporting …

The growing utilization of planning tools in practical scenarios has sparked an interest in
generating multiple high-quality plans. Consequently, a range of computational problems …

In Environment Design, one interested party seeks to affect another agent's decisions by
applying changes to the environment. Most research on planning environment (re) design …

Classical planning asks for a sequence of operators reaching a given goal. While the most
common case is to compute a plan, many scenarios require more than that. However …

Recent work on diverse planning has focused on a two-step setting where the first step
consists of generating a large number of plans, and the second step consists of selecting a …

In classical planning, the goal is to derive a course of actions that allows an intelligent agent
to move from any situation it finds itself in to one that satisfies its goals. Classical planning is …

Abstract ICKEPS (International Competition on Knowledge Engineering for Planning and
Scheduling) was created to make aware of the importance of domain engineering for …

Does bias exist in planning algorithms? If so, how does bias manifest, and how important is
this bias? Answering this question requires a formal, mathematical definition of bias. We …

In this report, we briefly describe our entry to the 2023 ISR competition: Planning Algorithms
for Reconfiguring Independent Sets (PARIS 2023). Our solver is a modified version of the …