20 search results - page 2 / 4 » Abstraction and Constraint Satisfaction Techniques for Plann... |
HYBRID
1997
Springer
13 years 8 months ago
1997
Springer
Abstract. We can achieve guaranteed constraint satisfaction of a hybrid dynamical system (which takes into account the underlying continuous dynamics) in a simple, hierarchical con...
AUSAI
2008
Springer
13 years 7 months ago
2008
Springer
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 ...
IAT
2003
IEEE
13 years 10 months ago
2003
IEEE
With the increasing use of the internet, many problemsolving tasks such as resource allocation, scheduling, planning, and configuration pose themselves in an open setting involvi...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
IROS
2009
IEEE
13 years 12 months ago
2009
IEEE
Abstract— We consider the problem of planning collisionfree motions for general (i.e., possibly nonholonomic) redundant robots subject to task space constraints. Previous approac...