Sciweavers

2030 search results - page 197 / 406
» Extremal Problems of Information Combining
Sort
View
ICRA
2002
IEEE
92views Robotics» more  ICRA 2002»
15 years 11 months ago
Resolution Complete Rapidly-Exploring Random Trees
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...
Peng Cheng, Steven M. LaValle
NGC
2006
Springer
135views Communications» more  NGC 2006»
15 years 6 months ago
Seeing Things: Inventive Reasoning with Geometric Analogies and Topographic Maps
This paper examines two seemingly unrelated qualitative spatial reasoning domains; geometric proportional analogies and topographic (landcover) maps. We present a Structure Matchin...
Diarmuid P. O'Donoghue, Amy J. Bohan, Mark T. Kean...
RAS
2006
134views more  RAS 2006»
15 years 6 months ago
Simultaneous planning, localization, and mapping in a camera sensor network
In this paper we examine issues of localization, exploration, and planning in the context of a hybrid robot/camera-network system. We exploit the ubiquity of camera networks to us...
Ioannis M. Rekleitis, David Meger, Gregory Dudek
CCE
2004
15 years 6 months ago
Dynamic programming in a heuristically confined state space: a stochastic resource-constrained project scheduling application
The Resource-Constrained Project Scheduling Problem(RCPSP) is a significant challenge in highly regulated industries, such as pharmaceuticals and agrochemicals, where a large numb...
Jaein Choi, Matthew J. Realff, Jay H. Lee
CONSTRAINTS
2011
15 years 1 months ago
Dantzig-Wolfe decomposition and branch-and-price solving in G12
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...
Jakob Puchinger, Peter J. Stuckey, Mark G. Wallace...