Talks and Poster Presentations (without Proceedings-Entry):
"Containing a Moving Object in a Network";
Talk: Representation, Analysis and Visualization of Moving Objects,
A problem of relocating a group of mobile points (or pursuers) to contain another mobile point (or evader) in a network is considered. It is assumed that it is known where the evader is located at the outset and where it can be at any time later, but not where it will be. An example is initial deployment of police officers in response to a 911 call. There often exists no such strategy that guarantees to contain (and then catch) the evader, because the pursuers are not many enough. Thus this paper presents a heuristic approach, which is based on a simple integer programming model, that seeks a possible relocation of the pursuers by a specified time that minimizes "the degree of containment," i.e. the number of nodes the evader can reach earlier than any pursuer.
Created from the Publication Database of the Vienna University of Technology.