Sciweavers

810 search results - page 62 / 162
» Solving Time-Dependent Planning Problems
Sort
View
EUROCAST
1994
Springer
139views Hardware» more  EUROCAST 1994»
14 years 6 days ago
Illustrating Constraint Programming Systems in Logistic Planning
Logistic systems analysts use a wide array of modeling systems such as algebraic and logic programs. Two simple examples show how they mesh as Constraint Logic programs, emphasizin...
Jean-Michel Thizy
KI
2008
Springer
13 years 8 months ago
Partial Symbolic Pattern Databases for Optimal Sequential Planning
Abstract. This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributimpact of operators that t...
Stefan Edelkamp, Peter Kissmann
ICRA
2008
IEEE
157views Robotics» more  ICRA 2008»
14 years 2 months ago
Impact of workspace decompositions on discrete search leading continuous exploration (DSLX) motion planning
Abstract— We have recently proposed DSLX, a motion planner that significantly reduces the computational time for solving challenging kinodynamic problems by interleaving continu...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
AIPS
2009
13 years 9 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden
IROS
2009
IEEE
224views Robotics» more  IROS 2009»
14 years 2 months ago
Humanoid motion planning for dual-arm manipulation and re-grasping tasks
— In this paper, we present efficient solutions for planning motions of dual-arm manipulation and re-grasping tasks. Motion planning for such tasks on humanoid robots with a hig...
Niko Vahrenkamp, Dmitry Berenson, Tamim Asfour, Ja...