Sciweavers

842 search results - page 12 / 169
» Search Control Techniques for Planning
Sort
View
AIPS
2006
13 years 10 months ago
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics
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
CP
1998
Springer
14 years 1 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
HRI
2009
ACM
14 years 3 months ago
Planning as an architectural control mechanism
We describe recent work on PECAS, an architecture for intelligent robotics that supports multi-modal interaction. Categories and Subject Descriptors I.2.8 [Computing Methodologies...
Nick Hawes, Michael Brenner, Kristoffer Sjö&o...
AI
1999
Springer
13 years 8 months ago
Learning Action Strategies for Planning Domains
There are many different approaches to solving planning problems, one of which is the use of domain specific control knowledge to help guide a domain independent search algorithm. ...
Roni Khardon