Geodesic
Comparison of the Efficiency of Two Algorithms Which Solve the Shortest Path Problem With an Emotional Agent
Yugoslav journal of operations research, Tome 16 (2006) no. 2, p. 211 .

Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts

This paper discusses the comparison of the efficiency of two algorithms, by estimation of their complexity. For solving the problem, the Neural Network Crossbar Adaptive Array (NN-CAA) is used as the agent architecture, implementing a model of an emotion. The problem discussed is how to find the shortest path in an environment with n states. The domains concerned are environments with n states, one of which is the starting state, one is the goal state, and some states are undesirable and they should be avoided. It is obtained that finding one path (one solution) is efficient, i.e. in polynomial time by both algorithms. One of the algorithms is faster than the other only in the multiplicative constant, and it shows a step forward toward the optimality of the learning process. However, finding the optimal solution (the shortest path) by both algorithms is in exponential time which is asserted by two theorems. It might be concluded that the concept of subgoal is one step forward toward the optimality of the process of the agent learning. Yet, it should be explored further on, in order to obtain an efficient, polynomial algorithm.
Keywords: Emotional agent, complexity, polynomial time, exponential time, adjacency matrix, shortest path. 
@article{YJOR_2006_16_2_a5,
     author = {Silvana Petruseva},
     title = {Comparison of the {Efficiency} of {Two} {Algorithms} {Which} {Solve} the {Shortest} {Path} {Problem} {With} an {Emotional} {Agent}},
     journal = {Yugoslav journal of operations research},
     pages = {211 },
     publisher = {mathdoc},
     volume = {16},
     number = {2},
     year = {2006},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/YJOR_2006_16_2_a5/}
}
TY  - JOUR
AU  - Silvana Petruseva
TI  - Comparison of the Efficiency of Two Algorithms Which Solve the Shortest Path Problem With an Emotional Agent
JO  - Yugoslav journal of operations research
PY  - 2006
SP  - 211 
VL  - 16
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/YJOR_2006_16_2_a5/
LA  - en
ID  - YJOR_2006_16_2_a5
ER  - 
%0 Journal Article
%A Silvana Petruseva
%T Comparison of the Efficiency of Two Algorithms Which Solve the Shortest Path Problem With an Emotional Agent
%J Yugoslav journal of operations research
%D 2006
%P 211 
%V 16
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/YJOR_2006_16_2_a5/
%G en
%F YJOR_2006_16_2_a5
Silvana Petruseva. Comparison of the Efficiency of Two Algorithms Which Solve the Shortest Path Problem With an Emotional Agent. Yugoslav journal of operations research, Tome 16 (2006) no. 2, p. 211 . http://geodesic.mathdoc.fr/item/YJOR_2006_16_2_a5/