Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sandra Castellanos-Paez

dblp:188/5875 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
4since 2021 · last 2025
0000-0002-6241-7974ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 3 first-author · 4 since 2021Human-computer interaction and ubiquitous computing · 2 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
plan robustness
0.912025
An Approach to Quantify Plans Robustness in Real-world Applications · IJCAI 2025

Methods — techniques the papers use, named apart from their topics

statistical framework · 0.9
YearPublicationVenuePosition
2025 An Approach to Quantify Plans Robustness in Real-world Applications
abstract
Automated planning systems are increasingly deployed in real-world applications, often characterised by uncertainty and noise stemming from sensors, actuators, and environmental conditions. Under such circumstances, improving the deployability of generated plans requires assessing their robustness to varying conditions, thereby reducing the need for costly replanning. Replanning can be computationally intensive and may hinder the practical applicability of planning systems. In many domains, such as urban traffic control or underwater exploration, it is often sufficient for plans to reach an acceptable region rather than the exact goal. A key distinction in this context lies between valid plans (which achieve the intended goal under ideal conditions) and executable plans (which remain feasible under uncertainty or perturbation). This paper formalises the notion of execution-invariant planning tasks, in which plans are robust to noise and uncertainty. To foster the adoption of automated planning in real-world settings, we propose a statistical framework for evaluating plan robustness, offering a quantifiable measure of a plan’s ability to reach a goal within a specified tolerance under diverse perturbations or uncertainty. We validate our approach in two real-world domains, demonstrating its effectiveness.
Francesco Percassi, Sandra Castellanos-Paez, Romain Rombourg, Mauro Vallati
IJCAI2
2025 TaskVAE: Task-Specific Variational Autoencoders for Exemplar Generation in Continual Learning for Human Activity Recognition
Bonpagna Kann, Sandra Castellanos-Paez, Romain Rombourg, Philippe Lalanda
PKAW2
2025 Exploring the Trade-off Between Flexible and Deployable Models for PDDL+ Urban Traffic Control (Extended Abstract)
abstract
The problem of traffic signal optimisation has been successfully tackled using the PDDL+ planning formalism, which also provides an ideal ground for simulating traffic behaviour and performing what-if analysis to assess and compare alternative scenarios. This line of research leads to approaches that can efficiently generate high-quality signal plans with significant benefits in terms of congestion and emissions reduction, as demonstrated both in simulations and real-world deployments. Existing models for automated planning-based traffic signal control can be roughly divided into two classes. (i) Models maximising the flexibility of the traffic controller, where the planning system can dynamically adjust the duration of traffic stages without constraints on the overall cycles and on the differences between subsequent cycles. (ii) Models that guarantee the deployability of traffic signal control techniques also on legacy infrastructure, by forcing the AI approach to select the cycle configurations of traffic signals for the controlled junctions from a given pre-defined set. Of course, both classes offer valuable properties and benefits: the extreme flexibility helps shed light on the potential gains achievable through investment in brand-new infrastructure, whereas the deployable approaches ensure the immediate usability of tools to maximise short-term impact. To bridge the gap between different model classes and explore the trade-off between flexibility and deployability, we present the Trade model. It enables the enforcement of key constraints required for deployability while preserving a level of flexibility that surpasses the capabilities of traditional traffic control infrastructure.
Sandra Castellanos-Paez, Francesco Percassi, Mauro Vallati
SOCS1
2021 On the Relevance of Extracting Macro-operators with Non-adjacent Actions: Does It Matter?
Sandra Castellanos-Paez, Romain Rombourg, Philippe Lalanda
ICAART (2)1
2020 ERA: Extracting Planning Macro-Operators from Adjacent and Non-adjacent Sequences
Sandra Castellanos-Paez, Romain Rombourg, Philippe Lalanda
PKAW1