696 search results - page 100 / 140 » Planning for Network-Aware Paths |
WEA
2010
Springer
14 years 4 months ago
2010
Springer
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
ICTAI
2002
IEEE
14 years 4 months ago
2002
IEEE
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
CAD
2006
Springer
13 years 11 months ago
2006
Springer
Modeling, design and fabrication of tissue scaffolds with intricate architecture, porosity and pore size for desired tissue properties presents a challenge in tissue engineering. ...
IJRR
2002
13 years 10 months ago
2002
The goal of coverage path planning is to determine a path that passes a detector over all points in an environment. This work prescribes a provably complete coverage path planner ...
TSMC
1998
13 years 10 months ago
1998
—An algorithmic solution method is presented for the problem of autonomous robot motion in completely unknown environments. Our approach is based on the alternate execution of tw...