Stochastic roadmap simulation (original) (raw)
For robot control, Stochastic roadmap simulation is inspired by probabilistic roadmap 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.
| Property | Value |
|---|---|
| dbo:abstract | For robot control, Stochastic roadmap simulation is inspired by probabilistic roadmap 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. (en) |
| dbo:wikiPageID | 27005434 (xsd:integer) |
| dbo:wikiPageLength | 2570 (xsd:nonNegativeInteger) |
| dbo:wikiPageRevisionID | 1099248589 (xsd:integer) |
| dbo:wikiPageWikiLink | dbr:Robot_control dbr:Probabilistic_roadmap dbr:Statistical_ensemble_(mathematical_physics) dbr:Motion_(physics) dbc:Robot_control dbc:Stochastic_simulation dbr:Jean-Claude_Latombe dbr:Mark_Overmars dbr:Markov_chain dbr:Motion_planning |
| dbp:wikiPageUsesTemplate | dbt:Reflist dbt:Robotics-stub |
| dct:subject | dbc:Robot_control dbc:Stochastic_simulation |
| rdfs:comment | For robot control, Stochastic roadmap simulation is inspired by probabilistic roadmap 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. (en) |
| rdfs:label | Stochastic roadmap simulation (en) |
| owl:sameAs | freebase:Stochastic roadmap simulation wikidata:Stochastic roadmap simulation https://global.dbpedia.org/id/4vQyv |
| prov:wasDerivedFrom | wikipedia-en:Stochastic_roadmap_simulation?oldid=1099248589&ns=0 |
| foaf:isPrimaryTopicOf | wikipedia-en:Stochastic_roadmap_simulation |
| is dbo:wikiPageRedirects of | dbr:Stochastic_Roadmap_Simulation |
| is dbo:wikiPageWikiLink of | dbr:Stochastic_Roadmap_Simulation |
| is foaf:primaryTopic of | wikipedia-en:Stochastic_roadmap_simulation |