32 citations · 50 across the 10 of their papers we have counts for
9 papers · 1 filter
Flexible FOND Planning with Explicit Fairness Assumptions
Ivan D. Rodriguez, Blai Bonet, Sebastian Sardina +1
We consider the problem of reaching a propositional goal condition in fully-observable non-deterministic (FOND) planning under a general class of fairness assumptions that are give…
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…
Situation Calculus for Synthesis of Manufacturing Controllers
Giuseppe De Giacomo, Brian Logan, Paolo Felli +2
Manufacturing is transitioning from a mass production model to a manufacturing as a service model in which manufacturing facilities 'bid' to produce products. To decide whether to…
Phase transition in the knapsack problem
Nitin Yadav, Carsten Murawski, Sebastian Sardina +1
We examine the phase transition phenomenon for the Knapsack problem from both a computational and a human perspective. We first provide, via an empirical and a theoretical analysis…
Addendum to: Summary Information for Reasoning About Hierarchical Plans
Lavindra de Silva, Sebastian Sardina, Lin Padgham
Hierarchically structured agent plans are important for efficient planning and acting, and they also serve (among other things) to produce "richer" classical plans, composed not ju…
Path planning with Inventory-driven Jump-Point-Search
Davide Aversa, Sebastian Sardina, Stavros Vassos
In many navigational domains the traversability of cells is conditioned on the path taken. This is often the case in video-games, in which a character may need to acquire a certain…
Supervisory Control for Behavior Composition
Paolo Felli, Nitin Yadav, Sebastian Sardina
We relate behavior composition, a synthesis task studied in AI, to supervisory control theory from the discrete event systems field. In particular, we show that realizing (i.e., im…
Reasoning about Agent Programs using ATL-like Logics
Nitin Yadav, Sebastian Sardina
We propose a variant of Alternating-time Temporal Logic (ATL) grounded in the agents' operational know-how, as defined by their libraries of abstract plans. Inspired by ATLES, a va…
Qualitative Approximate Behavior Composition
Nitin Yadav, Sebastian Sardina
The behavior composition problem involves automatically building a controller that is able to realize a desired, but unavailable, target system (e.g., a house surveillance) by suit…