<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Topological complexity of motion planning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_0111197/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/math_0111197/feed.xml" rel="self" type="application/rss+xml" /><item><title>Topological complexity of motion planning — mentioned by lixtra</title><link>https://news.ycombinator.com/item?id=17772426</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0111197:17772426</guid><pubDate>Thu, 16 Aug 2018 06:37:11 GMT</pubDate><description>&lt;p&gt;I consider topology an important branch of mathematics. Morse theory[1] is very powerful to prove existence or non existence of solutions in other spaces of mathematics. I saw it applied to robot motion planning [2] (and could use that to prove to an engineer friend that the sort of algorithm he was looking for cannot exist), so yes it has practical real world applications. On the other hand I would be surprised to see data scientists apply cohomology in their daily work (citations?). Also while a short glimpse at your digit arithmetic gives me fun (i’m far from fully getting it that fast) I…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0111197/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.AT</category></item></channel></rss>
