Scalability of Real-Time Reasoning in Intelligent Agents

From Tetherless World Wiki

Jump to: navigation, search

Citation: Barbara Hayes-Roth and Anne Collinot. (1991) Scalability of Real-Time Reasoning in Intelligent Agents. In KSL-91-08, Janury,1991.

Publication techreport ( Edit )
type Technical Report
bibtype techreport
Bibtex basics
author Barbara Hayes-Roth and Anne Collinot
title Scalability of Real-Time Reasoning in Intelligent Agents
number KSL-91-08
institution Knowledge Systems, AI Laboratory
year 1991
month Janury
Bibtex more
Access Paper
abstract An intelligent agent must interact with dynamic entities in real time.Because it cannot predict all events that will occur, it must notice and respond to important unanticipated events. However, insuring execution of the best possible operation at each point in time conflicts with meeting deadlines, especially as event rate and number of known operations increase.Rather than engineer agents to meet deadlines under particular parameter values, we aim to build agents whose real-time performance scales up over increases in parameter values. The scalability problem is: How can an agent with limited resources execute high-quality operations in bounded time,despite increases in event rate and number of known operations? We propose a satificing algorithm. To bound response time, it triggers on a limited number is operations and interrupts triggering to execute the best one available whenever it triggers a "good enough" operation or a deadline occurs. To ensure that it can execute high-priority operations when interrupts occur, it uses dynamic control plans to trigger operations roughly "best-first." In this paper, we describe the satificing algorithm, informally analyze its behavior, and present experimental results.

KSL Technical Report ID: KSL-91-08
Facts about Scalability of Real-Time Reasoning in Intelligent AgentsRDF feed
Abstract An intelligent agent must interact with dy … An intelligent agent must interact with dynamic entities in real time.Because it cannot predict all events that will occur, it must notice and respond to important unanticipated events. However, insuring execution of the best possible operation at each point in time conflicts with meeting deadlines, especially as event rate and number of known operations increase.Rather than engineer agents to meet deadlines under particular parameter values, we aim to build agents whose real-time performance scales up over increases in parameter values. The scalability problem is: How can an agent with limited resources execute high-quality operations in bounded time,despite increases in event rate and number of known operations? We propose a satificing algorithm. To bound response time, it triggers on a limited number is operations and interrupts triggering to execute the best one available whenever it triggers a "good enough" operation or a deadline occurs. To ensure that it can execute high-priority operations when interrupts occur, it uses dynamic control plans to trigger operations roughly "best-first." In this paper, we describe the satificing algorithm, informally analyze its behavior, and present experimental results. ehavior, and present experimental results.
Author Barbara Hayes-Roth and Anne Collinot  +
Bibtype techreport  +
Has author Barbara Hayes-Roth and Anne Collinot  +
Has identifier KSL-91-08  +
Has publishing details Janury,1991  +
Has title Scalability of Real-Time Reasoning in Intelligent Agents  +
Has where published KSL-91-08  +
Has year 1991  +
Institution Knowledge Systems, AI Laboratory  +
Ksl tr id KSL-91-08  +
Month Janury  +
Number KSL-91-08  +
Process note NO  +
Title Scalability of Real-Time Reasoning in Intelligent Agents  +
Year 1991  +
Retrieved from "http://tw.rpi.edu/wiki/Scalability_of_Real-Time_Reasoning_in_Intelligent_Agents"
Personal tools