In this paper we examine the case of a mobile robot that is part of a human-robot urban search and rescue (USAR) team. During USAR scenarios, we would like the robot to have a geometrical-functional understand- ing of space, using which it can infer where to perform planned tasks in a manner that mimics human behav- ior. We assess the situation awareness of rescue work- ers during a simulated USAR scenario and use this as an empirical basis to build our robot’s spatial model. Based upon this spatial model, we present “functional map- ping” as an approach to identify regions in the USAR environment where planned tasks are likely to be opti- mally achievable. The system is deployed and evaluated in a simulated rescue scenario.

This paper describes an attempt to provide more intelligence to industrial robotics and automation systems. We develop an architecture to integrate disparate knowledge representations used in different places in robotics and automation. This knowledge integration framework, a possibly distributed entity, abstracts the components used in design or production as data sources, and provides a uniform access to them via standard interfaces. Representation is based on the ontology formalizing the process, product and resource triangle, where skills are considered the common element of the three. Production knowledge is being collected now and a preliminary version of KIF undergoes verification.

In all of these problems, we have limited be done; yet these are large-scale interdisciplinary research security resources which prevent full security coverage challenges that call upon multiagent researchers to work at all times; instead, limited security resources must be deployed with researchers in other disciplines, be "on the ground" intelligently taking into account differences in priorities with domain experts, and examine real-world constraints of targets requiring security coverage, the responses of and challenges that cannot be abstracted away. Together as the adversaries to the security posture and potential uncertainty an international community of multiagent researchers, we over the types, capabilities, knowledge and priorities can accomplish more! of adversaries faced.

Traditional social science research has been unable to satisfactorily aggregate individual level data to group, organization and systems levels, making it one of social science’s biggest challenges (Giles, 2011). For game and social theory, we believe that the fault can be attributed to the lack of valid distance measures (e.g., the arbitrary ordering of cooperation and competition precludes a Hilbert space distance metric for the ordering of and gradations between these social behaviors, making game theory normative). Alternatively, we offer a theory of social interdependence with countable mathematics based on bistable or multi-stable perspectives and linear algebra. The evidence that is available is supportive. It indicates that meaning is a one-sided, stable, classical interpretation, not only making the correspondence between beliefs and objective reality in social settings incomplete, raising questioning about static theories from earlier eras (i.e., Axelrod’s evolution of cooperation; Simon’s bounded rationality). The result indicates for open systems (democracies) that interpretations evolve naturally to become orthogonal (Nash equilibria), that orthogonal interpretations generate the information to drive social evolution, but that in closed systems (dictatorships), dependent on the enforcement of social cooperation and the suppression of opposing points of view, evolution slows or stops (e.g., China, Iran or Cuba), causing capital and energy to be wasted, misdirected or misallocated as leaders suppress the interpretations that they alone have the authority to label as unethical, immoral, or irreligious. We conclude that a mathematics based on NE is feasible.

We present a statistical physics inspired approach to modeling, analysis, and design of distributed aggregation control policies for teams of homogeneous and heterogeneous robots. We assume high-level agent behavior can be described as a sequential composition of lower-level behavioral primitives. Aggregation or division of the collective into distinct clusters is achieved by developing a macroscopic description of the ensemble dynamics. The advantages of this approach are twofold: 1) the derivation of a low dimensional but highly predictive description of the collective dynamics and 2) a framework where interaction uncertainties between the low-level components can be explicitly modeled and control. Additionally, classical dynamical systems theory and control theoretic techniques can be used to analyze and shape the collective dynamics of the system. We consider the aggregation problem for homogeneous agents into clusters located at distinct regions in the workspace and discuss the extension to heterogeneous teams of autonomous agents. We show how a macroscopic model of the aggregation dynamics can be derived from agent-level behaviors and discuss the synthesis of distributed coordination strategies in the presence of uncertainty.

This would allow teams to have an objective currency for trust transactions. These systems would allow another surface for autonomous Ali, A.S., Rana, O., and Walker, D.W. (2004): "WS-QoC: agents to integrate the social fabric with information Measuring Quality of Service Compliance," International gathered in virtual environments. Further, the system would Conference on Service Oriented Computing (ICSOC04), New increase illumination of dark networks engaged in illicit York, NY. covert activity. Participants would be assigned a score Allbeck, J., and Badler, N. (2002): "Toward Representing Agent similar to FICO scores; when an individual score falls Behaviors Modified by Personality and Emotion," Autonomous noticeably or falls below a threshold, further observation Agents and Multiagent Systems, Bologna, Italy.

