Sciweavers

1984 search results - page 229 / 397
» The colourful feasibility problem
Sort
View
RAS
1998
145views more  RAS 1998»
15 years 6 months ago
Coordinated path planning for multiple robots
We present a new approach to the multi-robot path planning problem, where a number of robots are to change their positions through feasible motions in the same static environment....
Petr Svestka, Mark H. Overmars
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
15 years 5 months ago
Learning and planning high-dimensional physical trajectories via structured Lagrangians
— We consider the problem of finding sufficiently simple models of high-dimensional physical systems that are consistent with observed trajectories, and using these models to s...
Paul Vernaza, Daniel D. Lee, Seung-Joon Yi
PC
2010
145views Management» more  PC 2010»
15 years 4 months ago
GPU computing with Kaczmarz's and other iterative algorithms for linear systems
The graphics processing unit (GPU) is used to solve large linear systems derived from partial differential equations. The differential equations studied are strongly convection-...
Joseph M. Elble, Nikolaos V. Sahinidis, Panagiotis...
EOR
2011
85views more  EOR 2011»
15 years 1 months ago
Optimizing departure times in vehicle routes
Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporal traffic co...
A. L. Kok, E. W. Hans, J. M. J. Schutten
OL
2011
332views Neural Networks» more  OL 2011»
15 years 1 months ago
A robust implementation of a sequential quadratic programming algorithm with successive error restoration
We consider sequential quadratic programming (SQP) methods for solving constrained nonlinear programming problems. It is generally believed that SQP methods are sensitive to the a...
Klaus Schittkowski