<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[wanzew的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/wanzew</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wanzew]]></copyright><item><title><![CDATA[lqr ilqr代码实例]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/130298824</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/130298824</guid><author>wanzew</author><pubDate>Fri, 21 Apr 2023 23:26:11 +0800</pubDate><description><![CDATA[print("LQR 控制增益：\n", K)print("iLQR 控制增益序列：")# 代价函数权重矩阵。# 代价函数权重矩阵。]]></description><category></category></item><item><title><![CDATA[lqr ilqr]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/130298775</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/130298775</guid><author>wanzew</author><pubDate>Fri, 21 Apr 2023 23:21:15 +0800</pubDate><description><![CDATA[iLQR 是一种迭代方法，用于求解非线性系统的最优控制问题。这使得 iLQR 能够解决非线性系统的最优控制问题，但结果可能只是局部最优。总之，LQR 和 iLQR 都是用于解决最优控制问题的方法，但 LQR 适用于线性和二次问题，而 iLQR 适用于非线性问题。iLQR 是一种迭代方法，需要通过多次迭代才能收敛到最优解。然而，iLQR 能够解决非线性问题，这是 LQR 无法解决的。LQR（线性二次调节器）和 iLQR（迭代线性二次调节器）都是用于解决最优控制问题的方法，但它们之间有一些关键区别。]]></description><category></category></item><item><title><![CDATA[00_公式]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/127180831</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/127180831</guid><author>wanzew</author><pubDate>Thu, 06 Oct 2022 11:06:06 +0800</pubDate><description><![CDATA[Markdown 公式指导手册]]></description><category></category></item><item><title><![CDATA[CPP17]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/127160534</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/127160534</guid><author>wanzew</author><pubDate>Tue, 04 Oct 2022 11:22:31 +0800</pubDate><description><![CDATA[Many of these descriptions and examples are taken from various resources (see [Acknowledgements](#acknowledgements) section) and summarized in my own words.]]></description><category></category></item><item><title><![CDATA[CPP14]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/127160520</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/127160520</guid><author>wanzew</author><pubDate>Tue, 04 Oct 2022 11:21:38 +0800</pubDate><description><![CDATA[Many of these descriptions and examples are taken from various resources (see [Acknowledgements](#acknowledgements) section) and summarized in my own words.]]></description><category></category></item><item><title><![CDATA[CPP20]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/126864078</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/126864078</guid><author>wanzew</author><pubDate>Thu, 15 Sep 2022 08:51:42 +0800</pubDate><description><![CDATA[C++20]]></description><category></category></item><item><title><![CDATA[4.凸优化问题]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/126375302</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/126375302</guid><author>wanzew</author><pubDate>Tue, 16 Aug 2022 22:04:24 +0800</pubDate><description><![CDATA[凸优化问题]]></description><category></category></item><item><title><![CDATA[Interfacing your NLP to Ipopt]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/126358341</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/126358341</guid><author>wanzew</author><pubDate>Tue, 16 Aug 2022 08:40:49 +0800</pubDate><description><![CDATA[Interfacing your NLP to Ipopt]]></description><category></category></item><item><title><![CDATA[无约束优化问题的最优性条件]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/126209008</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/126209008</guid><author>wanzew</author><pubDate>Sun, 07 Aug 2022 12:07:28 +0800</pubDate><description><![CDATA[无约束优化问题的最优性条件]]></description><category></category></item><item><title><![CDATA[Eigen 学习文档: 高级初始化]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/125704132</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/125704132</guid><author>wanzew</author><pubDate>Sun, 10 Jul 2022 11:57:30 +0800</pubDate><description><![CDATA[本节讨论几种用于初始化矩阵的高级方法。它提供了有关之前介绍的逗号初始化器的更多详细信息。它还解释了如何获得特殊矩阵，例如单位矩阵和零矩阵]]></description><category></category></item><item><title><![CDATA[Eigen 学习文档: 切片和索引]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/125703765</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/125703765</guid><author>wanzew</author><pubDate>Sun, 10 Jul 2022 11:24:16 +0800</pubDate><description><![CDATA[`operator()`索引行和列的子集所提供的众多可能性。此 API 已在 Eigen 3.4 中引入。它支持块 API提出的所有功能。特别是，它支持**切片**，包括获取一组行、列或元素，在矩阵内均匀分布或从索引数组索引...]]></description><category></category></item><item><title><![CDATA[Eigen 学习文档: 块操作]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/125703046</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/125703046</guid><author>wanzew</author><pubDate>Sun, 10 Jul 2022 10:32:24 +0800</pubDate><description><![CDATA[块是矩阵或阵列的矩形部分。块表达式既可以用作右值也可以用作左值。

与Eigen表达式一样，只要让编译器进行优化，这种抽象的运行时间成本为零。

]]></description><category></category></item><item><title><![CDATA[Eigen 学习文档: Array类 和元素操作]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/125702140</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/125702140</guid><author>wanzew</author><pubDate>Sun, 10 Jul 2022 09:12:18 +0800</pubDate><description><![CDATA[Eigen 学习文档: Array类 和元素操作
本节旨在提供有关如何使用Eigen的Array类的概述和解释。]]></description><category></category></item><item><title><![CDATA[Eigen 学习文档: 矩阵和向量运算]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/125700562</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/125700562</guid><author>wanzew</author><pubDate>Sat, 09 Jul 2022 23:29:18 +0800</pubDate><description><![CDATA[Eigen 学习文档: 矩阵和向量运算]]></description><category></category></item><item><title><![CDATA[Eigen 学习文档: Matrix 类]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/125699104</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/125699104</guid><author>wanzew</author><pubDate>Sat, 09 Jul 2022 21:29:20 +0800</pubDate><description><![CDATA[Eigen 学习文档]]></description><category></category></item><item><title><![CDATA[Eigen 学习文档]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/125698116</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/125698116</guid><author>wanzew</author><pubDate>Sat, 09 Jul 2022 20:04:14 +0800</pubDate><description><![CDATA[This is the API documentation for Eigen3]]></description><category></category></item><item><title><![CDATA[include_directories和target_include_directories]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/125570620</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/125570620</guid><author>wanzew</author><pubDate>Sat, 02 Jul 2022 11:14:36 +0800</pubDate><description><![CDATA[include_directories和target_include_directories 区别]]></description><category></category></item><item><title><![CDATA[基于图的路径搜索算法(BFS Dijkstra A*)代码实现]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/120679744</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/120679744</guid><author>wanzew</author><pubDate>Sat, 09 Oct 2021 23:29:57 +0800</pubDate><description><![CDATA[BFS


template&lt;typename Location, typename Graph&gt;
std::unordered_map&lt;Location, Location&gt;
breadth_first_search(Graph graph, Location start) {
    std::queue&lt;Location&gt; frontier;
    frontier.push(start);

    std::unordered_map&lt;Location,]]></description><category></category></item><item><title><![CDATA[apt-get 安装没有自动依赖]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/120351695</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/120351695</guid><author>wanzew</author><pubDate>Fri, 17 Sep 2021 16:24:01 +0800</pubDate><description><![CDATA[问题：

apt-get install 不能自动安装依赖，安装新的包时，提示Unmet dependencies问题。


$ sudo apt-get install subversion
Reading package lists... Done
Building dependency tree       
Reading state information... Done
You might want to run 'apt-get -f install' to correct these:
Th]]></description><category></category></item><item><title><![CDATA[CMake学习笔记]]></title><link>https://blog.youkuaiyun.com/wanzew/article/details/120119055</link><guid>https://blog.youkuaiyun.com/wanzew/article/details/120119055</guid><author>wanzew</author><pubDate>Sun, 05 Sep 2021 18:38:08 +0800</pubDate><description><![CDATA[基础知识

CMake简介

CMake是一个开源的可扩展工具，用于独立于编译器的管理构建过程。CMake必须和本地构建系统联合使用，在每个源码目录中，需要编写CMakeLists.txt文件，以声明如何生成标准的构建文件（例如GNU Make的Makefiles，或者MSVS的解决方案）。

CMake支持所有平台的内部构建（in-source build）和外部构建（out-of-source build）。内部构建的源码目录和二进制目录为同一目录，即CMake会改变源码目录的内容。通过外部构建，可以针]]></description><category></category></item></channel></rss>