REVIEW 3 cited by
Plansformer: Generating Symbolic Plans using Transformers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Large Language Models (LLMs) have been the subject of active research, significantly advancing the field of Natural Language Processing (NLP). From BERT to BLOOM, LLMs have surpassed state-of-the-art results in various natural language tasks such as question answering, summarization, and text generation. Many ongoing efforts focus on understanding LLMs' capabilities, including their knowledge of the world, syntax, and semantics. However, extending the textual prowess of LLMs to symbolic reasoning has been slow and predominantly focused on tackling problems related to the mathematical field. In this paper, we explore the use of LLMs for automated planning - a branch of AI concerned with the realization of action sequences (plans) to achieve a goal, typically executed by intelligent agents, autonomous robots, and unmanned vehicles. We introduce Plansformer; an LLM fine-tuned on planning problems and capable of generating plans with favorable behavior in terms of correctness and length with reduced knowledge-engineering efforts. We also demonstrate the adaptability of Plansformer in solving different planning domains with varying complexities, owing to the transfer learning abilities of LLMs. For one configuration of Plansformer, we achieve ~97% valid plans, out of which ~95% are optimal for Towers of Hanoi - a puzzle-solving domain.
Forward citations
Cited by 3 Pith papers
-
Symmetry-Aware Transformer Training for Automated Planning
A contrastive loss that aligns attention and hidden states between renamed copies helps transformers solve larger planning problems in some domains, but not all.
-
On Sample-Efficient Generalized Planning via Learned Transition Models
Goal-conditioned transition models with WL graph embeddings and symbolic successor decoding beat action-sequence transformers on extrapolation in Blocksworld, VisitAll, and Gripper, using far smaller models.
-
LLM-Powered Decentralized Generative Agents with Adaptive Hierarchical Knowledge Graph for Cooperative Planning
DAMCS combines an adaptive knowledge-graph memory with structured communication to let LLM agents cooperate in an open-world game, cutting the steps needed to reach a diamond goal.
Discussion (0). Continue with ORCID to comment.