Abstract — This paper addresses the problem of coordinating aerial and ground vehicles in tasks that involve exploration, identification of targets and maintaining a connected communication network. We focus on the problem of localizing vehicles in urban environments where GPS signals are often

implemented as

Ants colonies exhibit very interesting behaviours: even if a single ant only has simple capabilities, the behaviour of a whole ant colony is highly structured. This is the result of coordinated interactions. But, as communication possibilities among ants are very limited, interactions must be based

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

The paper proposes a number of models to examine through what mech-anisms a population of autonomous agents could arrive at a repertoire of perceptually grounded categories that is sufficiently shared to allow successful communication. The models are inspired by the main approaches to human

Abstract not found

this paper, however, won't make any reference to the special properties of DRSs, and so I'll be giving here a much more abstract characterization of SDRSs than usual. The advantage of this way of presenting things is that SDRS update becomes much simpler to state than usual (Asher 1996, Asher and Lascarides in press). So first let's look at the SDRS language in this more abstract setting. We're going to assume a base set of "microstructure" formulas or logical forms for clauses and then build in a discourse "macrostructure", following Asher and Fernando (1997). The microstructure formulas could be, ordinary formulas of predicate logic, dynamic semantic formulas or DRSs, though to handle the anaphoric phenomena that SDRT has addressed to date (Asher 1993, Lascarides and Asher 1993, Asher and Lascarides in press) some sort of dynamic microstructure would be needed.

In this talk we consider the role of common ground for some coordination problems in dialogue. There, we concentrate especially on the difference between explicit and implicit representations. A prototypical example for a coordination problem is the so-called coordinated attack problem 1: (1) Two

memories can be important in tasks that persist over time by allowing robots to ground their dialog and to refer efficiently to previous events. In this work, we define execution memory as the capability of saving interaction event information and recalling it for later use. We divide the problem into four

This paper is based on joint work with N.N