<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[ROS中求解二次规划问题]]></title><description><![CDATA[<p dir="auto">ros里面有没有方法可以求解二次规划问题啊？</p>
]]></description><link>http://community.bwbot.org/topic/571/ros中求解二次规划问题</link><generator>RSS for Node</generator><lastBuildDate>Tue, 10 Nov 2026 02:45:01 GMT</lastBuildDate><atom:link href="http://community.bwbot.org/topic/571.rss" rel="self" type="application/rss+xml"/><pubDate>Fri, 07 Sep 2018 02:57:46 GMT</pubDate><ttl>60</ttl><item><title><![CDATA[Reply to ROS中求解二次规划问题 on Mon, 10 Sep 2018 12:11:44 GMT]]></title><description><![CDATA[<p dir="auto"><a class="plugin-mentions-user plugin-mentions-a" href="http://community.bwbot.org/uid/117">@rockyren</a> 非线性优化求解（包括二次规划类），可以用google的Ceres 库，http://ceres-solver.org/nnls_tutorial.html</p>
]]></description><link>http://community.bwbot.org/post/821</link><guid isPermaLink="true">http://community.bwbot.org/post/821</guid><dc:creator><![CDATA[xiaoqiang]]></dc:creator><pubDate>Mon, 10 Sep 2018 12:11:44 GMT</pubDate></item><item><title><![CDATA[Reply to ROS中求解二次规划问题 on Sun, 09 Sep 2018 03:21:56 GMT]]></title><description><![CDATA[<p dir="auto">我想在小车上使用模型预测算法来完成路径跟踪，但是这种算法需要在线求解一个二次规划问题，所以问问ROS里面是否由相关的库函数来求解</p>
]]></description><link>http://community.bwbot.org/post/820</link><guid isPermaLink="true">http://community.bwbot.org/post/820</guid><dc:creator><![CDATA[RockyRen]]></dc:creator><pubDate>Sun, 09 Sep 2018 03:21:56 GMT</pubDate></item><item><title><![CDATA[Reply to ROS中求解二次规划问题 on Sat, 08 Sep 2018 02:33:42 GMT]]></title><description><![CDATA[<p dir="auto"><a class="plugin-mentions-user plugin-mentions-a" href="http://community.bwbot.org/uid/117">@rockyren</a> 具体点呢</p>
]]></description><link>http://community.bwbot.org/post/811</link><guid isPermaLink="true">http://community.bwbot.org/post/811</guid><dc:creator><![CDATA[Yangoogle]]></dc:creator><pubDate>Sat, 08 Sep 2018 02:33:42 GMT</pubDate></item></channel></rss>