SSSebastian Sardina

Sebastian Sardina

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Sebastian Sardina has a total of 69 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Machine Learning Architectures for the Estimation of Predicted Occupancy Grids in Road Traffic

    by Parthasarathy Nadarajan, Michael Botsch, Sebastian Sardina

    This paper introduces a novel machine learning architecture for an efficient estimation of the probabilistic space-time representation of complex traffic scenarios. A detailed representation of the future traffic scenario is of significant importance for autonomous driving and for all active safety systems. In order to predict the future space-time representation of the traffic scenario, first the type of traffic scenario is identified and then the machine learning algorithm maps the current state of the scenario to possible future states. The input to the machine learning algorithms is the current state representation of a traffic scenario, termed as the Augmented Occupancy Grid (AOG). The output is the probabilistic space-time representation which includes uncertainties regarding the behaviour of the traffic participants and is termed as the Predicted Occupancy Grid (POG). The novel architecture consists of two Stacked Denoising Autoencoders (SDAs) and a set of Random Forests. It is then compared with the other two existing architectures that comprise of SDAs and DeconvNet. The architectures are validated with the help of simulations and the comparisons are made both in terms of accuracy and computational time. Also, a brief overview on the applications of POGs in the field of active safety is presented.

  • Open Access

    On the Computational Complexity of Partial Satisfaction Planning

    by Jiajia Song, Seeun William Umboh, Nir Lipovetzky, Sebastian Sardina

    We analyse the computational complexity of two types of partial satisfaction planning problems, namely, over-subscription planning and net-benefit planning. Partial satisfaction planning seeks to maximise the rewards, or net-benefit between the rewards and costs, that can be obtained by achieving a set of (candidate) goals, generally under a cost budget. In this paper, we assume that the cost budget is polynomially bounded with respect to the number of atoms. In contrast to previous works on complexity analysis, we view partial satisfaction planning as optimisation tasks instead of decision ones. Accordingly, we classify over-subscription and net-benefit planning problems in classes within the optimisation complexity framework. Let L be the size of the partial satisfaction planning instance, we first show that both optimisation problems are OptP[LO(1)]-complete. We then prove that while over-subscription planning becomes OptP[O(log L)]-complete under uniform goal rewards and uniform action costs, the complexity of net-benefit planning remains unchanged. Our results show that the relative values of rewards and costs may impact the computational complexity of partial satisfaction planning, and that an optimisation perspective can reveal differences that may otherwise be lost in their decision formulations. In addition, an optimisation complexity analysis can provide insights on approximation properties of these problems.

  • Open Access

    Agent Planning Programs as Non-deterministic Planning under Fairness

    by Nitin Yadav, Sebastian Sardiña, Hector Geffner

    We propose an approach for solving Agent Planning Programs (APP) based on a reduction to (strong-cyclic) Fully Observable Non-Deterministic (FOND) planning. APPs represent a middle-ground between automated planning and agent-oriented programming, in which the space of possible agent behavior is "programmed" as a network of declarative goals wrt an underlying planning domain. Each transition in an APP represents a local planning problem that may need to be addressed by the agent executing the APP. APPs allow the specification of continuous goal-driven behavior in which the "next" goal is externally chosen, thus going beyond one-shot planning. Two methods have been proposed for solving APPs: a principled but inefficient LTL reactive synthesis technique; and a more efficient but arguably ad-hoc approach that relies on multiple "local" classical planning and meta-level backtracking. We demonstrate how APPs can be solved in a principled manner by developing an elegant reduction to non-deterministic planning under fairness assumptions, and show experimentally with existing FOND solvers its practical value. We also provide a new solution concept that is simpler and closer to mainstream planning than the existing one.

  • Open Access

    Process mining over sensor data: Goal recognition for powered transhumeral prostheses

    by Zihang Su, Tianshi Yu, Artem Polyvyanyy, Ying Tan, Nir Lipovetzky, Sebastian Sardiña, Nick van Beest, Alireza Mohammadi, Denny Oetomo


  • Open Access

    Adaptive goal recognition using process mining techniques

    by Zihang Su, Artem Polyvyanyy, Nir Lipovetzky, Sebastian Sardiña, Nick van Beest


  • Open Access

    A Declarative Approach to Compact Controllers for FOND Planning via Answer Set Programming

    by Nitin Yadav, Sebastian Sardina

    We present an approach to non-deterministic planning under full observability via Answer Set Programming. The technique can synthesise compact policies, handle both fair and unfair actions simultaneously, and readily accommodate control knowledge and procedural domain constraints. We show that whereas compact controllers may yield sub-optimal behavior under a naive executor, optimality can be recovered under a smarter executor. The developed planner is succinct, elegant, and directly implementable, thus providing higher confidence of its correctness and ease of elaboration. Experimental results show that its performance is competitive.


  • Open Access

    Data-Driven Goal Recognition in Transhumeral Prostheses Using Process Mining Techniques

    by Zihang Su, Tianshi Yu, Nir Lipovetzky, Alireza Mohammadi, Denny Oetomo, Artem Polyvyanyy, Sebastian Sardina, Ying Tan, Nick van Beest

    A transhumeral prosthesis restores missing anatomical segments below the shoulder, including the hand. Active prostheses utilize real-valued, continuous sensor data to recognize patient target poses, or goals, and proactively move the artificial limb. Previous studies have examined how well the data collected in stationary poses, without considering the time steps, can help discriminate the goals. In this case study paper, we focus on using time series data from surface electromyography electrodes and kinematic sensors to sequentially recognize patients' goals. Our approach involves transforming the data into discrete events and training an existing process mining-based goal recognition system. Results from data collected in a virtual reality setting with ten subjects demonstrate the effectiveness of our proposed goal recognition approach, which achieves significantly better precision and recall than the state-of-the-art machine learning techniques and is less confident when wrong, which is beneficial when approximating smoother movements of prostheses.

  • Open Access

    Situation Calculus for Controller Synthesis in Manufacturing Systems with First-Order State Representation (Extended Abstract)

    by Giuseppe De Giacomo, Paolo Felli, Brian Logan, Fabio Patrizi, Sebastian Sardiña

    Manufacturing is transitioning from a mass production model to a service model in which facilities `bid' for previously unseen products. To decide whether to bid for a previously unseen product, a facility must be able to synthesize, on the fly, a process plan controller that delegates abstract manufacturing tasks in a supplied process recipe to the available manufacturing resources. First-order representations of the state are commonly considered in reasoning about action in AI. Here we show that we can leverage the wide literature on the Situation Calculus automatically synthesize such controllers. We identify two important decidable cases---finite domains and bounded action theories---for which we provide practical synthesis techniques.