We describe a planning system which automatically creates abstract operators while organizing a g... more We describe a planning system which automatically creates abstract operators while organizing a given set of primitive operators into a taxonomic hierarchy. At the same time, the system creates categories of abstract object types which allow abstract operators to apply to broad classes of functionally similar objects. After the system has found a plan to achieve a particular goal, it replaces each primitive operator in the plan with one of its ancestors from the operator taxonomy.
In this paper, we present a framework for performing incremental design in the domain of linear c... more In this paper, we present a framework for performing incremental design in the domain of linear circuits (Kerr 1977; Lancaster 1974; Walton 1987). By incremental design, we mean the modification of an existing design to meet additional design goals while not denying certain design constraints. We start with a given circuit and want to modify aspects of its behavior while not changing others. Through means-ends search, we add components to the circuit to achieve the desired behavior without violating given constraints.
A graph G=(V,E) is a set V of vertices and a set E of undirected edges (u,v), each connecting a p... more A graph G=(V,E) is a set V of vertices and a set E of undirected edges (u,v), each connecting a pair of vertices u and v. A k-attack on a graph G is a set of k distinct vertices {a 1 ,⋯,a k } which are said to be under attack. A k-attack A can be countered by a subset of defender vertices X if and only if there exists an injective function f from A to X, such that either f(a i )=a i or (a i ,f(a i )) is an edge of G, for all i, 1≤i≤k. Given a graph G, a subset of V is a k-defensive dominating set of G if and only if D k can counter any k-attack in G. We present results as to the number of vertices in D k for several classes of graphs and properties of these sets in general graphs. While the problem of finding a minimum-size D k in an arbitrary graph is NP-hard we present a polynomial-time algorithm for finding such a set in an arbitrary tree.
Most of the work on behavior prediction in the field of Qualitative Reasoning has focused on tran... more Most of the work on behavior prediction in the field of Qualitative Reasoning has focused on transient behavior and responses to perturbations; very little has been done regarding systems in steady state. A large class of systems, especially in the area of power systems, are designed for sinusoidal steady‐state operation. Thus, an understanding of the steady state behavior of electrical circuits is very important.This article presents a framework for reasoning about linear electrical circuits in sinusoidal steady state. The reasoning process relies on a constraint‐based model of the circuit, derived from electro‐magnetic theory and generated automatically from the structure of the circuit. In a linear circuit operating in steady state, all quantities are sinusoidals of the same frequency as the source. Since any sinusoidal can be expressed as the real part of a complex exponential, we use the complex form, which simplifies computations; this complex form, ch...
Examining Extended Dynamic Scripting in a Tactical Game Framework
Artificial Intelligence and Interactive Digital Entertainment Conference, 2009
Dynamic scripting is a reinforcement learning algorithm designed specifically to learn appropriat... more Dynamic scripting is a reinforcement learning algorithm designed specifically to learn appropriate tactics for an agent in a modern computer game, such as Neverwinter Nights. This reinforcement learning algorithm has previously been extended to support the automatic construction of new abstract states to improve its context sensitivity and integrated with a graphical behavior modeling architecture to allow for hierarchical dynamic
This paper describes a number of extensions to the dynamic scripting reinforcement learning algor... more This paper describes a number of extensions to the dynamic scripting reinforcement learning algorithm which was designed for modern computer games. These enhancements include integration with an AI tool and automatic state construction. A subset of a real-time strategy game is used to demonstrate the learning algorithm both improving the performance of agents in the game and acting as a
A graph is self-repairing if it is 2-connected and such that the removal of any single vertex res... more A graph is self-repairing if it is 2-connected and such that the removal of any single vertex results in no increase in distance between any pair of remaining vertices of the graph. We completely characterize the class of minimum self-repairing graphs, which have the fewest edges for a given number of vertices.
Uploads
Papers by Arthur Farley