2178 search results - page 129 / 436 » Inferring complex plans |
137
Voted
AI
2007
Springer
15 years 10 months ago
2007
Springer
DEC-POMDPs provide formal models of many cooperative multiagent problems, but their complexity is NEXP-complete in general. We investigate a sub-class of DEC-POMDPs termed multiage...
94
Voted
ICRA
2006
IEEE
15 years 9 months ago
2006
IEEE
— We describe a novel shape formation algorithm for ensembles of 2-dimensional lattice-arrayed modular robots, based on the manipulation of regularly shaped voids within the latt...
120
Voted
ICRA
2005
IEEE
15 years 9 months ago
2005
IEEE
Abstract— High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion p...
110
Voted
ICRA
2000
IEEE
15 years 8 months ago
2000
IEEE
The formulation and optimization of joint trajectories for humanoid robots is quite different from this same task for standard robots because of the complexity of the humanoid rob...
133
Voted
FLAIRS
2007
15 years 6 months ago
2007
POMDPs are a popular framework for representing decision making problems that contain uncertainty. The high computational complexity of finding exact solutions to POMDPs has spaw...