Sensor Deployment for Network-like Environments

This paper considers the problem of optimally deploying omnidirectional sensors, with potentially limited sensing radius, in a network-like environment. This model provides a compact and effective description of complex environments as well as a proper representation of road or river networks. We present a two-step procedure based on a discrete-time gradient ascent algorithm to find a local optimum for this problem. The first step performs a coarse optimization where sensors are allowed to move in the plane, to vary their sensing radius and to make use of a reduced model of the environment called collapsed network. It is made up of a finite discrete set of points, barycenters, produced by collapsing network edges. Sensors can be also clustered to reduce the complexity of this phase. The sensors' positions found in the first step are then projected on the network and used in the second finer optimization, where sensors are constrained to move only on the network. The second step can be performed on-line, in a distributed fashion, by sensors moving in the real environment, and can make use of the full network as well as of the collapsed one. The adoption of a less constrained initial optimization has the merit of reducing the negative impact of the presence of a large number of local optima. The effectiveness of the presented procedure is illustrated by a simulated deployment problem in an airport environment

Optimal Deployments of UAVs With Directional Antennas for a Power-Efficient Coverage

To provide a reliable wireless uplink for users in a given ground area, one can deploy Unmanned Aerial Vehicles (UAVs) as base stations (BSs). In another application, one can use UAVs to collect data from sensors on the ground. For a power-efficient and scalable deployment of such flying BSs, directional antennas can be utilized to efficiently cover arbitrary 2-D ground areas. We consider a large-scale wireless path-loss model with a realistic angle-dependent radiation pattern for the directional antennas. Based on such a model, we determine the optimal 3-D deployment of N UAVs to minimize the average transmit-power consumption of the users in a given target area. The users are assumed to have identical transmitters with ideal omnidirectional antennas and the UAVs have identical directional antennas with given half-power beamwidth (HPBW) and symmetric radiation pattern along the vertical axis. For uniformly distributed ground users, we show that the UAVs have to share a common flight height in an optimal power-efficient deployment. We also derive in closed-form the asymptotic optimal common flight height of $N$ UAVs in terms of the area size, data-rate, bandwidth, HPBW, and path-loss exponent

Assortment Planning and Inventory Decisions Under a Locational Choice Model

We consider a single-period assortment planning and inventory management problem for a retailer, using a locational choice model to represent consumer demand. We first determine the optimal variety, product location, and inventory decisions under static substitution, and show that the optimal assortment consists of products equally spaced out such that there is no substitution among them regardless of the distribution of consumer preferences. The optimal solution can be such that some customers prefer not to buy any product in the assortment, and such that the most popular product is not offered. We then obtain bounds on profit when customers dynamically substitute, using the static substitution for the lower bound, and a retailer-controlled substitution for the upper bound. We thus define two heuristics to solve the problem under dynamic substitution, and numerically evaluate their performance. This analysis shows the value of modeling dynamic substitution and identifies conditions in which the static substitution solution serves as a good approximation.Operations Management Working Papers Serie

A taxonomy for emergency service station location problem

The emergency service station (ESS) location problem has been widely studied in the literature since 1970s. There has been a growing interest in the subject especially after 1990s. Various models with different objective functions and constraints have been proposed in the academic literature and efficient solution techniques have been developed to provide good solutions in reasonable times. However, there is not any study that systematically classifies different problem types and methodologies to address them. This paper presents a taxonomic framework for the ESS location problem using an operations research perspective. In this framework, we basically consider the type of the emergency, the objective function, constraints, model assumptions, modeling, and solution techniques. We also analyze a variety of papers related to the literature in order to demonstrate the effectiveness of the taxonomy and to get insights for possible research directions

Locational optimization based sensor placement for monitoring Gaussian processes modeled spatial phenomena

This paper addresses the sensor placement problem associated with monitoring spatial phenomena, where mobile sensors are located on the optimal sampling paths yielding a lower prediction error. It is proposed that the spatial phenomenon to be monitored is modeled using a Gaussian Process and a variance based density function is employed to develop an expected-value function. A locational optimization based effective algorithm is employed to solve the resulting minimization of the expected-value function. We designed a mutual information based strategy to select the most informative subset of measurements effectively with low computational time. Our experimental results on real-world datasets have verified the superiority of the proposed approach. © 2013 IEEE