Comparison of the efficiency of two algorithms which solve the shortest path problem with an emotional agent

DOI10.2298/YJOR0602211PzbMath1265.68296OpenAlexW2029279207MaRDI QIDQ4899839

Silvana Petruseva

Publication date: 10 January 2013

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor0602211p

zbMATH Keywords

complexityadjacency matrixpolynomial timeexponential time

Mathematics Subject Classification ID

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

Related Items (1)

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

This page was built for publication: Comparison of the efficiency of two algorithms which solve the shortest path problem with an emotional agent