Exploring the Blocks World state space

In this article we study and evaluate combinatorial algorithms for exploring state spaces of prototypical artificial intelligence problems that are represented by very large state space graphs. We are interested in the modeling and analysis of such graphs, including their visualization and quantific...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Concurrency and computation Ročník 34; číslo 14
Hlavní autoři: Bădică, Amelia, Bădică, Costin, Buligiu, Ion, Ciora, Liviu Ion
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hoboken Wiley Subscription Services, Inc 25.06.2022
Témata:
Algorithms
Artificial intelligence
blocks world
combinatorial algorithm
Combinatorial analysis
graph visualization
Graphical representations
Graphs
Mathematical models
Problem solving
state space graph
ISSN:1532-0626, 1532-0634
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this article we study and evaluate combinatorial algorithms for exploring state spaces of prototypical artificial intelligence problems that are represented by very large state space graphs. We are interested in the modeling and analysis of such graphs, including their visualization and quantification. We consider Blocks World as a prototype artificial intelligence problem that is often employed to introduce problem solving strategies using searching, planning, and reasoning algorithms. Our results are mathematical models and combinatorial algorithms supporting the concise definition of the Blocks World state space graph, as well as the exact evaluation of several metrics defined on this graph, including its number of states, its average number of stacks per state, its number of transitions, and its average branching factor. We also present experimental results supporting the effectiveness and efficiency of our proposed algorithms.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1532-0626
1532-0634
DOI:10.1002/cpe.6472