Sciweavers

703 search results - page 19 / 141
» Using Cases Utility for Heuristic Planning Improvement
Sort
View
KER
2007
90views more  KER 2007»
13 years 7 months ago
PLTOOL: A knowledge engineering tool for planning and learning
AI planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will tra...
Susana Fernández, Daniel Borrajo, Raquel Fu...
SODA
2001
ACM
110views Algorithms» more  SODA 2001»
13 years 9 months ago
IMproved results for route planning in stochastic transportation
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
Justin A. Boyan, Michael Mitzenmacher
CSCLP
2005
Springer
13 years 9 months ago
Analysis of Heuristic Synergies
“Heuristic synergy” refers to improvements in search performance when the decisions made by two or more heuristics are combined. This paper considers combinations based on prod...
Richard J. Wallace
IJCAI
2003
13 years 9 months ago
A lookahead strategy for solving large planning problems
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Vincent Vidal
MAGS
2008
121views more  MAGS 2008»
13 years 7 months ago
A decentralized model for automated multi-attribute negotiations with incomplete information and general utility functions
This paper presents a decentralized model that allows self-interested agents to reach "win-win" agreements in a multi-attribute negotiation. The model is based on an alt...
Guoming Lai, Katia P. Sycara, Cuihong Li