<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Towards High-Level Modelling in Automated Planning · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2412.06312/</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/2412.06312/feed.xml" rel="self" type="application/rss+xml" /><item><title>Towards High-Level Modelling in Automated Planning — mentioned by mzl</title><link>https://news.ycombinator.com/item?id=46189590</link><guid isPermaLink="false">urn:hackerpapers:mention:2412.06312:46189590</guid><pubDate>Mon, 08 Dec 2025 07:58:16 GMT</pubDate><description>&lt;p&gt;Fun article. The Rush Hour puzzle is quite fun when viewed as a planning problem. In standard PDDL the model becomes very messy. I like the extensions proposed in https://arxiv.org/abs/2412.06312v1 that makes the model intuitive.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2412.06312/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.AI</category></item></channel></rss>
