research
∙
06/09/2023
A Domain-Independent Agent Architecture for Adaptive Operation in Evolving Open Worlds
Model-based reasoning agents are ill-equipped to act in novel situations...
share
research
∙
03/29/2023
Heuristic Search For Physics-Based Problems: Angry Birds in PDDL+
This paper studies how a domain-independent planner and combinatorial se...
research
∙
03/24/2023
Learning to Operate in Open Worlds by Adapting Planning Models
Planning agents are ill-equipped to act in novel situations in which the...
research
∙
03/23/2022
An Example of the SAM+ Algorithm for Learning Action Models for Stochastic Worlds
In this technical report, we provide a complete example of running the S...
research
∙
07/09/2021
Playing Angry Birds with a Domain-Independent PDDL+ Planner
This demo paper presents the first system for playing the popular Angry ...
research
∙
07/09/2021
Safe Learning of Lifted Action Models
Creating a domain model, even for classical, domain-independent planning...
research
∙
02/14/2021
Partial Disclosure of Private Dependencies in Privacy Preserving Planning
In collaborative privacy preserving planning (CPPP), a group of agents j...
research
∙
01/24/2021
Improving Continuous-time Conflict Based Search
Conflict-Based Search (CBS) is a powerful algorithmic framework for opti...
research
∙
01/11/2021
Anomaly Detection for Aggregated Data Using Multi-Graph Autoencoder
In data systems, activities or events are continuously collected in the ...
research
∙
06/01/2020
Revisiting Bounded-Suboptimal Safe Interval Path Planning
Safe-interval path planning (SIPP) is a powerful algorithm for finding a...
research
∙
12/24/2019
Bidding in Spades
We present a Spades bidding algorithm that is superior to recreational h...
research
∙
09/04/2019
Learning Test Traces
Modern software projects include automated tests written to check the pr...
research
∙
09/04/2019
Predicting Software Tests Traces
Modern software projects include automated tests written to check the pr...
research
∙
06/19/2019
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
The MAPF problem is the fundamental problem of planning paths for multip...
research
∙
01/16/2019
Multi-Agent Pathfinding (MAPF) with Continuous Time
MAPF is the problem of finding paths for multiple agents such that every...
research
∙
07/02/2017
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants
In multi-agent path finding (MAPF) the task is to find non-conflicting p...
research
∙
05/24/2017
