The conditional covering problem (CCP) aims to locate facilities on a graph, where the vertex set represents both the demand points and the potential facility locations. The proble...
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...
Noga Alon, Michal Feldman, Ariel D. Procaccia, Mos...
-- The Multi-Story Space Assignment Problem (MSAP) is an innovative formulation of the multi-story facility assignment problem that allows one to model the location of departments ...
— We present a method for controlling the forward speed and the apex height of a one-legged hopping robot over rough terrain, using a single actuator located at the robot hip. Th...
Work in simultaneous localisation and map-building ("SLAM") for mobile robots has focused on the simplified case in which a robot is considered to move in two dimensions...