Sciweavers

1815 search results - page 64 / 363
» Path Planning for Network Performance
Sort
View
IROS
2009
IEEE
128views Robotics» more  IROS 2009»
15 years 4 months ago
Predictive constrained gain scheduling for UGV path tracking in a networked control system
– This paper presents a predictive gain scheduler for path tracking control in a networked control system with variable delay. The controller uses the plant model to predict futu...
Bryan R. Klingenberg, Unnati Ojha, Mo-Yuen Chow
DCOSS
2007
Springer
15 years 1 months ago
Efficient Computation of Minimum Exposure Paths in a Sensor Network Field
The exposure of a path p is a measure of the likelihood that an object traveling along p is detected by a network of sensors and it is formally defined as an integral over all poin...
Hristo Djidjev
FLAIRS
2007
15 years 4 days ago
Temporal Networks with Alternatives: Complexity and Model
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose ...
Roman Barták, Ondrej Cepek
BROADNETS
2006
IEEE
15 years 3 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
ICDE
2006
IEEE
137views Database» more  ICDE 2006»
15 years 11 months ago
Finding Fastest Paths on A Road Network with Speed Patterns
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, a source node s and an end node e, allFP ...
Evangelos Kanoulas, Yang Du, Tian Xia, Donghui Zha...