On timeline-based games and their complexity

Theoretical Computer Science. 815 Nicola Gigante; Angelo Montanari (University of Udine), Andrea Orlandini (CNR-ISTC),Marta Cialdea Mayer (University of Roma Tre), Mark Reynolds (The University of Western Australia) (2020) Abstract In timeline-based planning, domains are described as sets of independent, but interacting, components, whose behaviour over time (the set of timelines) is governed by a set of temporal constraints.…

A Prototype for the Robust Execution of Flexible Plans

Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, Logics, Automata and Synthesis, Rende, Italy, November 19–20, 2019. Lanzilli Annarita; Cialdea Mayer Marta (ROMA TRE University, Rome, Italy); Cesta Amedeo; Orlandini Andrea; Umbrico Alessandro (ISTC-CNR, Rome, Italy) Abstract Timeline-based Planning and Scheduling (P&S) usually deals with two main sources of uncertainty: some components may depend on an external environment and…

Toward intelligent continuous assistance

Journal of Ambient Intelligence and Humanized Computing Umbrico Alessandro; Cortellessa Gabriella; Orlandini Andrea; Cesta Amedeo (CNR- ISTC) Abstract Technology supported assistance is a research area dedicated to support both older adults and, at some level, their caregivers in a variety of situations and contexts. A number of projects doing detailed evaluation both with robots and/or ICT-based intelligent devices…