Model checking knowledge in pursuit evasion games

Authors:
Xiaowei Huang;Patrick Maupin;Ron Van Der Meyden
Affiliations:
Computer Science and Engineering, University of New South Wales, Australia;Defence R&D Canada, Quebec;Computer Science and Engineering, University of New South Wales, Australia
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Year:
2011

Citing 13
Cited 2

The complexity of searching a graph

Journal of the ACM (JACM)
The complexity of pursuit on a graph

Theoretical Computer Science
Reasoning about knowledge

Reasoning about knowledge
The Rendezvous Search Problem

SIAM Journal on Control and Optimization
Applications of a logic of knowledge to motion planning under uncertainty

Journal of the ACM (JACM)
The Symmetric Rendezvous-Evasion Game

SIAM Journal on Control and Optimization
Model checking

Model checking
Rendezvous Search: A Personal Perspective

Operations Research
Randomized Pursuit-Evasion in Graphs

Combinatorics, Probability and Computing
Algorithms for distributed and mobile sensing

Algorithms for distributed and mobile sensing
In pursuit of a hidden evader

In pursuit of a hidden evader
Model Checking Temporal Logics of Knowledge Via OBDDs1

The Computer Journal
MCMAS: A Model Checker for the Verification of Multi-Agent Systems

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification

A logic of probabilistic knowledge and strategy

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Bounded planning for strategic goals with incomplete information and perfect recall

Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a pursuit-evasion game, one or more pursuers aim to discover the existence of, and then capture, an evader. The paper studies pursuit-evasion games in which players may have incomplete information concerning the game state. A methodology is presented for the application of a model checker for the logic of knowledge and time to verify epistemic properties in such games. Experimental results are provided from a number of case studies that validate the feasibility of the approach.