activity
20122022
most citedDynamic Stochastic Orienteering Problems for Risk-Aware Applications

18 citations · 41 across the 7 of their papers we have counts for

collaborators
Showing cs.AIShow all

5 papers · 1 filter

cs.AI20203 cited

On the Relationship Between KR Approaches for Explainable Planning

Stylianos Loukas Vasileiou, William Yeoh, Tran Cao Son

In this paper, we build upon notions from knowledge representation and reasoning (KR) to expand a preliminary logic-based framework that characterizes the model reconciliation prob…

cs.AI201917 cited

Automatic Algorithm Selection In Multi-agent Pathfinding

Devon Sigurdson, Vadim Bulitko, Sven Koenig +2

In a multi-agent pathfinding (MAPF) problem, agents need to navigate from their start to their goal locations without colliding into each other. There are various MAPF algorithms,…

cs.AI2017

Solving DCOPs with Distributed Large Neighborhood Search

Ferdinando Fioretto, Agostino Dovier, Enrico Pontelli +2

The field of Distributed Constraint Optimization has gained momentum in recent years, thanks to its ability to address various applications related to multi-agent cooperation. Neve…

cs.AI2017

A Realistic Dataset for the Smart Home Device Scheduling Problem for DCOPs

William Kluegel, Muhammad Aamir Iqbal, Ferdinando Fioretto +2

The field of Distributed Constraint Optimization has gained momentum in recent years thanks to its ability to address various applications related to multi-agent cooperation. While…

cs.AI201218 cited

Dynamic Stochastic Orienteering Problems for Risk-Aware Applications

Hoong Chuin Lau, William Yeoh, Pradeep Varakantham +2

Orienteering problems (OPs) are a variant of the well-known prize-collecting traveling salesman problem, where the salesman needs to choose a subset of cities to visit within a giv…