Skip to content

Commit

Permalink
Built site for gh-pages
Browse files Browse the repository at this point in the history
  • Loading branch information
hurak committed Dec 17, 2024
1 parent 8f02717 commit 8c0767f
Show file tree
Hide file tree
Showing 44 changed files with 23,247 additions and 9,125 deletions.
2 changes: 1 addition & 1 deletion .nojekyll
Original file line number Diff line number Diff line change
@@ -1 +1 @@
ab5b338b
62f3a585
136 changes: 68 additions & 68 deletions classes_reset.html

Large diffs are not rendered by default.

58 changes: 29 additions & 29 deletions classes_switched.html

Large diffs are not rendered by default.

1,105 changes: 1,105 additions & 0 deletions complementarity_references 25.html

Large diffs are not rendered by default.

1,680 changes: 840 additions & 840 deletions complementarity_simulations.html

Large diffs are not rendered by default.

16 changes: 8 additions & 8 deletions des_automata.html
Original file line number Diff line number Diff line change
Expand Up @@ -2131,16 +2131,16 @@ <h3 class="anchored" data-anchor-id="mealy-machine">Mealy machine</h3>
<span id="cb3-11"><a href="#cb3-11" aria-hidden="true" tabindex="-1"></a><span class="pp">@show</span> <span class="fu">update!</span>(dtr), <span class="fu">output</span>(dtr)</span></code><button title="Copy to Clipboard" class="code-copy-button"><i class="bi"></i></button></pre></div>
</details>
<div class="cell-output cell-output-stdout">
<pre><code>x_initial = rand(0:k, n) = [2, 0, 2, 3]
output(dtr) = [0, 1, 1, 1]
(update!(dtr), output(dtr)) = ([2, 2, 0, 2], [1, 0, 1, 1])
(update!(dtr), output(dtr)) = ([3, 2, 2, 0], [0, 1, 0, 1])
(update!(dtr), output(dtr)) = ([3, 3, 2, 2], [0, 0, 1, 0])
(update!(dtr), output(dtr)) = ([3, 3, 3, 2], [0, 0, 0, 1])
(update!(dtr), output(dtr)) = ([3, 3, 3, 3], [1, 0, 0, 0])</code></pre>
<pre><code>x_initial = rand(0:k, n) = [0, 2, 2, 3]
output(dtr) = [0, 1, 0, 1]
(update!(dtr), output(dtr)) = ([0, 0, 2, 2], [0, 0, 1, 0])
(update!(dtr), output(dtr)) = ([0, 0, 0, 2], [0, 0, 0, 1])
(update!(dtr), output(dtr)) = ([0, 0, 0, 0], [1, 0, 0, 0])
(update!(dtr), output(dtr)) = ([1, 0, 0, 0], [0, 1, 0, 0])
(update!(dtr), output(dtr)) = ([1, 1, 0, 0], [0, 0, 1, 0])</code></pre>
</div>
<div class="cell-output cell-output-display" data-execution_count="1">
<pre><code>([3, 3, 3, 3], [1, 0, 0, 0])</code></pre>
<pre><code>([1, 1, 0, 0], [0, 0, 1, 0])</code></pre>
</div>
</div>
<p>We can see that although initially the there can be more tokens, after a few iterations the algorithm achieves the goal of having just one token in the ring.</p>
Expand Down
154 changes: 77 additions & 77 deletions hybrid_equations.html

Large diffs are not rendered by default.

1,093 changes: 1,093 additions & 0 deletions hybrid_equations_references 25.html

Large diffs are not rendered by default.

1,097 changes: 1,097 additions & 0 deletions intro_outline 26.html

Large diffs are not rendered by default.

13,008 changes: 6,504 additions & 6,504 deletions max_plus_algebra.html

Large diffs are not rendered by default.

1,187 changes: 1,187 additions & 0 deletions mld_DHA 24.html

Large diffs are not rendered by default.

1,449 changes: 1,449 additions & 0 deletions mld_intro 25.html

Large diffs are not rendered by default.

282 changes: 175 additions & 107 deletions mld_intro.html

