Cost-Sensitive Neighborhood Aggregation (CSNA) for Heterophilous Graphs — The code for our new arXiv paper, about per-edge routing in Graph Neural Networks (GNNs), is available here.
Multi-Agent Warehouse Rearrangement — The code for our SoCS 2025 paper, about optimal multi-agent warehouse rearrangement, is available here.
BLITstar — The code for the ICRA 2025 paper “Asymptotically Optimal Sampling-Based Motion Planning Through Anytime Incremental Lazy Bidirectional Heuristic Search”, about motion planning, is available here. It is also incorporated in OMPL.
MEET — The code for our IJCAI 2025 paper, about bidirectional search, is available here. It will also be incorporated in OMPL.
Numeric Fast Downward — Our paper on numeric PDBs is implemented in the numeric planner NFD.
PlanDEM — Papers from my PhD were mostly tested using PlanDEM, a domain-independent planner that provides implementation to algorithms that work with dynamically estimated action models. This is an open source project, that gets major updates typically after a new paper on the matter is published.
Wonderlattice — The code for wonderlattice.com, my educational project of hands-on interactive math experiments, is available here. It is a static site with no build step that runs in any browser, even offline. Contributions, including translations, are welcome.
Contact me for questions or requests.