Abstract
Autonomous agents are given the authority to select which actions they will execute. If the agent behaves rationally, the actions it selects will be in its own best interests. When addressing multiple goals, the rational action may not be obvious. Equipping the agents with decision-theoretic methods allows the agent to mathematically evaluate the risks, uncertainty, and benefits of the various available courses of action. Using this evaluation, an agent can determine which goals are worth achieving, as well as the order in which to achieve those goals. When the goals of the agent changes, the agent must replan to maintain rational decision-making. This research uses macro actions to transform the state space for the agent’s decision problem into the desire space of the agent. Reasoning in the desire space, the agent can efficiently maintain rationality in response to addition and removal of goals.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Wooldridge, M.: Reasoning about Rational Agents. The MIT Press, Cambridge (2000)
Bentahar, J., Moulin, B., Meyer, J.J.C., Chaib-Draa, B.: A computational model for conversation policies for agent communication. In: Leite, J., Torroni, P. (eds.) CLIMA 2004. LNCS (LNAI), vol. 3487, pp. 178–195. Springer, Heidelberg (2005)
Mancarella, P., Sadri, F., Terreni, G., Toni, F.: Planning partially for situated agents. In: Leite, J., Torroni, P. (eds.) CLIMA 2004. LNCS (LNAI), vol. 3487, pp. 230–248. Springer, Heidelberg (2005)
Alferes, J.J., Banti, F., Brogi, A.: From logic programs updates to action description updates. In: Leite, J., Torroni, P. (eds.) CLIMA 2004. LNCS (LNAI), vol. 3487, pp. 52–77. Springer, Heidelberg (2005)
Georgeff, M.P.: Planning. In: Allen, J., Hendler, J., Tate, A. (eds.) Readings in Planning, pp. 5–25. Morgan Kaufmann Publishers, San Mateo (1990)
desJardines, M.E., Durfee, E.H., Ortiz Jr., C.L., Wolverton, M.J.: A survey of research in distributed, continual planning. AI Magazine 20, 13–22 (1999)
Boutilier, C.: Planning, learning and coordination in multiagent decision processes. In: Theoretical Aspects of Rationality and Knowledge, Amsterdam, Netherlands, pp. 195–201 (1996)
Boutilier, C., Dean, T., Hanks, S.: Decision-theoretic planning: Structural assumptions and computational leverage. Journal of Artificial Intelligence Research 11, 1–94 (1999)
Sutton, R.S., Precup, D., Singh, S.P.: Between MDPs and semi-MDPs: A framework for temporal abstraction in reinforcement learning. Artificial Intelligence 112, 181–211 (1999)
Lane, T., Kaelbling, L.P.: Nearly deterministic abstractions of markov decision processes. In: Eighteenth National Conference on Artificial Intelligence (AAAI 2002), Edmonton, Alberta, Canada, pp. 260–266 (2002)
Gutin, G., Punnen, A.P. (eds.): The Traveling Salesman Problem and Its variations. Kluwer, Dordrecht (2002)
Satoh, K.: An application of global abduction to an information agent which modifies a plan upon failure- preliminary report. In: Leite, J., Torroni, P. (eds.) CLIMA 2004. LNCS (LNAI), vol. 3487, pp. 213–229. Springer, Heidelberg (2005)
Hauskrecht, M., Meuleau, N., Kaelbling, L.P., Dean, T., Boutilier, C.: Hierarchical solution of Markov decision processes using macro-actions. In: Uncertainty in Artificial Intelligence (UAI 1998), pp. 220–229 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Han, D.C., Barber, K.S. (2005). Desire-Space Analysis and Action Selection for Multiple Dynamic Goals. In: Leite, J., Torroni, P. (eds) Computational Logic in Multi-Agent Systems. CLIMA 2004. Lecture Notes in Computer Science(), vol 3487. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533092_15
Download citation
DOI: https://doi.org/10.1007/11533092_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28060-6
Online ISBN: 978-3-540-31857-6
eBook Packages: Computer ScienceComputer Science (R0)