Sciweavers

655 search results - page 57 / 131
» Evolving Heuristics for Planning
Sort
View
AAAI
2004
15 years 1 months ago
Forward-Chaining Planning in Nondeterministic Domains
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work i...
Ugur Kuter, Dana S. Nau
SSD
2005
Springer
188views Database» more  SSD 2005»
15 years 5 months ago
Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results
Abstract. Evacuation planning is critical for numerous important applications, e.g. disaster emergency management and homeland defense preparation. Efficient tools are needed to pr...
Qingsong Lu, Betsy George, Shashi Shekhar
AAAI
1998
15 years 1 months ago
Using Caching to Solve Larger Probabilistic Planning Problems
Probabilistic planning algorithms seek e ective plans for large, stochastic domains. maxplan is a recently developed algorithm that converts a planning problem into an E-Majsat pr...
Stephen M. Majercik, Michael L. Littman
JAIR
2010
131views more  JAIR 2010»
14 years 10 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
IPPS
1998
IEEE
15 years 4 months ago
Fault Tolerant Mobility Planning for Rapidly Deployable Wireless Networks
Rapidly deployable wireless networks consist of mobile base stations and less powerful mobile hosts. The mobile base stations have to maintain wireless connectivity while on the mo...
Charles Shields Jr., Vikas Jain, Simeon C. Ntafos,...