Abstract
This paper addresses the problem of computing the value of information in settings in which the people using an autonomous-agent system have access to information not directly available to the system itself. To know whether to interrupt a user for this information, the agent needs to determine its value. The fact that the agent typically does not know the exact information the user has and so must evaluate several alternative possibilities significantly increases the complexity of the value-of-information calculation. The paper addresses this problem as it arises in multi-agent task planning and scheduling with architectures in which information about the task schedule resides in a separate "scheduler" module. For such systems, calculating the value to overall agent performance of potential new information requires that the system component that interacts with the user query the scheduler. The cost of this querying and inter-module communication itself substantially affects system performance and must be taken into account. The paper provides a decision-theoretic algorithm for determining the value of information the system might acquire, query-reduction methods that decrease the number of queries the algorithm makes to the scheduler, and methods for ordering the queries to enable faster decision-making. These methods were evaluated in the context of a collaborative interface for an automated scheduling agent. Experimental results demonstrate the significant decrease achieved by using the query-reduction methods in the number of queries needed for reasoning about the value of information. They also show the ordering methods substantially increase the rate of value accumulation, enabling faster determination of whether to interrupt the user.
Original language | English |
---|---|
Pages (from-to) | 456-496 |
Number of pages | 41 |
Journal | Autonomous Agents and Multi-Agent Systems |
Volume | 26 |
Issue number | 3 |
DOIs | |
State | Published - May 2013 |
Bibliographical note
Funding Information:Acknowledgments The research reported in this paper was supported in part by contract number 55-000720, a subcontract to SRI International’s DARPA Contract No. FA8750-05-C-0033. Any opinions, findings and conclusions, or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of DARPA or the U.S. Government. Preliminary versions of the research reported in the paper appear in two conference papers [45,47]. We are grateful to Monira Sarne and Peter Owotoki for developing the experimental infrastructure, Willem-Jan van Hoeve for providing the constraint-based scheduler and support in its use, and Ben Lubin for insightful discussions and assistance in building an initial CI. Finally, we would like to thank the three anonymous reviewers for their valuable comments and suggestions to improve this paper.
Funding
Acknowledgments The research reported in this paper was supported in part by contract number 55-000720, a subcontract to SRI International’s DARPA Contract No. FA8750-05-C-0033. Any opinions, findings and conclusions, or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of DARPA or the U.S. Government. Preliminary versions of the research reported in the paper appear in two conference papers [45,47]. We are grateful to Monira Sarne and Peter Owotoki for developing the experimental infrastructure, Willem-Jan van Hoeve for providing the constraint-based scheduler and support in its use, and Ben Lubin for insightful discussions and assistance in building an initial CI. Finally, we would like to thank the three anonymous reviewers for their valuable comments and suggestions to improve this paper.
Funders | Funder number |
---|---|
Defense Advanced Research Projects Agency |
Keywords
- Adjustable autonomy
- Interruption management
- Value of information