565 search results - page 43 / 113 » Heuristics for Planning with SAT |
ICRA
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
ICCBR
2009
Springer
13 years 5 months ago
2009
Springer
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some...
LOGCOM
2011
12 years 11 months ago
2011
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...
IJCAI
2007
13 years 9 months ago
2007
As any other problem solving task that employs search, AI Planning needs heuristics to efficiently guide the problem-space exploration. Machine learning (ML) provides several tec...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
Bayesian games can be used to model single-shot decision problems in which agents only possess incomplete information about other agents, and hence are important for multiagent co...