Paper: SciPy Optimize and Reachability of Nonlinear Systems - #1116
Conversation
|
Curvenote Preview
|
|
Hi @iperezav thank you for creating a PR. A quick note - you still have some time to finish the draft but would you please update the title of the PR so that it'd be easy for the Proceedings committee to track the paper using the title as well? Thanks. |
rowanc1
added
paper
There was a problem hiding this comment.
Hi @sanhitamj, thanks I just changed the title to the same of the conference.
iperezav
changed the title
|
Inviting reviewers: @iloekwe and @siri.varma@outlook.com |
|
@cdlindsey will serve as editor for this paper. |
|
Hi @fwkoch, how can I do to show the references in alphabetical order, instead of order of in order of creation? |
|
Hello. How is it going? I am Jennifer Iloekwe. The reviewer for your paper. Let me what I can you with? |
|
Hi @iperezav. How is it going. Can you please share the draft of your full paper? I am unable to access it. Thank you |
|
Hi @iloekwe, I'm traveling back home. I'll send you my paper in the next couple of days. I hope you enjoyed the conference. Best |
|
@iperezav No worries. I will be expecting the paper. I hope you had a safe trip back. |
|
Hi @iloekwe, I'm attaching the pdf version of my paper. I think it'd be better if you can see it on myst but I don't know how to share it that way. Please let me know if you know. |
|
Hello @cdlindsey, I hope your day is going great. I was wondering if I Jennifer Iloekwe is my only reviewer or is there another reviewer. |
|
Hi @fwkoch, what's the best way to share my paper with the reviewers? Just as a pdf? Can they see it in a webpage like when I run myst start? I'm still learning GitHub. |
| year = {2024}, | ||
| pages = {}, | ||
| title = {Adaptive Optimal Control of Continuous-Time Nonlinear Systems via Hybrid Iteration: An Adaptive Dynamic Programming Approach}, | ||
| } |
There was a problem hiding this comment.
Try this for the doi, https://doi.org/10.1016/j.automatica.2023.111261
| booktitle = {}, | ||
| year = {2024}, | ||
| pages = {}, | ||
| title = {Efficient and Guaranteed Hamilton–Jacobi Reachability via Self-Contained Subsystem Decomposition and Admissible Control Sets}, |
There was a problem hiding this comment.
try this for the doi, https://doi.org/10.1109/LCSYS.2023.3344659
There was a problem hiding this comment.
Thank you @iperezav for sharing your paper. I will review today and send back to you.
|
Thank you @iperezav for sharing your completed paper. I have reviewed the paper. Find my review feedback in the attached document. |
| In this paper, CFSpy a package in Python that numerically computes Chen-Fliess series | ||
| is presented. The reachable sets of non-linear systems are also | ||
| calculated with this package. The method used obtains batches of iterative integrals | ||
| of the same length instead one at a time. For this, we consider the alphabetical |
There was a problem hiding this comment.
"instead one at a time" to "instead of one at a time"
| integral reading the index word in the opposite direction from right | ||
| to left, we allow the broadcasting of the computation of the iterative | ||
| integral to all permutations of a length. Assuming the input | ||
| is sufficiently well approximated by piece-wise step functions in |
There was a problem hiding this comment.
maybe change piece-wise to piecewise, do you have a source that uses the older spelling of piece-wise?
| As we will see in [](#sec_results), to avoid computing the components of the Chen-Fliess series | ||
| one by one, this is, permutation by permutation, matrix operations such as the Kronecker product | ||
| to represent the stacking of two matrices and the elementwise multiplication or Hadamard product | ||
| are defined. |
There was a problem hiding this comment.
It is clearer to say "permutation by permutation, we can use matrix operations such as the Kronecker product to represent the stacking of two matrices and the Hadamard product for elementwise computation. "
| %a simplified unmanned aircraft vehicle (UAV) model is used to analyze the reachability of | ||
| %the system. | ||
|
|
||
| A Chen-Fliess (CFS) series provides a local representation of the output of |
|
|
||
| The CFS is indexed by words of any length. | ||
| Formally, these words are elements | ||
| of an algebraic structure called *free monoid* |
| the concatenation $s_1 s_2$ | ||
| then by the associativity $(s_1 s_2) s_3 = s_1 (s_2 s_3) = s_1 s_2 s_3$. Thus, | ||
| the operation $\cdot: S\times S \rightarrow S$ is referred to as *concatenation*. | ||
| The concatenation of finite number of elements of $S$ is called a *word*. |
There was a problem hiding this comment.
The concatenation of a finite number of
| ::: | ||
|
|
||
| The set of all power series $c$ is denoted $\mathbb{R}^\ell\langle \langle X\rangle \rangle$ and is extended to | ||
| an *algebra* structure by adding the the *shuffle* operator. |
| :::{prf:definition} | ||
| :label: def_liederiv | ||
|
|
||
| Given the system in [](#nonlinsys), the Lie derivative associated to the word $\eta \in X^*$ of the function $h:\mathbb{R}^n\rightarrow \mathbb{R}$ is the following: |
| ## Main Results | ||
|
|
||
| In the current section, the numerical computation of the Chen-Fliess series is addressed. | ||
| For this, the iterative integral and the Lie derivative are redefined to allow for |
| :label: def_newiterint | ||
|
|
||
| Consider the word $\eta = x_{i_1}\cdots x_{i_{r}} \in X^*$, the *backward* iterative integral | ||
| of $u\in L^p[0, T]$ associated to $\eta$ is the operator $H_{\eta}(\cdot)$ described |
|
I've added some comments. Just a few things to clear up. I enjoyed the paper. |
…he items in section 3.5, added more to the conclusions
|
Hi @iloekwe and @cdlindsey, I forgot to mention that I updated the paper according to your comments and you can check the paper again. |
fwkoch
added
approved
7 participants
If you are creating this PR in order to submit a draft of your paper, please name your PR with
Paper: <title>. An editor will then add adraftlabel; this will trigger GitHub Actions to run automated checks on your paper and build a preview. You may then work to resolve failed checks and ensure the preview build looks correct. If you have any questions, please tag the proceedings team in a comment on your PR with@scipy-conference/2025-proceedings.See the project readme for more information.