Nexus Network Learner is an intelligent agent based simulation used to study Irregular Warfare (IW) in several major studies at the Department of Defense (DoD). Heterogeneous autonomous agents, each with their own separated inductive learning mechanism, have initial attributes and behaviors in proportion to demographic groups in the simulated population, and learn new behaviors as they serve culturally based goals. Nexus agents create a dynamic role-based network, and learn how to choose partners as well as what behaviors they should have with their network partners. As Nexus agents coevolve, nexus models the emergence of social institutions from individual behaviors, the fundamental social aggregation challenge. Nexus models the formation of learned vicious and virtuous cycles of behavior, some of which have higher average utility for the agents than others, and can be used to test the effects of interventions on the natural motivation-based system. An experiment is presented that uses Nexus to model the vicious cycle of corruption in an African country, from the first Irregular Warfare Analytical baseline at the Office of the Secretary of Defense (Messer 2009).

This work is about diagrammatic languages, how they can be represented, and what they in turn can be used to represent. More specifically, it focuses on representations and applications of string diagrams. String diagrams are used to represent a collection of processes, depicted as "boxes" with multiple (typed) inputs and outputs, depicted as "wires". If we allow plugging input and output wires together, we can intuitively represent complex compositions of processes, formalised as morphisms in a monoidal category. [...] The first major contribution of this dissertation is the introduction of a discretised version of a string diagram called a string graph. String graphs form a partial adhesive category, so they can be manipulated using double-pushout graph rewriting. Furthermore, we show how string graphs modulo a rewrite system can be used to construct free symmetric traced and compact closed categories on a monoidal signature. The second contribution is in the application of graphical languages to quantum information theory. We use a mixture of diagrammatic and algebraic techniques to prove a new classification result for strongly complementary observables. [...] We also introduce a graphical language for multipartite entanglement and illustrate a simple graphical axiom that distinguishes the two maximally-entangled tripartite qubit states: GHZ and W. [...] The third contribution is a description of two software tools developed in part by the author to implement much of the theoretical content described here. The first tool is Quantomatic, a desktop application for building string graphs and graphical theories, as well as performing automated graph rewriting visually. The second is QuantoCoSy, which performs fully automated, model-driven theory creation using a procedure called conjecture synthesis.

We propose a solution to the image deconvolution problem where the convolution kernel or point spread function (PSF) is assumed to be only partially known. Small perturbations generated from the model are exploited to produce a few principal components explaining the PSF uncertainty in a high dimensional space. Unlike recent developments on blind deconvolution of natural images, we assume the image is sparse in the pixel basis, a natural sparsity arising in magnetic resonance force microscopy (MRFM). Our approach adopts a Bayesian Metropolis-within-Gibbs sampling framework. The performance of our Bayesian semi-blind algorithm for sparse images is superior to previously proposed semi-blind algorithms such as the alternating minimization (AM) algorithm and blind algorithms developed for natural images. We illustrate our myopic algorithm on real MRFM tobacco virus data.

We propose a dynamic logic of lying, wherein a 'lie that phi' (where phi is a formula in the logic) is an action in the sense of dynamic modal logic, that is interpreted as a state transformer relative to the formula phi. The states that are being transformed are pointed Kripke models encoding the uncertainty of agents about their beliefs. Lies can be about factual propositions but also about modal formulas, such as the beliefs of other agents or the belief consequences of the lies of other agents. We distinguish (i) an outside observer who is lying to an agent that is modelled in the system, from (ii) one agent who is lying to another agent, and where both are modelled in the system. For either case, we further distinguish (iii) the agent who believes everything that it is told (even at the price of inconsistency), from (iv) the agent who only believes what it is told if that is consistent with its current beliefs, and from (v) the agent who believes everything that it is told by consistently revising its current beliefs. The logics have complete axiomatizations, which can most elegantly be shown by way of their embedding in what is known as action model logic or the extension of that logic to belief revision.