<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[youxia23的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/youxia23</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; youxia23]]></copyright><item><title><![CDATA[Path Planning]]></title><link>https://blog.youkuaiyun.com/youxia23/article/details/140619560</link><guid>https://blog.youkuaiyun.com/youxia23/article/details/140619560</guid><author>youxia23</author><pubDate>Wed, 24 Jul 2024 20:12:13 +0800</pubDate><description><![CDATA[Optimal path planning refers to find the collision free, shortest, and smooth route between start and goal positions.        Considering different  applications and constraints of robots, optimal criteria could be based on one or more conditions such as sh]]></description><category></category></item><item><title><![CDATA[Academic Writting]]></title><link>https://blog.youkuaiyun.com/youxia23/article/details/139684143</link><guid>https://blog.youkuaiyun.com/youxia23/article/details/139684143</guid><author>youxia23</author><pubDate>Fri, 14 Jun 2024 16:20:31 +0800</pubDate><description><![CDATA[academic writting  
introduction related work connection]]></description><category></category></item></channel></rss>