Sciweavers

350 search results - page 34 / 70
» Complexity of Planning with Partial Observability
Sort
View
FCS
2007
15 years 1 months ago
Coordinating Planning Agents for Moderately and Tightly-Coupled Tasks
In many task-planning domains, dynamic assemblies of autonomous agents are replacing hierarchical organisations because they promise more agility. In such assemblies, interdepende...
J. Renze Steenhuisen, Cees Witteveen
NIPS
2004
15 years 1 months ago
VDCBPI: an Approximate Scalable Algorithm for Large POMDPs
Existing algorithms for discrete partially observable Markov decision processes can at best solve problems of a few thousand states due to two important sources of intractability:...
Pascal Poupart, Craig Boutilier
CANDT
2009
15 years 3 months ago
Supporting community engagement in the city: urban planning in the MR-tent
Urban design today faces complex demands. It has become a necessity to negotiate between stakeholder objectives, the expectations of citizens, and the demands of planning. In this...
Ina Wagner, Maria Basile, Lisa Ehrenstrasser, Val&...
TSMC
2010
14 years 6 months ago
Pervasive Diagnosis
In model-based control, a planner uses a system description to create a plan that achieves production goals. The same model can be used by model-based diagnosis to indirectly infe...
Lukas Kuhn, Bob Price, Minh Binh Do, Juan Liu, Ron...
IJRR
2007
171views more  IJRR 2007»
14 years 11 months ago
Creating High-quality Paths for Motion Planning
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, ...
Roland Geraerts, Mark H. Overmars