Stochastic roadmap simulation

For robot control, Stochastic roadmap simulation[1] is inspired by probabilistic roadmap[2] methods (PRM) developed for robot motion planning.

The main idea of these methods is to capture the connectivity of a geometrically complex high-dimensional space by constructing a graph of local paths connecting points randomly sampled from that space. A roadmap G = (V,E) is a directed graph. Each vertex v is a randomly sampled conformation in C. Each (directed) edge from vertex vi to vertex vj carries a weight Pij , which represents the probability that the molecule will move to conformation vj , given that it is currently at vi. The probability Pij is 0 if there is no edge from vi to vj. Otherwise, it depends on the energy difference between conformations.

Stochastic roadmap simulation is used to explore the kinetics of molecular motion by simultaneously examining multiple pathways in the roadmap. Ensemble properties of molecular motion (e.g., probability of folding (PFold), escape time in ligand-protein binding) is computed efficiently and accurately with stochastic roadmap simulation. PFold values are computed using the first step analysis of Markov chain theory.

See also

References

  1. ^ Apaydin, Mehmet Serkan; Brutlag, Douglas L.; Guestrin, Carlos; Hsu, David; Latombe, Jean-Claude (2002), "Stochastic roadmap simulation: An efficient representation and algorithm for analyzing molecular motion", Proceedings of the sixth annual international conference on Computational biology, pp. 12–21, doi:10.1145/565196.565199, ISBN 1-58113-498-3
    • See also Apaydin, Mehmet Serkan; Brutlag, Douglas L.; Guestrin, Carlos; Hsu, David; Latombe, Jean-Claude; Varma, Chris (2003), "Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion", Journal of Computational Biology, 10 (3–4): 257–281, doi:10.1089/10665270360688011, PMID 12935328
  2. ^ Kavraki, L. E.; Svestka, P.; Latombe, J.-C.; Overmars, M. H. (1996), "Probabilistic roadmaps for path planning in high-dimensional configuration spaces", IEEE Transactions on Robotics and Automation, 12 (4): 566–580, CiteSeerX 10.1.1.19.6316, doi:10.1109/70.508439.
Stub icon

This robotics-related article is a stub. You can help Wikipedia by adding missing information.

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.