Studying the stochastic capturing of moving intruders by mobile sensors

DOI10.1016/j.camwa.2012.05.016zbMath1268.94014OpenAlexW1963807950MaRDI QIDQ356177

Yang Xiao, Xiannuan Liang

Publication date: 25 July 2013

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2012.05.016

zbMATH Keywords

surveillanceintrusion detectionmobile sensorsstochastic intrusion model

Mathematics Subject Classification ID

Application models in control theory (93C95) Detection theory in information and communication theory (94A13)

Cites Work

• Unnamed Item
• Unnamed Item
• Bushiness and a tight worst-case upper bound on the search number of a simple polygon.
• Searching for a Mobile Intruder in a Polygonal Region
• SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
• Efficient Routing Algorithms for Multiple Vehicles With no Explicit Communications
• A Geometric Optimization Approach to Detecting and Intercepting Dynamic Targets Using a Mobile Sensor Network
• Searching for mobile intruders in a polygonal region by a group of mobile searchers
• Editorial

This page was built for publication: Studying the stochastic capturing of moving intruders by mobile sensors