Difference between revisions of "Team:HUST-China/Software"
| Line 237: | Line 237: | ||
</div> | </div> | ||
<div class="col-md-12"> | <div class="col-md-12"> | ||
| − | <h3>Sensing module</h3> | + | <span class="red-content"><h3>Sensing module</h3></span> |
| − | <h4>Algorithms used in sensing module</h4> | + | <span class="red-content"><h4>Algorithms used in sensing module</h4></span> |
<p class="red-content">Gradient descent<p> | <p class="red-content">Gradient descent<p> | ||
<p>Gradient descent is a iterative algorithm used find a local minimum of a function using gradient descent. If we want to fit a function h(X) (X is set of independent variable xi), loss function will be j(X). We will calculate the gradient of xi ∈ X : ∇j(X) and x<sub>(n+1)</sub>=x<sub>n</sub>-i*∇j(X).</p> | <p>Gradient descent is a iterative algorithm used find a local minimum of a function using gradient descent. If we want to fit a function h(X) (X is set of independent variable xi), loss function will be j(X). We will calculate the gradient of xi ∈ X : ∇j(X) and x<sub>(n+1)</sub>=x<sub>n</sub>-i*∇j(X).</p> | ||
| Line 254: | Line 254: | ||
<br> | <br> | ||
<div class="col-md-12"> | <div class="col-md-12"> | ||
| − | <h4>Step of sensing module</h4> | + | <span class="red-content"><h4>Step of sensing module</h4></span> |
<p>Firstly, we will feed all variable’s initial value (X_0^all) and use our model to predict all variable’s value in next unit of time. Secondly, we feed the true value of variable that can be sensed (X^s). | <p>Firstly, we will feed all variable’s initial value (X_0^all) and use our model to predict all variable’s value in next unit of time. Secondly, we feed the true value of variable that can be sensed (X^s). | ||
Then, we calculate the Euclidean Distance between our prediction and true value(||P_t^s [i]-X_t^s ||) and use it as weight1. Sp is the sum of predictions.</p> | Then, we calculate the Euclidean Distance between our prediction and true value(||P_t^s [i]-X_t^s ||) and use it as weight1. Sp is the sum of predictions.</p> | ||
| Line 262: | Line 262: | ||
<img class="img-responsive" src="https://static.igem.org/mediawiki/2018/4/46/T--HUST-China--2018-model-PSD002.png.PNG"> | <img class="img-responsive" src="https://static.igem.org/mediawiki/2018/4/46/T--HUST-China--2018-model-PSD002.png.PNG"> | ||
</div> | </div> | ||
| + | |||
<div class="col-md-12"> | <div class="col-md-12"> | ||
| − | <h3>Learning Module</h3> | + | <span class="red-content"><h4>Result</h4></span> |
| + | <p>The result of sensing module is showing below, the true data is a simplified growth curve of Rhodopseudomonas, the figure shows our module works well.</p> | ||
| + | |||
| + | <div class="col-md-8 col-md-offset-1"> | ||
| + | <img class="img-responsive" src="https://static.igem.org/mediawiki/2018/7/71/T--HUST-China--2018-model-software-001.gif"> | ||
| + | </div> | ||
| + | |||
| + | <div class="col-md-12"> | ||
| + | |||
| + | <span class="red-content"><h3>Learning Module</h3></span> | ||
<p>We use Q-Learning method to learn how to make decision based on environment. Q-learning is a reinforcement learning method used in machine learning. It can learn a policy, which tells us what actions to take under what situations. It can handle problems with stochastic transitions and rewards, without requiring adaptations.</p> | <p>We use Q-Learning method to learn how to make decision based on environment. Q-learning is a reinforcement learning method used in machine learning. It can learn a policy, which tells us what actions to take under what situations. It can handle problems with stochastic transitions and rewards, without requiring adaptations.</p> | ||
</div> | </div> | ||
<div class="col-md-8 col-md-offset-1"> | <div class="col-md-8 col-md-offset-1"> | ||
<img class="img-responsive" src="https://static.igem.org/mediawiki/2018/1/16/T--HUST-China--2018-model-PSD003.png.PNG"> | <img class="img-responsive" src="https://static.igem.org/mediawiki/2018/1/16/T--HUST-China--2018-model-PSD003.png.PNG"> | ||
| + | </div> | ||
| + | |||
| + | <div class="col-md-12"> | ||
| + | <span class="red-content"><h4>Result</h4></span> | ||
| + | <p>The voltage can be held in high level in a relatively long time with the control of oxygen, carbon dioxide(even lactate if needed) input by learning module. The result shows that learning module’s participation makes voltage output more stable.</p> | ||
| + | </div> | ||
| + | <div class="col-md-8 col-md-offset-1"> | ||
| + | <img class="img-responsive" src="https://static.igem.org/mediawiki/2018/thumb/e/e8/T--HUST-China--2018-model-software-002.png"> | ||
</div> | </div> | ||
Revision as of 13:01, 22 November 2018
Software
1. Abstract
We build a software to capture the situation of our system and learn to decide what to do to interact our system in order to get a better electricity output. You can download our software here.
2. Introduction
Our software consists of two modules, the sensing module and learning module. Sensing module needs to obtain the condition of system based on the data of limited sensors. Learning module needs to learn according to the data from our model of system or the data from experiment, explore in the virtual environment or reality to learn how to make decision and memorize the knowledge.
In application, the software will use sensing module to obtain the condition of system and use the knowledge learned by learning module to make decision.
Sensing module
Algorithms used in sensing module
Gradient descent
Gradient descent is a iterative algorithm used find a local minimum of a function using gradient descent. If we want to fit a function h(X) (X is set of independent variable xi), loss function will be j(X). We will calculate the gradient of xi ∈ X : ∇j(X) and x(n+1)=xn-i*∇j(X).
Mean Shift
Mean shift is a non-parametric feature-space analysis technique for locating the maxima of a density function, a so-called mode-seeking algorithm (Cheng et al. 1995)[1]. This algorithm will set a core whose radius is r, each data x in core will add the move vector:
Each iteration will judge and calculate a new move vector until the coordinate of the core doesn’t move.
Step of sensing module
Firstly, we will feed all variable’s initial value (X_0^all) and use our model to predict all variable’s value in next unit of time. Secondly, we feed the true value of variable that can be sensed (X^s). Then, we calculate the Euclidean Distance between our prediction and true value(||P_t^s [i]-X_t^s ||) and use it as weight1. Sp is the sum of predictions.
After that, we use mean shift algorithm based on the weight1 (||P_t^s [i]-X_t^s ||) to find several scores (SC). Next step is to sort possible predictions by weigh2, use gradient descent on top np predictions to get new possible prediction and kill last dp predictions. (np = new_rate *(max_prediction - sp),dp=dead_rate*sp). Finally the software start next iteration.
Result
The result of sensing module is showing below, the true data is a simplified growth curve of Rhodopseudomonas, the figure shows our module works well.
Learning Module
We use Q-Learning method to learn how to make decision based on environment. Q-learning is a reinforcement learning method used in machine learning. It can learn a policy, which tells us what actions to take under what situations. It can handle problems with stochastic transitions and rewards, without requiring adaptations.
Result
The voltage can be held in high level in a relatively long time with the control of oxygen, carbon dioxide(even lactate if needed) input by learning module. The result shows that learning module’s participation makes voltage output more stable.
Reference
[1] Cheng, Yizong (August 1995). "Mean Shift, Mode Seeking, and Clustering". IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. 17 (8): 790–799. doi:10.1109/34.400568.
