Mobile sensor intrusion detection under any shape of curve

DOI10.1016/j.mcm.2012.01.005zbMath1286.94036OpenAlexW1978258788MaRDI QIDQ2450539

Xiannuan Liang, Yang Xiao

Publication date: 14 May 2014

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2012.01.005

zbMATH Keywords

intrusion detectionstochastic intrusion modelmultiple mobile sensors

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13) Artificial intelligence for robotics (68T40)

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Mobile sensor intrusion detection under any shape of curve