Sciweavers

89 search results - page 7 / 18
» Action-Space Partitioning for Planning
Sort
View
UAI
2004
15 years 5 months ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...
AAAI
2007
15 years 6 months ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre
AUSAI
2008
Springer
15 years 6 months ago
Constraint-Based Multi-agent Path Planning
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
Malcolm Ryan
ICRA
2007
IEEE
132views Robotics» more  ICRA 2007»
15 years 10 months ago
Smooth Feedback for Car-Like Vehicles in Polygonal Environments
— We introduce a method for constructing provably safe smooth feedback laws for car-like robots in obstaclecluttered polygonal environments. The robot is taken to be a point with...
Stephen R. Lindemann, Steven M. LaValle
IEEECIT
2006
IEEE
15 years 10 months ago
The Partitioning Methodology in Hardware/Software Co-Design Using Extreme Programming: Evaluation through the Lego Robot Project
This paper argues about the partitioning in hardware/software co-design and suggests the methodology applying extreme programming to complement the co-design. This approach, contr...
Heeseo Chae, Dong-hyun Lee, Jiyong Park, Hoh Peter...