HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
guicho271828
latplan
Python2019–2019
guicho271828 / latplan

latplan

LatPlan : A domain-independent, image-based classical planner

2Distinct people
2Mentions
0Explicit recommenders
88GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

LatPlan : A domain-independent, image-based classical planner

GitHub

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 9–Nov 16 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/16/2026, 7:27:27 AM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by day2 dated mentions

Observed mentions: 2019-05-14 05:02:10 UTC to 2019-06-02 00:07:52 UTC.

012019-05-14 00:00:00 UTC to 2019-05-15 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsMay 142019-05-15 00:00:00 UTC to 2019-05-16 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-16 00:00:00 UTC to 2019-05-17 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-17 00:00:00 UTC to 2019-05-18 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-18 00:00:00 UTC to 2019-05-19 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-19 00:00:00 UTC to 2019-05-20 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-20 00:00:00 UTC to 2019-05-21 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-21 00:00:00 UTC to 2019-05-22 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-22 00:00:00 UTC to 2019-05-23 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-23 00:00:00 UTC to 2019-05-24 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsMay 232019-05-24 00:00:00 UTC to 2019-05-25 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-25 00:00:00 UTC to 2019-05-26 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-26 00:00:00 UTC to 2019-05-27 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-27 00:00:00 UTC to 2019-05-28 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-28 00:00:00 UTC to 2019-05-29 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-29 00:00:00 UTC to 2019-05-30 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-30 00:00:00 UTC to 2019-05-31 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-05-31 00:00:00 UTC to 2019-06-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-06-01 00:00:00 UTC to 2019-06-02 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-06-02 00:00:00 UTC to 2019-06-03 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsJun 2

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
May 142019-05-14 00:00:00 UTC2019-05-15 00:00:00 UTC101
May 152019-05-15 00:00:00 UTC2019-05-16 00:00:00 UTC000
May 162019-05-16 00:00:00 UTC2019-05-17 00:00:00 UTC000
May 172019-05-17 00:00:00 UTC2019-05-18 00:00:00 UTC000
May 182019-05-18 00:00:00 UTC2019-05-19 00:00:00 UTC000
May 192019-05-19 00:00:00 UTC2019-05-20 00:00:00 UTC000
May 202019-05-20 00:00:00 UTC2019-05-21 00:00:00 UTC000
May 212019-05-21 00:00:00 UTC2019-05-22 00:00:00 UTC000
May 222019-05-22 00:00:00 UTC2019-05-23 00:00:00 UTC000
May 232019-05-23 00:00:00 UTC2019-05-24 00:00:00 UTC000
May 242019-05-24 00:00:00 UTC2019-05-25 00:00:00 UTC000
May 252019-05-25 00:00:00 UTC2019-05-26 00:00:00 UTC000
May 262019-05-26 00:00:00 UTC2019-05-27 00:00:00 UTC000
May 272019-05-27 00:00:00 UTC2019-05-28 00:00:00 UTC000
May 282019-05-28 00:00:00 UTC2019-05-29 00:00:00 UTC000
May 292019-05-29 00:00:00 UTC2019-05-30 00:00:00 UTC000
May 302019-05-30 00:00:00 UTC2019-05-31 00:00:00 UTC000
May 312019-05-31 00:00:00 UTC2019-06-01 00:00:00 UTC000
Jun 12019-06-01 00:00:00 UTC2019-06-02 00:00:00 UTC000
Jun 22019-06-02 00:00:00 UTC2019-06-03 00:00:00 UTC101

What Hacker News says

1 sources
i'm not familiar with the standards of reproducibility in computer science, but compared to many other disciplines, it should be trivial to release "research-quality" [+] source code or a vm/container image that allows others to more directly attempt to reproduce the results described in the paper. This paper's section on related work calls out a recent paper by Asai > Asai [1], whose paper was published while the present work was in progress, describes an architecture with some similarities to the PrediNet, but also some notable differences. For example, Asai’s architecture assumes an input representation in symbolic form where the objects have already been segmented. By contrast, in the present architecture, the input CNN and the PrediNet’s dot-product attention mechanism together learn what constitutes an object. re: [1], Asai's paper
Read the rest
: https://arxiv.org/abs/1902.08093 . Asai has released code for earlier papers on github: "LatPlan : A domain-independent, image-based classical planner". https://github.com/guicho271828/latplan it reads as if the code for [1] may be open-sourced in future "Asai, M.: 2019. Unsupervised Grounding of Plannable First-Order Logic Representation from Images (code not yet available) " [+] research-quality, i.e., in whatever random state the prototype code it happens to be in, without any guarantees about it compiling, or running, or behaving correctly, having an automated test suite, or whatever. in all of these cases, it is _technically_ trivial to make it available to the wider research community
In An Explicitly Relational Neural Network Architecture

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.