Engineering topics

Esterline, Albert

Publications and source records attributed to Esterline, Albert.

3 records

NASA NTRS1998

Multiobjective Evolutionary Path Planning via Sugeno-Based Tournament Selection

This paper introduces a new tournament selection algorithm that can be used for evolutionary path planning systems. The fuzzy (Sugeno) tournament selection algorithm (STSA) described in this paper selects candidate paths (CPs) to be parents and undergo reproduction based on: (1) path feasibility, (2) the euclidean distance of a path from the origin to its destination, and (3) the average change in the slope of a path. In this paper, we provide a detailed description of the fuzzy inference system used in the STSA as well as some examples of its usefulness. We then use 12 instances of our STSA to rank a population of CPs based on the above criteria. We also show how the STSA can obviate the need for the development of an explicit (lexicographic multiobjective) evaluation function and use it to develop multiobjective motion paths.

Dozier, Gerry↗

NASA NTRS1998

The Deontic Transaction Model in Multi-Agent Normative Systems

In the area of multi-agent systems, much research is devoted to the coordination of the agents. There exist several issues, two of which are summarized. The first is that, although agents are said to be autonomous, they always react in a predictable way to each message, and they cannot decide to violate the conventions that are hard-wired into the protocol. In fact, there might be circumstances in which the agent violates a convention in order to realize a private goal that it considers to be more important. Another issue is that, if the protocols that agents use to react to the environment are fixed, they have no way to respond to changes. However, an important characteristic of agents is that they eon react to a changing environment. Although transaction models ([BOH92], [GR93]) evolved from the database domain, they establish a general execution paradigm that ideally covers all the subsystems invoked in a sequence of transactions. So transaction models apply to multi-agent systems. Recently, some research has been devoted to overcoming the limitations of the traditional transaction models which are suitable for conventional systems and focus on system integrity, e,g., [SJ97]. Here we solve above issues by turning to a deontic concept: obligation. In multi-agent systems, agents interact with each other according to norms, We use deontic logic ([And58], [Aqv84], [B C96], [JS94], [MW93]) to model norms. Here the norms prescribe how the agents ought to behave, but-- and this is essential-- they do not exclude the possibility of "bad" behavior (i.e., the actual behavior may deviate from the ideal), and so they also prescribe what should be done in circumstances of norm violation. Thus, we propose a new approach --- a deontic transaction model for multi-agent normative systems. Our approach improves the protocol of "abort/commit" of traditional transaction models to a protocol of "abort/exception/commit". In multi-agent normative systems, we can see the violation of a norm as an exception and how the other agents react to the violation as exception handling. This paper concentrates on our formal model.

Huang, Yonghua↗

NASA NTRS1998

Formal Modeling of Multi-Agent Systems using the Pi-Calculus and Epistemic Logic

Multi-agent systems have become important recently in computer science, especially in artificial intelligence (AI). We allow a broad sense of agent, but require at least that an agent has some measure of autonomy and interacts with other agents via some kind of agent communication language. We are concerned in this paper with formal modeling of multi-agent systems, with emphasis on communication. We propose for this purpose to use the pi-calculus, an extension of the process algebra CCS. Although the literature on the pi-calculus refers to agents, the term is used there in the sense of a process in general. It is our contention, however, that viewing agents in the AI sense as agents in the pi-calculus sense affords significant formal insight. One formalism that has been applied to agents in the AI sense is epistemic logic, the logic of knowledge. The success of epistemic logic in computer science in general has come in large part from its ability to handle concepts of knowledge that apply to groups. We maintain that the pi-calculus affords a natural yet rigorous means by which groups that are significant to epistemic logic may be identified, encapsulated, structured into hierarchies, and restructured in a principled way. This paper is organized as follows: Section 2 introduces the pi-calculus; Section 3 takes a scenario from the classical paper on agent-oriented programming [Sh93] and translates it into a very simple subset of the n-calculus; Section 4 then shows how more sophisticated features of the pi-calculus may bc brought into play; Section 5 discusses how the pi-calculus may be used to define groups for epistemic logic; and Section 6 is the conclusion.

Rorie, Toinette↗