Arrow Research search

Author name cluster

Richard Alterman

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

4 papers
1 author row

Possible papers

4

JAAMAS Journal 2026 Journal Article

Autonomous Agents that Learn to Better Coordinate

  • Andrew Garland
  • Richard Alterman

Abstract A fundamental difficulty faced by groups of agents that work together is how to efficiently coordinate their efforts. This coordination problem is both ubiquitous and challenging, especially in environments where autonomous agents are motivated by personal goals. Previous AI research on coordination has developed techniques that allow agents to act efficiently from the outset based on common built-in knowledge or to learn to act efficiently when the agents are not autonomous. The research described in this paper builds on those efforts by developing distributed learning techniques that improve coordination among autonomous agents. The techniques presented in this work encompass agents who are heterogeneous, who do not have complete built-in common knowledge, and who cannot coordinate solely by observation. An agent learns from her experiences so that her future behavior more accurately reflects what works (or does not work) in practice. Each agent stores past successes (both planned and unplanned) in their individual casebase. Entries in a casebase are represented as coordinated procedures and are organized around learned expectations about other agents. It is a novel approach for individuals to learn procedures as a means for the group to coordinate more efficiently. Empirical results validate the utility of this approach. Whether or not the agents have initial expertise in solving coordination problems, the distributed learning of the individual agents significantly improves the overall performance of the community, including reducing planning and communication costs.

AAAI Conference 1996 Conference Paper

Improving Case Retrieval by Remembering Questions

  • Richard Alterman

This paper discusses techniques that improve the performance of a case retrieval system, after it is deployed, as a result of the continued usage of the system, by remembering previous episodes of question answering. The user generates a request for information and the system responds with the retrieval of relevant case(s). A history of such transactional behavior over a given set of data is maintained by the system and used as a foundation for adapting its future retrieval behavior. With each transaction, the system acquires information about the usage of the system that is subsequently used to adjust the behavior of the system. This notion of a case retrieval system draws on a distinction between the system in isolation and the system as it is used for a particular set of cases. It also draws on distinctions between the designed system, the deployed system, and the system that emerges as it is used.

AAAI Conference 1986 Conference Paper

An Adaptive Planner

  • Richard Alterman

This paper is about an approach to the flexible utilization of old plans called adaptive planning. An adaptive planner can take advantage of the details associated with specific plans, while still maintaining the flexibility of a planner that works from general plans. Key elements in the theory of adaptive planning are its treatment of background knowledge and the introduction of a notion of planning by situation matching.

AIJ Journal 1985 Journal Article

A dictionary based on concept coherence

  • Richard Alterman

NEXUS is a computational system which uses a dictionary of 100 to 150 event/state concepts to construct representations of narrative text. Associated with each event/state concept are its deep case relations and their default values. Concepts in the dictionary are related by one of seven event/state concept coherence relations. Relationships between concepts include a list of constraints on the matching of case arguments between the two concepts. NEXUS has been successfully applied to eight paragraph-length samples of text, including “A Restaurant Story”, “The Margie Story”, and “Robbing a Liquor Store”. The resulting discourse representations have been used successfully to answer questions and compute summaries for these texts. The organization of this paper is as follows. After introducing the notion of event/state concept coherence, the paper proceeds by discussing the structure of the dictionary. This includes detailed descriptions of how individual concepts are represented and related, and some discussion of issues concerning causality and property inheritance. Then, after giving some brief examples of the representations produced by NEXUS, the NEXUS program is described. NEXUS was programmed in procedural logic in lisp, so this section will include Horn clause specifications. The fourth section of the paper shows a subportion of the dictionary and, in detail, describes NEXUS processing of five samples of text. Included in the appendix are examples of NEXUS' input and output.

v2026.09.13