Sciweavers

866 search results - page 101 / 174
» On Dynamic Shortest Paths Problems
Sort
View
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 11 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
13 years 10 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
ICRA
2006
IEEE
190views Robotics» more  ICRA 2006»
14 years 4 months ago
An Integrated Approach to Inverse Kinematics and Path Planning for Redundant Manipulators
— We propose a novel solution to the problem of inverse kinematics for redundant robotic manipulators for the purposes of goal selection for path planning. We unify the calculati...
Dominik Bertram, James Kuffner, Rüdiger Dillm...
JMLR
2010
148views more  JMLR 2010»
13 years 4 months ago
A Generalized Path Integral Control Approach to Reinforcement Learning
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
CORR
2011
Springer
219views Education» more  CORR 2011»
13 years 5 months ago
Active Markov Information-Theoretic Path Planning for Robotic Environmental Sensing
Recent research in multi-robot exploration and mapping has focused on sampling environmental fields, which are typically modeled using the Gaussian process (GP). Existing informa...
Kian Hsiang Low, John M. Dolan, Pradeep K. Khosla