Sciweavers

119 search results - page 12 / 24
» Domain Independent Approaches for Finding Diverse Plans
Sort
View
ICCBR
2009
Springer
13 years 5 months ago
Constraint-Based Case-Based Planning Using Weighted MAX-SAT
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...
Hankui Zhuo, Qiang Yang, Lei Li
JAIR
2008
130views more  JAIR 2008»
13 years 7 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
AAAI
1996
13 years 8 months ago
Total-Order Multi-Agent Task-Network Planning for Contract Bridge
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent inform...
Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop
AAAI
1994
13 years 8 months ago
Structured Circuit Semantics for Reactive Plan Execution Systems
A variety of reactive plan execution systems have been developed in recent years, each attempting to solve the problem of taking reasonable courses of action fast enough in a dyna...
Jaeho Lee, Edmund H. Durfee
W2GIS
2004
Springer
14 years 26 days ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou