Probabilistic-based scheduling for runtime goal sequence of agents
Goal selection is very important in agent research. Many existing solutions are based on the static plans or predefined goal structures. This paper studies the problem and proposes a novel approach to scheduling goal sequence in goal-oriented agent systems. The proposed approach provides a unified p...
Saved in:
| Main Authors: | , , , |
|---|---|
| 其他作者: | |
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2013
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/97619 http://hdl.handle.net/10220/13190 http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=6272999&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6272999 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Goal selection is very important in agent research. Many existing solutions are based on the static plans or predefined goal structures. This paper studies the problem and proposes a novel approach to scheduling goal sequence in goal-oriented agent systems. The proposed approach provides a unified probabilistic framework for building the Goal-oriented agents and a run-time policy for scheduling the goal sequence to enable agents to have a more engaging experience in a dynamic environment. Statistical analysis of the experiment on an interactive educational game shows that the proposed approach improves the effectiveness of the assistant agents in the game and promotes diffusion of the curiosity and challenge levels. |
|---|