Modeling Intelligent Control of Distributed Cooperative Inferencing

Abstract : The ability to harness different problem-solving methods together into a cooperative system has the potential for significantly improving the performance of systems for solving NP-hard problems. The need exists for an intelligent controller that is able to effectively combine radically different problem-solving techniques with anytime and anywhere properties into a distributed cooperative environment. This controller requires models of the component algorithms in conjunction with feedback from those algorithms during run-time to manage a dynamic combination of tasks effectively. This research develops a domain-independent method for creating these models as well as a model for the controller itself. These models provide the means for the controller to select the most appropriate algorithms, both initially and during run-time. We utilize the algorithm performance knowledge contained in the algorithm models to aid in the selection process. This methodology is applicable to many NP-hard problems; applicability is only limited by the availability of anytime and anywhere algorithms for that domain. We demonstrate the capabilities of this methodology by applying it to a known NP-hard problem: uncertain inference over Bayesian Networks. Experiments using a collection of randomly generated networks and some common inference algorithms showed very promising results. Future directions for this research could involve the analysis of the impact of the accuracy of the algorithm models on the performance of the controller; the issue is whether the increased model accuracy would cause excessive system overhead, counteracting the potential increase in performance due to better algorithm selection.

[1]  Mark A. Kramer,et al.  GALGO: A Genetic ALGOrithm Decision Support Tool for Complex Uncertain Systems Modeled with Bayesian Belief Networks , 1993, UAI.

[2]  Tad Hogg,et al.  Better Than The Best: The Power of Cooperation , 1993 .

[3]  Solomon Eyal Shimony,et al.  On a Distributed Anytime Architecture for Probabilistic Reasoning. , 1995 .

[4]  Michael D. Vose,et al.  Modeling Simple Genetic Algorithms , 1995, Evolutionary Computation.

[5]  Tad Hogg,et al.  Solving the Really Hard Problems with Cooperative Search , 1993, AAAI.

[6]  Shlomo Zilberstein,et al.  Anytime algorithm development tools , 1996, SGAR.

[7]  A. E. NicholsonDepartment Belief Network Inference Algorithms: a Study of Performance Based on Domain Characterisation , 1996 .

[8]  Jack Dongarra,et al.  Pvm 3 user's guide and reference manual , 1993 .

[9]  Barbara Hayes-Roth,et al.  Opportunistic control of action in intelligent agents , 1993, IEEE Trans. Syst. Man Cybern..

[10]  Michael P. Wellman,et al.  Planning and Control , 1991 .

[11]  Mark S. Boddy,et al.  An Analysis of Time-Dependent Planning , 1988, AAAI.

[12]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[13]  P. Antsaklis INTELLIGENT CONTROL , 1994 .

[14]  Eugene Santos,et al.  Exploiting case-based independence for approximating marginal probabilities , 1996, Int. J. Approx. Reason..

[15]  Solomon Eyal Shimony,et al.  Finding MAPs for Belief Networks is NP-Hard , 1994, Artif. Intell..

[16]  Shlomo Zilberstein,et al.  Optimal Composition of Real-Time Systems , 1996, Artif. Intell..

[17]  Barbara Hayes-Roth,et al.  A Blackboard Architecture for Control , 1985, Artif. Intell..

[18]  Wright-Patterson Afb,et al.  Experiments with Distributed Anytime Inferencing: Working with Cooperative Algorithms , 1997 .

[19]  Richard E. Korf,et al.  Performance of Linear-Space Search Algorithms , 1995, Artif. Intell..

[20]  Solomon Eyal Shimony,et al.  Cost-Based Abduction and MAP Explanation , 1994, Artif. Intell..

[21]  Shlomo Zilberstein,et al.  Monitoring anytime algorithms , 1996, SGAR.

[22]  Robert L. Welch,et al.  Real Time Estimation of Bayesian Networks , 1996, UAI.

[23]  David Poole,et al.  Average-Case Analysis of a Search Algorithm for Estimating Prior and Posterior Probabilities in Bayesian Networks with Extreme Probabilities , 1993, IJCAI.

[24]  Stanley J. Rosenschein,et al.  An architecture for adaptive intelligent systems , 1996 .

[25]  Mark S. Boddy,et al.  Anytime Problem Solving Using Dynamic Programming , 1991, AAAI.

[26]  David Heckerman,et al.  An empirical comparison of three inference methods , 2013, UAI.

[27]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[28]  Michael Luby,et al.  Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard , 1993, Artif. Intell..

[29]  Weixiong Zhang,et al.  A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem , 1996, Artif. Intell..

[30]  Eugene Charniak,et al.  A New Admissible Heuristic for Minimal-Cost Proofs , 1991, AAAI.

[31]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[32]  L. Darrell Whitley,et al.  An Executable Model of a Simple Genetic Algorithm , 1992, FOGA.

[33]  Tad Hogg,et al.  An Economics Approach to Hard Computational Problems , 1997, Science.

[34]  Victor R. Lesser,et al.  Design-to-time scheduling and anytime algorithms , 1996, SGAR.

[35]  T. L. Vincent,et al.  Optimality in parametric systems , 1981 .