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...
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...
“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...
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...
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...