914 search results - page 32 / 183 » The Computational Complexity of Probabilistic Planning |
CCGRID
2003
IEEE
14 years 3 months ago
2003
IEEE
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
CSR
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
ICRA
2005
IEEE
14 years 4 months ago
2005
IEEE
— We explore the use of computational optimal control techniques for automated construction of policies in complex dynamic environments. Our implementation of dynamic programming...
IROS
2007
IEEE
14 years 4 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 ...
FLAIRS
2004
13 years 11 months ago
2004
The Federal Highway Administration (FHWA) Office of Highway Planning requires states to furnish vehicle classification data as part of the Highway Performance Monitoring Systems (...