Nearly monotonic problems: a key to effective FA/C distributed sensor interpretation?

Authors:
Norman Carver;Victor Lesser;Robert Whitehair
Affiliations:
Computer Science Department, Southern Illinois University, Carbondale, IL;Computer Science Department, University of Massachusetts, Amherst, MA;Computer Science Department, University of Massachusetts, Amherst, MA
Venue:
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Year:
1996

Citing 6
Cited 3

Tracking and data association

Tracking and data association
Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Modeling a dynamic environment using a Bayesian multiple hypothesis approach

Artificial Intelligence
A framework for the analysis of sophisticated control

A framework for the analysis of sophisticated control
A Framework for the Analysis of Sophisticated Control in Interpretation Systems

A Framework for the Analysis of Sophisticated Control in Interpretation Systems
A unified approach to dynamic coordination: planning actions and interactions in a distributed problem solving network

A unified approach to dynamic coordination: planning actions and interactions in a distributed problem solving network

Domain Monotonicity and the Performance of Local Solutions Strategies for CDPS-based Distributed Sensor Interpretation and Distributed Diagnosis

Autonomous Agents and Multi-Agent Systems
Policies for sharing distributed probabilistic beliefs

ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
Information sharing for distributed intrusion detection systems

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The functionally-accurate, cooperative (FA/C) distributed problem-solving paradigm is one approach for organizing distributed problem solving among homogeneous, cooperating agents. A key assumption of the FA/C model has been that the agents' local solutions can substitute for the raw data in determining the global solutions. This is not the case in general, however. Does this mean that researchers' intuitions have been wrong and/or that FA/C problem solving is not likely to be effective? We suggest that some domains have a characteristic that can account for the success of exchanging mainly local solutions. We call such problems nearly monotonic. This concept is discussed in the context of FA/C-based distributed sensor interpretation.