Sciweavers

408 search results - page 27 / 82
» A lookahead strategy for solving large planning problems
Sort
View
ICTAI
2000
IEEE
15 years 1 months ago
Building efficient partial plans using Markov decision processes
Markov Decision Processes (MDP) have been widely used as a framework for planning under uncertainty. They allow to compute optimal sequences of actions in order to achieve a given...
Pierre Laroche
CVPR
2009
IEEE
16 years 4 months ago
Efficient Reduction of L-infinity Geometry Problems
This paper presents a new method for computing optimal L1 solutions for vision geometry problems, particularly for those problems of fixed-dimension and of large-scale. Our strat...
Hongdong Li (Australian National University)
CCE
2005
14 years 9 months ago
Process industry supply chains: Advances and challenges
A large body of work exists in process industry supply chain optimisation. We describe the state of the art of research in infrastructure design, modelling and analysis and planni...
Nilay Shah
ICRA
2008
IEEE
265views Robotics» more  ICRA 2008»
15 years 4 months ago
Trajectory generation for dynamic bipedal walking through qualitative model based manifold learning
— Legged robots represent great promise for transport in unstructured environments. However, it has been difficult to devise motion planning strategies that achieve a combinatio...
Subramanian Ramamoorthy, Benjamin Kuipers
ISCAPDCS
2003
14 years 11 months ago
On the Scalable Computation of Large Sets of Integrals
We consider efficient strategies for the parallel and distributed computation of large sets of multivariate integrals. These arise in many applications such as computational chem...
Elise de Doncker, Ajay K. Gupta, Laurentiu Cucos