© Copyright 2017, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved. This work deals with the problem of navigation while avoiding detection by a mobile adversary, which is a novel variant of pursuit-evasion featuring adversarial modeling. In this problem, an evading agent is placed on a graph, where one or more nodes are defined as safehouses. The agent's goal is to find a path from its current location to a safe-house, while minimizing the probability of meeting a mobile adversarial agent at a node along its path (i.e., being captured). We examine several models of this problem, where each one has different assumptions on what the agents know about their opponent, all using a framework for computing node utility, introduced herein. We use several risk attitudes for computing the utility values, whose impact on the constructed strategies is analyzed both theoretically and empirically. Furthermore, we allow the agents to use information gained along their movement, in order to efficiently update their motion strategies on-the-fly. Analytic and empirical analysis show the importance of using this information and these on-the-fly strategy updates.
|Number of pages||4|
|Journal||Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS|
|State||Published - 8 May 2017|