4894 search results - page 146 / 979 » Dynamic Abstraction Planning |
129
click to vote
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract— We present an efficient algorithm for complete motion planning that combines approximate cell decomposition (ACD) with probabilistic roadmaps (PRM). Our approach uses ...
136
click to vote
AGTIVE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. With graph pattern matching the field of graph transformation (GT) includes an NP-complete subtask. But for real-life applications it is essential that graph pattern mat...
127
Voted
SEMWEB
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Hierarchical Task-Network (HTN) based planning techniques have been applied to the problem of composing Web Services, especially when described using the OWL-S service on...
162
Voted
DALT
2006
Springer
15 years 7 months ago
2006
Springer
AgentSpeak is a well-known language for programming intelligent agents which captures the key features of reactive planning systems in a simple framework with an elegant formal sem...
149
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— Computing a motion that enables a mobile manipulator to open a door is challenging because it requires tight coordination between the motions of the arm and the base. H...