DeepAI
Log In Sign Up

A Probabilistic Algorithm for Calculating Structure: Borrowing from Simulated Annealing

03/06/2013
by   Russ B. Altman, et al.
0

We have developed a general Bayesian algorithm for determining the coordinates of points in a three-dimensional space. The algorithm takes as input a set of probabilistic constraints on the coordinates of the points, and an a priori distribution for each point location. The output is a maximum-likelihood estimate of the location of each point. We use the extended, iterated Kalman filter, and add a search heuristic for optimizing its solution under nonlinear conditions. This heuristic is based on the same principle as the simulated annealing heuristic for other optimization problems. Our method uses any probabilistic constraints that can be expressed as a function of the point coordinates (for example, distance, angles, dihedral angles, and planarity). It assumes that all constraints have Gaussian noise. In this paper, we describe the algorithm and show its performance on a set of synthetic data to illustrate its convergence properties, and its applicability to domains such ng molecular structure determination.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8

02/27/2013

Probabilistic Constraint Satisfaction with Non-Gaussian Noise

We have previously reported a Bayesian algorithm for determining the coo...
03/13/2013

MESA: Maximum Entropy by Simulated Annealing

Probabilistic reasoning systems combine different probabilistic rules an...
01/30/2019

An approximate Itô-SDE based simulated annealing algorithm for multivariate design optimization problems

This research concerns design optimization problems involving numerous d...
01/30/2023

NPSA: Nonparametric Simulated Annealing for Global Optimization

In this paper we describe NPSA, the first parallel nonparametric global ...
08/29/2019

Revisiting the orbital tracking problem

Consider a space object in an orbit about the earth. An uncertain initia...
10/31/2011

Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting

We present a new algorithm for probabilistic planning with no observabil...