Moving containers in small terminal as STRIPS planning problem

Authors:
Adam Galuszka
Affiliations:
Institute of Automatic Control, Silesian University of Technology, Gliwice, Poland
Venue:
SMO'09 Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization
Year:
2009

Citing 12
Cited 1

Fuzzy sets, uncertainty, and information

Fuzzy sets, uncertainty, and information
Principles of artificial intelligence

Principles of artificial intelligence
A theoretical analysis of conjunctive-goal problems

Artificial Intelligence
On the complexity of blocks-world planning

Artificial Intelligence
The computational complexity of propositional STRIPS planning

Artificial Intelligence
Reaching agreements through argumentation: a logical model and implementation

Artificial Intelligence
Extending Graphplan to handle uncertainty and sensing actions

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Computational complexity of planning and approximate planning in the presence of incompleteness

Artificial Intelligence
Blocks World revisited

Artificial Intelligence
On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm

Journal of Artificial Intelligence Research
A critical assessment of benchmark comparison in planning

Journal of Artificial Intelligence Research
Mobile WiMAX systems: performance and evolution

IEEE Communications Magazine

Optimization of re-handling and load/unload operations in small container terminal operated by reachstackers

ICS'10 Proceedings of the 14th WSEAS international conference on Systems: part of the 14th WSEAS CSCC multiconference - Volume II

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper Block World environment with STRIPS representation is proposed to model the problem of loading and unloading containers in small container terminal in Gliwice, Poland. It is assumed that containers are represented by blocks and reachstackers are represented by robot arms. STRIPS planning with complete information is usually hard problem, very often at least NP-complete (e.g. optimal planning in Block World environment is NP-complete). To reduce this complexity a heuristic for sub-goal ordering is introduced.