A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
This paper describes a new algorithm to solve the decision making problem in Influence Diagrams based on algorithms for credal networks. Decision nodes are associated to imprecise...
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
In the complex, dynamic domain of Air Traffic Control (ATC) many unexpected events can happen during the execution of a plan. Sometimes these disruptions make the plan infeasible ...
Emergent narrative refers to simulation-based systems in which stories emerge from the autonomous interactions among character agents and/or the human player. Despite its advantag...