Sciweavers

297 search results - page 40 / 60
» Planning Partially for Situated Agents
Sort
View
AAAI
2006
15 years 7 months ago
Point-based Dynamic Programming for DEC-POMDPs
We introduce point-based dynamic programming (DP) for decentralized partially observable Markov decision processes (DEC-POMDPs), a new discrete DP algorithm for planning strategie...
Daniel Szer, François Charpillet
ACMICEC
2004
ACM
107views ECommerce» more  ACMICEC 2004»
15 years 11 months ago
Reasoning about commitments in multiple concurrent negotiations
Automated negotiation by software agents is a key enabling technology for agent mediated e-commerce. To this end, this paper considers an important class of such negotiations — ...
Thuc Duong Nguyen, Nicholas R. Jennings
AI
2005
Springer
15 years 6 months ago
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...
Richard J. Wallace, Eugene C. Freuder
AIPS
2000
15 years 7 months ago
Representations of Decision-Theoretic Planning Tasks
Goal-directed Markov Decision Process models (GDMDPs) are good models for many decision-theoretic planning tasks. They have been used in conjunction with two different reward stru...
Sven Koenig, Yaxin Liu
ATAL
2007
Springer
16 years 7 days ago
Subjective approximate solutions for decentralized POMDPs
A problem of planning for cooperative teams under uncertainty is a crucial one in multiagent systems. Decentralized partially observable Markov decision processes (DECPOMDPs) prov...
Anton Chechetka, Katia P. Sycara