63 search results - page 2 / 13 » Anytime, Dynamic Planning in High-dimensional Search Spaces |
IROS
2006
IEEE
13 years 11 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
ICRA
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— Probabilistic roadmaps (PRM) have been demonstrated to be very promising for planning paths for robots with high degrees of freedom in complex 3D workspaces. In this pa...
IJHR
2008
13 years 5 months ago
2008
Motion planning for humanoids faces several challenging issues: high dimensionality of the configuration space, necessity to address balance constraints in single and double suppo...
NIPS
1993
13 years 6 months ago
1993
Parti-game is a new algorithm for learning feasible trajectories to goal regions in high dimensionalcontinuousstate-spaces. In high dimensions it is essential that learningdoes not...
AIPS
2008
13 years 7 months ago
2008
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...