Sciweavers

173 search results - page 10 / 35
» Search Complexities for HTN Planning
Sort
View
JAIR
2000
96views more  JAIR 2000»
13 years 7 months ago
OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains
Recently model checking representation and search techniques were shown to be efciently applicable to planning, in particular to non-deterministic planning. Such planning approach...
Rune M. Jensen, Manuela M. Veloso
IROS
2007
IEEE
158views Robotics» more  IROS 2007»
14 years 1 months ago
Factor-guided motion planning for a robot arm
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
Jaesik Choi, Eyal Amir
AIPS
2009
13 years 8 months ago
Extending the Use of Inference in Temporal Planning as Forwards Search
PDDL2.1 supports modelling of complex temporal planning domains in which solutions must exploit concurrency. Few existing temporal planners can solve problems that require concurr...
Amanda Jane Coles, Andrew Coles, Maria Fox, Derek ...
AAAI
2010
13 years 9 months ago
Search-Based Path Planning with Homotopy Class Constraints
Goal-directed path planning is one of the basic and widely studied problems in the field of mobile robotics. Homotopy classes of trajectories, arising due to the presence of obsta...
Subhrajit Bhattacharya
ICRA
2008
IEEE
157views Robotics» more  ICRA 2008»
14 years 1 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