8 citations · 16 across the 23 of their papers we have counts for
21 papers · 1 filter
Cycle-Consistent Neural Explanation of Formal Verification Certificates
Andoni Rodriguez, Alberto Pozanco, Daniel Borrajo
Formal verification produces machine-checkable certificates that attest to the satisfaction or violation of temporal properties, yet these certificates remain opaque to non-special…
Counterfactual Reasoning in Automated Planning
Alberto Pozanco, Daniel Borrajo, Manuela Veloso
Automated planning traditionally assumes that all aspects of a planning task (initial state, goals, and available actions) are fully specified in advance, an approach well-suited t…
Planning Task Shielding: Detecting and Repairing Flaws in Planning Tasks through Turning them Unsolvable
Alberto Pozanco, Pietro Totis, Marianela Morales +1
Most research in planning focuses on generating a plan to achieve a desired set of goals. However, a goal specification can also be used to encode a property that should never hold…
GenePlan: Evolving Better Generalized PDDL Plans using Large Language Models
Andrew Murray, Danial Dervovic, Alberto Pozanco +1
We present GenePlan (GENeralized Evolutionary Planner), a novel framework that leverages large language model (LLM) assisted evolutionary algorithms to generate domain-dependent ge…
Semantic Partial Grounding via LLMs
Giuseppe Canonaco, Alberto Pozanco, Daniel Borrajo
Grounding is a critical step in classical planning, yet it often becomes a computational bottleneck due to the exponential growth in grounded actions and atoms as task size increas…
Unveiling Interesting Insights: Monte Carlo Tree Search for Knowledge Discovery
Pietro Totis, Alberto Pozanco, Daniel Borrajo
Organizations are increasingly focused on leveraging data from their processes to gain insights and drive decision-making. However, converting this data into actionable knowledge r…
The Subset Sum Matching Problem
Yufei Wu, Manuel R. Torres, Parisa Zehtabi +4
This paper presents a new combinatorial optimisation task, the Subset Sum Matching Problem (SSMP), which is an abstraction of common financial applications such as trades reconcili…
Planning with Minimal Disruption
Alberto Pozanco, Marianela Morales, Daniel Borrajo +1
In many planning applications, we might be interested in finding plans that minimally modify the initial state to achieve the goals. We refer to this concept as plan disruption. In…
GenPlanX. Generation of Plans and Execution
Daniel Borrajo, Giuseppe Canonaco, Tomás de la Rosa +10
Classical AI Planning techniques generate sequences of actions for complex tasks. However, they lack the ability to understand planning tasks when provided using natural language.…
A Planning Compilation to Reason about Goal Achievement at Planning Time
Alberto Pozanco, Marianela Morales, Daniel Borrajo +1
Identifying the specific actions that achieve goals when solving a planning task might be beneficial for various planning applications. Traditionally, this identification occurs po…
Projection Abstractions in Planning Under the Lenses of Abstractions for MDPs
Giuseppe Canonaco, Alberto Pozanco, Daniel Borrajo
The concept of abstraction has been independently developed both in the context of AI Planning and discounted Markov Decision Processes (MDPs). However, the way abstractions are bu…
On Learning Action Costs from Input Plans
Marianela Morales, Alberto Pozanco, Giuseppe Canonaco +3
Most of the work on learning action models focus on learning the actions' dynamics from input plans. This allows us to specify the valid plans of a planning task. However, very lit…
TRIP-PAL: Travel Planning with Guarantees by Combining Large Language Models and Automated Planners
Tomas de la Rosa, Sriram Gopalakrishnan, Alberto Pozanco +2
Travel planning is a complex task that involves generating a sequence of actions related to visiting places subject to constraints and maximizing some user satisfaction criteria. T…
Generalising Planning Environment Redesign
Alberto Pozanco, Ramon Fraga Pereira, Daniel Borrajo
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 assum…
On Computing Plans with Uniform Action Costs
Alberto Pozanco, Daniel Borrajo, Manuela Veloso
In many real-world planning applications, agents might be interested in finding plans whose actions have costs that are as uniform as possible. Such plans provide agents with a sen…
Contrastive Explanations of Centralized Multi-agent Optimization Solutions
Parisa Zehtabi, Alberto Pozanco, Ayala Bloch +2
In many real-world scenarios, agents are involved in optimization problems. Since most of these scenarios are over-constrained, optimal solutions do not always satisfy all agents.…
Fairness in Multi-Agent Planning
Alberto Pozanco, Daniel Borrajo
In cooperative Multi-Agent Planning (MAP), a set of goals has to be achieved by a set of agents. Independently of whether they perform a pre-assignment of goals to agents or they d…
Anticipatory Counterplanning
Alberto Pozanco, Yolanda E-Martín, Susana Fernández +1
In competitive environments, commonly agents try to prevent opponents from achieving their goals. Most previous preventing approaches assume the opponent's goal is known a priori.…
Explaining Preference-driven Schedules: the EXPRES Framework
Alberto Pozanco, Francesca Mosca, Parisa Zehtabi +2
Scheduling is the task of assigning a set of scarce resources distributed over time to a set of agents, who typically have preferences about the assignments they would like to get.…
Multi-tier Automated Planning for Adaptive Behavior (Extended Version)
Daniel Ciolek, Nicolás D'Ippolito, Alberto Pozanco +1
A planning domain, as any model, is never complete and inevitably makes assumptions on the environment's dynamic. By allowing the specification of just one domain model, the knowle…
Error Analysis and Correction for Weighted A*'s Suboptimality (Extended Version)
Robert C. Holte, Ruben Majadas, Alberto Pozanco +1
Weighted A* (wA*) is a widely used algorithm for rapidly, but suboptimally, solving planning and search problems. The cost of the solution it produces is guaranteed to be at most W…