In this provocative book, Barwise and Perry tackle the slippery subject of \"meaning, \" a subject that has long vexed linguists, language philosophers, and logicians.

/pdf/situations-and-attitudes-57f065zg2d.pdf

Situations and Attitudes.

Human-Robot Interaction (HRI) has recently received considerable attention in the academic community, in labs, in technology companies, and through the media. Because of this attention, it is desirable to present a survey of HRI to serve as a tutorial to people outside the field and to promote discussion of a unified vision of HRI within the field. The goal of this review is to present a unified treatment of HRI-related problems, to identify key themes, and discuss challenge problems that are likely to shape the field in the near future. Although the review follows a survey structure, the goal of presenting a coherent "story" of HRI means that there are necessarily some well-written, intriguing, and influential papers that are not referenced. Instead of trying to survey every paper, we describe the HRI story from multiple perspectives with an eye toward identifying themes that cross applications. The survey attempts to include papers that represent a fair cross section of the universities, government efforts, industry labs, and countries that contribute to HRI, and a cross section of the disciplines that contribute to the field, such as human, factors, robotics, cognitive psychology, and design.

/pdf/human-robot-interaction-a-survey-4q8yi606a9.pdf

Human-Robot Interaction: A Survey

Despite more than a decade of experimental work in multi-robot systems, important theoretical aspects of multi-robot coordination mechanisms have, to date, been largely untreated. To address this issue, we focus on the problem of multi-robot task allocation (MRTA). Most work on MRTA has been ad hoc and empirical, with many coordination architectures having been proposed and validated in a proof-of-concept fashion, but infrequently analyzed. With the goal of bringing objective grounding to this important area of research, we present a formal study of MRTA problems. A domain-independent taxonomy of MRTA problems is given, and it is shown how many such problems can be viewed as instances of other, well-studied, optimization problems. We demonstrate how relevant theory from operations research and combinatorial optimization can be used for analysis and greater understanding of existing approaches to task allocation, and show how the same theory can be used in the synthesis of new approaches.

/pdf/a-formal-analysis-and-taxonomy-of-task-allocation-in-multi-37udlnz144.pdf

A Formal Analysis and Taxonomy of Task Allocation in Multi-Robot Systems

Adopt: asynchronous distributed constraint optimization with quality guarantees

Many researchers have demonstrated that the organizational design employed by an agent system can have a significant, quantitative effect on its performance characteristics A range of organizational strategies have emerged from this line of research, each with different strengths and weaknesses In this article we present a survey of the major organizational paradigms used in multi-agent systems These include hierarchies, holarchies, coalitions, teams, congregations, societies, federations, markets, and matrix organizations We will provide a description of each, discuss their advantages and disadvantages, and provide examples of how they may be instantiated and maintained This summary will facilitate the comparative evaluation of organizational styles, allowing designers to first recognize the spectrum of possibilities, and then guiding the selection of an appropriate organizational design for a particular domain and environment

https://cse.unl.edu/~lksoh/Classes/CSCE990AMAS_Spring13/Seminar04.pdf

A survey of multi-agent organizational paradigms

Several research groups have grappled with the problem of characterizing and developing practical approaches for implementing adjustable autonomy and mixed-initiative interaction in deployed systems. However, each group takes a little different approach and uses variations of the same terminology in a somewhat different fashion. In this chapter, we will describe some common dimensions in an effort to better understand these important but ill-characterized topics. We are developing a formalism and implementation of these concepts as part of the KAoS framework in the context of our research on policy-governed autonomous systems.

/pdf/dimensions-of-adjustable-autonomy-and-mixed-initiative-38xn1iosos.pdf

Dimensions of adjustable autonomy and mixed-initiative interaction

In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as disaster rescue, hospital scheduling and the domain described in this paper: distributed sensor networks. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem and a general solution strategy are missing. This paper takes a step towards this goal by proposing a formalization of distributed resource allocation that represents both dynamic and distributed aspects of the problem and a general solution strategy that uses distributed constraint satisfaction techniques. This paper defines the notion of Dynamic Distributed Constraint Satisfaction Problem (DyDCSP) and proposes two generalized mappings from distributed resource allocation to DyDCSP, each proven to correctly perform resource allocation problems of specific difficulty and this theoretical result is verified in practice by an implementation on a real-world distributed sensor network.

A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation

Conflict resolution is a critical problem in distributed and collaborative multi-agent systems. Negotiation via argumentation (NVA), where agents provide explicit arguments or justifications for their proposals for resolving conflicts, is an effective approach to resolve conflicts. Indeed, we are applying argumentation in some real-world multi-agent applications. However, a key problem in such applications is that a well-understood computational model of argumentation is currently missing, making it difficult to investigate convergence and scalability of argumentation techniques, and to understand and characterize different collaborative NVA strategies in a principled manner. To alleviate these difficulties, we present distributed constraint satisfaction problem (DCSP) as a computational model for investigating NVA. We model argumentation as constraint propagation in DCSP. This model enables us to study convergence properties of argumentation, and formulate and experimentally compare 16 different NVA strategies with different levels of agent cooperativeness towards others. One surprising result from our experiments is that maximizing cooperativeness is not necessarily the best strategy even in a completely cooperative environment. The paper illustrates the usefulness of these results in applying NVA to multi-agent systems, as well as to DCSP systems in general.

Argumentation as distributed constraint satisfaction: applications and results

Dimensions of adjustable autonomy and mixed-initiative-interaction

In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed sensor networks, disaster rescue, hospital scheduling and others. Despite the variety of approaches proposed for distributed resource allocation, a systematic formalization of the problem, explaining the different sources of difficulties, and a formal explanation of the strengths and limitations of key approaches is missing. We take a step towards this goal by proposing a formalization of distributed resource allocation that represents both dynamic and distributed aspects of the problem. We define four categories of difficulties of the problem. To address this formalized problem, the paper defines the notion of Dynamic Distributed Constraint Satisfaction Problem (DyDCSP). The central contribution of the paper is a generalized mapping from distributed resource allocation to DyDCSP. This mapping is proven to correctly perform resource allocation problems of specific difficulty. This theoretical result is verified in practice by an implementation on a real-world distributed sensor network.

Shriniwas Kulkarni

Papers

Dimensions of adjustable autonomy and mixed-initiative interaction

A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation

Argumentation as distributed constraint satisfaction: applications and results

Dimensions of adjustable autonomy and mixed-initiative-interaction

Dynamic distributed resource allocation: A distributed constraint Satisfaction approach