The Monk Problem : Verifier, heuristics and graph decompositions for a pursuit-evasion problem with a node-located evader
This paper concerns a specific pursuit-evasion problem with a node-located evader which we call the monk problem. First, we propose a way of verifying a strategy using a new kind of recursive systems, called EL-systems. We show how an EL-system representing a graph-instance of the problem can be rep...
| Main Authors: | , |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Skolan för datavetenskap och kommunikation (CSC)
2015
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166442 |