A problem-decomposition method using differences or equivalence relations between states

DOI10.1016/0004-3702(85)90001-3zbMath0564.68064OpenAlexW2084699841MaRDI QIDQ1058310

Seizaburo Niizuma, Tadahiro Kitahashi

Publication date: 1985

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(85)90001-3

zbMATH Keywords

planningproblem decompositionGPSABSTRIPS

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

An optimal algorithm for Reve's puzzle ⋮ Formulating patterns in problem solving ⋮ Shortest paths between regular states of the Tower of Hanoi ⋮ Parallelism for multipeg towers of Hanoi

Cites Work

• Realization theory of continuous-time dynamical systems
• Planning in a hierarchy of abstraction spaces
• Mechanical Discovery of Classes of Problem-Solving Strategies
• Sufficient Conditions for the Success of GPS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A problem-decomposition method using differences or equivalence relations between states