Sciweavers

6957 search results - page 30 / 1392
» Planning before plans
Sort
View
AI
2008
Springer
13 years 8 months ago
Sequential Monte Carlo in reachability heuristics for probabilistic planning
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
Daniel Bryce, Subbarao Kambhampati, David E. Smith
CORR
1998
Springer
135views Education» more  CORR 1998»
13 years 7 months ago
The Computational Complexity of Probabilistic Planning
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
Michael L. Littman, Judy Goldsmith, Martin Mundhen...
ICRA
2009
IEEE
170views Robotics» more  ICRA 2009»
14 years 2 months ago
Path diversity is only part of the problem
— The goal of motion planning is to find a feasible path that connects two positions and is free from collision with obstacles. Path sets are a robust approach to this problem i...
Ross A. Knepper, Matthew T. Mason
JCDL
2010
ACM
166views Education» more  JCDL 2010»
13 years 10 months ago
Timeline interactive multimedia experience (time): on location access to aggregate event information
Attending a complex scheduled social event, such as a multi-day music festival, requires a significant amount of planning before and during its progression. Advancements in mobile...
Jeff Crow, Eryn Whitworth, Ame Wongsa, Luis Franci...
ROBOCUP
2000
Springer
145views Robotics» more  ROBOCUP 2000»
13 years 11 months ago
Adaptive Path Planner for Highly Dynamic Environments
Abstract. This paper describes adaptive path planning, a novel approach to path planning for car-like mobile robots. Instead of creating a new plan from scratch, whenever changes i...
Jacky Baltes, Nicholas Hildreth