This paper studies a multi-robot visibility-based pursuit-evasion problem in which a group of
pursuer robots are tasked with detecting an evader within a two dimensional polygonal …

View Video Presentation: https://doi. org/10.2514/6.2021-1862. vid We present a method for
pursuit/evasion from the Artificial Intelligence community that is highly efficient and and …

A (finite or infinite) graph is called constructible if it may be obtained recursively from the one-
point graph by repeatedly adding dominated vertices. In the finite case, the constructible …

We study the Localization game on locally finite graphs and trees, where each vertex has
finite degree. As in finite graphs, we prove that any locally finite graph contains a subdivision …

We prove that the cop number of every generalized Petersen graph is at most 4. The
strategy is to play a modified game of cops and robbers on an infinite cyclic covering space …

Abstract Markov Decision Processes (MDPs) are a powerful technique for modelling
sequential decision making problems which have been used over many decades to solve …

We study the Localization game on locally finite graphs trees, where each of the countably
many vertices have finite degree. In contrast to the finite case, we construct a locally finite …

Graph burning is a discrete-time process that models the spread of influence in a network.
Vertices are either burning or unburned, and in each round, a burning vertex causes all of its …

Poset saturation and other combinatorial results Repository logo Repository logo English Català
Čeština Deutsch Español Français Gàidhlig Latviešu Magyar Nederlands Polski Português …

In the vertex pursuit game of cops and robbers on finite graphs, the cop has a winning
strategy if and only if the graph admits a dominating order. Such graphs are called …