Large diffs are not rendered by default.

177 changes: 163 additions & 14 deletions mpc_mld_explicit.html

Large diffs are not rendered by default.

38 changes: 26 additions & 12 deletions mpc_mld_online.html
Original file line number Diff line number Diff line change
Expand Up @@ -69,8 +69,22 @@
}
}</script>

<script src="https://cdnjs.cloudflare.com/polyfill/v3/polyfill.min.js?features=es6"></script>
<script src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml-full.js" type="text/javascript"></script>
<script>window.backupDefine = window.define; window.define = undefined;</script><script src="https://cdn.jsdelivr.net/npm/katex@latest/dist/katex.min.js"></script>
<script>document.addEventListener("DOMContentLoaded", function () {
var mathElements = document.getElementsByClassName("math");
var macros = [];
for (var i = 0; i < mathElements.length; i++) {
var texText = mathElements[i].firstChild;
if (mathElements[i].tagName == "SPAN") {
katex.render(texText.data, mathElements[i], {
displayMode: mathElements[i].classList.contains('display'),
throwOnError: false,
macros: macros,
fleqn: false
});
}}});
</script>
<script>window.define = window.backupDefine; window.backupDefine = undefined;</script><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/katex@latest/dist/katex.min.css">

<script type="text/javascript">
const typesetMath = (el) => {
Expand Down Expand Up @@ -648,24 +662,24 @@ <h2 class="anchored" data-anchor-id="optimal-control-on-a-finite-horizon">Optima
<section id="cost-function" class="level3">
<h3 class="anchored" data-anchor-id="cost-function">Cost function</h3>
<p>First, we need to set the cost function for the optimal control problem. As usual in optimal control, we want to impose different weights on invididual state and control variables. The most popular is the quadratic cost function well known from the LQ-optimal control</p>
<p><span class="math display">\[
<p><span class="math display">
J_0(x(0),U_0) = x_N^T S_N x_N + \sum_{k=0}^{N-1} \left( x_k^T Q x_k + u_k^T R u_k \right)
\]</span></p>
</span></p>
<p>But other (weighted) norms can also be used, in particular 1-norm and infinity-norm</p>
<p><span class="math display">\[
<p><span class="math display">
J_0(x(0),U_0) = \|S_N x_N\|_1 + \sum_{k=0}^{N-1} \left( \|Q x_k\|_1 + \|R u_k\|_1 \right),
\]</span></p>
<p><span class="math display">\[
</span></p>
<p><span class="math display">
J_0(x(0),U_0) = \|S_N x_N\|_{\infty} + \sum_{k=0}^{N-1} \left( \|Q x_k\|_{\infty} + \|R u_k\|_{\infty} \right).
\]</span></p>
</span></p>
</section>
</section>
<section id="optimization-problem" class="level2">
<h2 class="anchored" data-anchor-id="optimization-problem">Optimization problem</h2>
<p>Combining the cost function with the MLD model, and perhaps we some extra constraints imposed on the control inputs as well as state variables, we get <span class="math display">\[
<p>Combining the cost function with the MLD model, and perhaps we some extra constraints imposed on the control inputs as well as state variables, we get <span class="math display">
\operatorname*{minimize}_{u_0, u_1, \ldots, u_{N-1}} J_0(x(0),(u_0, u_1, \ldots, u_{N-1}))
\]</span></p>
<p>subject to <span class="math display">\[
</span></p>
<p>subject to <span class="math display">
\begin{aligned}
x_{k+1} &amp;= Ax_k + B_u u_k + B_\delta\delta_k + B_z z_k + B_0\\
y_k &amp;= Cx_k + D_u u_k + D_\delta \delta_k + D_z z_k + D_0\\
Expand All @@ -675,7 +689,7 @@ <h2 class="anchored" data-anchor-id="optimization-problem">Optimization problem<
P x_N &amp;\leq r \\
x_0 &amp;= x(0)
\end{aligned}
\]</span></p>
</span></p>


</section>
Expand Down
Loading

0 comments on commit 8c0767f

Please sign in to comment.