Abstract. For a fixed integer k 0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k "walls",...
We study the presence of obstacles in computing BCP(s, t) (Best Coverage Path between two points s and t) in a 2D field under surveillance by sensors. Consider a set of m line seg...
Abstract-- We present a new, biologically-inspired algorithm for the problem of covering a given region with wireless "units" (sensors or base-stations). The general prob...
— In this paper, we propose a path planning method for nonholonomic multi-vehicle system in presence of moving obstacles. The objective is to find multiple fixed length paths f...
Ali Ahmadzadeh, Nader Motee, Ali Jadbabaie, George...
Surveillance wireless sensor networks are deployed at perimeter or border locations to detect unauthorized intrusions. For deterministic deployment of sensors, the quality of depl...