Publications
My publications can be found and downloaded from DBLP (or even from Google Scholar) directly.
If there is a paper that you cannot obtain from there, please email me and I will be happy to send you an electronic copy. 👍
Below, I list feature papers by areas of work. If you are a student who is potentially interested in working with me in some of these areas, these are initial papers to read… 😉
- AI Automated Planning
- Reasoning about Action and Change
- Behavior Composition
- Agent-oriented Programming
- AI for Business Processes
- Goal Recognition
AI Automated Planning
Automated planning is the problem of automatically producing a plan (i.e., a course of actions) in order to achieve a certain goal (e.g., have all the packages delivered in a logistic domain). Those plans are generally meant to be executed by intelligent agents, autonomous robots, unmanned vehicles, or complex embedded systems.
I am particularly interested in advanced forms of planning (e.g., such as planning under non-determinism or adaptive planning), the link with controller synthesis for adversarial planning, and path-planning (or pathfinding) in an AI context.
Together with students, and sometimes as part of the COSC1024/2048 Agent-Oriented Programming course, we developed path-planning libraries and simulation-visualisation toolkit (that are compatible with Moving-AI benchmark framework).
Some representative papers in the area are:
- Ivan D. Rodriguez, Blai Bonet, Sebastian Sardiña, Hector Geffner: Flexible FOND Planning with Explicit Fairness Assumptions. ICAPS 2021: 290-29. Best Paper Award.
- Extend strong fairness in FOND to a conditional version; compact and elegant solver in ASP.
- Daniel Alfredo Ciolek, Nicolás D’Ippolito, Alberto Pozanco, Sebastian Sardiña:
[Multi-Tier Automated Planning for Adaptive Behavior]. ICAPS 2020: 66-74
- Extract controllers under different environment assumptions that can degrade their behavior (but still operate) when assumptions are invalidated.
- Nicolás D’Ippolito, Natalia Rodríguez, Sebastian Sardiña:
Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis. Journal of Artificial Intelligence Research, 61: 593-621 (2018)
- A study of FOND planning fairness and how it can be realized in safety games (Bucchi condition).
- Giuseppe De Giacomo, Alfonso Gerevini, Fabio Patrizi, Alessandro Saetti, and Sebastian Sardina. Agent planning programs. Artificial Intelligence, 231:64–106, 2016.
- We go beyond single-shot planning tasks and solve a network of goals, which represent the “program” of the agent.
- Sarah Hickmott and Sebastian Sardina. Optimality properties of planning via Petri net unfolding: A formal analysis. In Alfonso Gerevini and Adele Howe, editors, Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), pages 170-177, Thessaloniki, Greece, September 2009. AAAI Press.
- Exploit Petri-net native parallelism to perform concurrent planning.
- Davide Aversa, Sebastian Sardina, and Stavros Vassos. Path planning with inventory-driven jump-point-search. In Proceedings of the AAAI-AIIDE, 2015.
- Mix task and navigation planning.
Reasoning about Action and Change
This area is concerned with how to specify and verify dynamic systems. Different approaches to representing and reasoning about systems that change include temporal logic, model checking, dynamic logic, and modelling change in Artificial Intelligence. Some problems that I am interested include:
- Progression of knowledge bases: what is the new knowledge base after an update action?
- Incomplete knowledge and relation with (incomplete) databases.
- Knowledge precondition for plans: what knowledge is required to successfully execute a plan?
- Verification of properties in dynamic systems, even in infinite systems (i.e., systems manipulating infinite number of objects).
Some example of relevant papers in the area are:
Marcelo Arenas, Jorge A. Baier, Juan S. Navarro, Sebastian Sardiña: Incomplete Causal Laws in the Situation Calculus Using Free Fluents. IJCAI 2016: 907-914
Nitin Yadav and Sebastian Sardina. Using strategic logics to reason about agent programs. In Francesca Rossi, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 3101-3105, Beijing, China, August 2013. AAAI Press. In Best Papers Sister Conferences track (Best Paper Award at JELIA'12).
Stavros Vassos and Sebastian Sardina. A database-type approach for progressing action theories with bounded effects. In Gerhard Lakemeyer and Sheila A. McIlraith, editors, Knowing, Reasoning, and Acting: Essays in Honour of Hector J. Levesque, chapter 29, pages 467-486. College Publications, July 2011.
Sebastian Sardina, Giuseppe De Giacomo, Yves Lespérance, and Hector J. Levesque. On the limits of planning over belief states under strict uncertainty. In Proceedings of Principles of Knowledge Representation and Reasoning (KR), pages 463-471, Lake District, UK, June 2006.
Obs: picture produced by my very good friend Diego Martinez.
Behavior Composition
With computers now present in everyday devices like mobile phones, credit cards, cars and planes or places like homes, offices and factories, the trend is to build embedded complex systems from a collection of simple components. A complex surveillance system for a smart house can be then “realised” (i.e., implemented) by suitably coordinating the behaviours (i.e., the operational logic) of hundreds (or thousands) of simple devices and artifacts (e.g., lights, blinds, a microwave, a vacuum cleaner, video cameras, a floor cleaning robot, etc.) installed in the house. The problem then is how to automatically build an embedded controller-coordinator to bring about a desired target complex system by suitably coordinating the available components.
Behavior composition is not restricted to smart environments and can also be applied to build complex systems in advanced manufacturing systems, web-services, or even in video games, for story generation.
A short (fairly easy to read) overview paper on the topic and a more in-depth journal article on the topic are:
Giuseppe De Giacomo, Fabio Patrizi, and Sebastian Sardina. Building virtual behaviors from partially controllable available behaviors in nondeterministic environments. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), pages 523-526, Portsmouth, NH, USA, 2014. AAAI Press.
Giuseppe De Giacomo, Fabio Patrizi, and Sebastian Sardina. Automatic behavior composition synthesis. Artificial Intelligence Journal, 196:106-142, 2013.
A tutorial on the topic delivered at IJCAI'15 can be found here.
Agent-oriented Programming
I am interested high-level programming languages for complex systems and intelligent agents. High-level agent-oriented programming can be seen as a middle ground between automated planning and full standard programming (e.g., Java). The idea is to write programs in a loose language so that programs will contain “gaps” that need to be filled out at execution time. These programs can typically be useful to program robotic or software agents with higher level cognitive functions that involve reasoning, for example, about goals, perception, actions, the mental states of other agents, collaborative task execution, etc.
I am interested in mainly two type of agent systems, namely, Belief-Desire-Intention (BDI) event-driven systems (like SARL, JACK, or JASON) and GOLOG-type systems built on top of the famous situation calculus logical framework (like IndiGolog, a high-level programming language where programs are executed incrementally to allow for interleaved action, planning, sensing, and exogenous events).
Some relevant papers on BDI agents are:
- Max Waters, Lin Padgham, and Sebastian Sardina. Evaluating coverage based intention selection. In Proceedings of Autonomous Agents and Multi-Agent Systems (AAMAS), pages 957-964, Paris, France, May 2014. IFAAMAS. Nominated for Jodi Best Student Paper award.
- Dhirendra Singh, Sebastian Sardina, and Lin Padgham. Extending BDI plan selection to incorporate learning from experience. Journal of Robotics and Autonomous Systems, 58:1067-1075, 2010.
- Sebastian Sardina and Lin Padgham. A BDI agent programming language with failure recovery, declarative goals, and planning. Autonomous Agents and Multi-Agent Systems, 23(1):18-70, 2011.
Relevant papers on situation calculus based high-level control languages:
- Giuseppe De Giacomo, Yves Lespérance, Hector J. Levesque, and Sebastian Sardina. IndiGolog: A high-level programming language for embedded reasoning agents. In Rafael H. Bordini, Mehdi Dastani, Jürgen Dix, and Amal El Fallah-Seghrouchni, editors, Multi-Agent Programming: Languages, Platforms and Applications, chapter 2, pages 31-72. Springer, New York, USA, 2009. ISBN: 978-0-387-89298-6.
- Andrea Marrella, Massimo Mecella, and Sebastian Sardina. SmartPM: An adaptive process management system through situation calculus, indigolog, and classical planning. In Chitta Baral and Giuseppe De Giacomo, editors, Proceedings of Principles of Knowledge Representation and Reasoning (KR), pages 518-527, Vienna, Austria, 2014.
AI for Business Processes
In this area we combine AI and Business Processes processes together.
One line of work involves using AI planning and agent-oriented systems to obtain more powerful BPM frameworks, for example, by enhancing dynamic adaptation or performing conformance checking.
Another line of work involves using BPM models and techniques for cost-based goal recognition, which allows us to perform intention recognition without a plan library or PDDL models.
Some representative papers are:
- Artem Polyvyanyy, Zihang Su, Nir Lipovetzky, Sebastian Sardiña: Goal Recognition Using Off-The-Shelf Process Mining Techniques. AAMAS 2020: 1072-1080
- Andrea Marella, Massimo Mecella, and Sebastian Sardina. Intelligent process adaptation in the SmartPM system. ACM Transactions on Intelligent Systems and Technology (ACM TIST) 8(2): 25:1-25:43 (2017).
- Giuseppe De Giacomo, Fabrizio Maria Maggi, Andrea Marrella, Sebastian Sardiña: Computing Trace Alignment Against Declarative Process Models Through Planning. ICAPS 2016: 367-375.
- Andrea Marrella, Massimo Mecella, and Sebastian Sardina. SmartPM: An adaptive process management system through situation calculus, indigolog, and classical planning. In Chitta Baral and Giuseppe De Giacomo, editors, Proceedings of Principles of Knowledge Representation and Reasoning (KR), pages 518-527, Vienna, Austria, 2014.
Goal Recognition
The goal/intention recognition problem is the task of identifying an agent’s intent by observing its behaviour. Traditionally, the problem has involved matching a sequence of observations to a plan in a pre-defined plan library; the winning plan being the one that “best” matches the observations.
Recent developments dispense with the overhead of a plan library and instead—based on the assumption that the observed agent is behaving rationally—take a cost-based approach and uses classical planning technology to generate candidate plans as needed over a domain model.
In a series of work, we have extended and improved the cost-based approach to goal recognition, both for general task planning and path planning. We have worked on how to make recognition faster and more robust to irrational/erratic observed behavior. We have also looked at its’ dual problem: deceptive behavior, the problem of generating behavior that is as deceptive as possible, while still achieving the intended objective.
Some representative papers are:
- Peta Masters, Sebastian Sardiña: Expecting the unexpected: Goal recognition for rational and irrational agents. Artificial Intelligence. 297: 103490 (2021)
- Artem Polyvyanyy, Zihang Su, Nir Lipovetzky, Sebastian Sardiña: Goal Recognition Using Off-The-Shelf Process Mining Techniques. AAMAS 2020: 1072-1080
- Peta Masters, Sebastian Sardiña: Cost-Based Goal Recognition in Navigational Domains. Journal Artificial Intelligence Research 64: 197-242 (2019)
- Peta Masters, Sebastian Sardiña: Deceptive Path-Planning. IJCAI 2017: 4368-4375.