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

DOI10.2478/V10006-008-0037-4zbMath1178.90171OpenAlexW2143598536MaRDI QIDQ5324528

Silvana Petruseva

Publication date: 3 August 2009

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/207896

zbMATH Keywords

complexityplanningCAA neural networkconsequence programmingemotional agent

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Search theory (90B40) Neural networks for/in biological studies, artificial life and related topics (92B20)

Cites Work

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

This page was built for publication: Emotion Learning: Solving a Shortest Path Problem in an Arbitrary Deterministic Environment in Linear Time with an Emotional Agent