16404 search results - page 861 / 3281 » A set coverage problem |
184
click to vote
ALGORITHMICA
2002
15 years 7 months ago
2002
We study exploration problems where a robot has to construct a complete map of an unknown environment using a path that is as short as possible. In the rst problem setting we cons...
252
click to vote
CORR
2002
Springer
15 years 7 months ago
2002
Springer
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism de...
217
click to vote
CORR
2002
Springer
15 years 7 months ago
2002
Springer
Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabi...
217
click to vote
AUTOMATICA
1999
15 years 7 months ago
1999
We formulate the L2-gain control problem for a general nonlinear, state-space system with projection dynamics in the state evolution and hard constraints on the set of admissible ...
212
click to vote
NETWORKS
2010
15 years 6 months ago
2010
Let G = (V, E, Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . ...