Forward chaining algorithm for solving the shortest path problem in arbitrary deterministic environment in linear time: applied for the tower of Hanoi problem

Authors:
Silvana Petruseva
Affiliations:
Mathematics Department, Faculty of Civil Engineering, St.Cyril and Methodius University, Skopje, Macedonia
Venue:
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Year:
2009

Citing 2
Cited 0

Introduction to Reinforcement Learning

Introduction to Reinforcement Learning
Emotion Learning: Solving a Shortest Path Problem in an Arbitrary Deterministic Environment in Linear Time with an Emotional Agent

International Journal of Applied Mathematics and Computer Science - Selected Problems of Computer Science and Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents an application of an algorithm which solves the shortest path problem in arbitrary deterministic environment in linear time, using OFF ROUTE acting method and emotional agent architecture. The complexity of the algorithm in general does not depend on the number of states n, but only on the length of the shortest path, in the worst case the complexity can be at most O(n). The algorithm is applied for the Tower of Hanoi problem.