Minimalism Distribution Supermodularity

نویسندگان

  • Bruce Randall Donald
  • James S. Jennings
  • Daniela Rus
چکیده

We have designed and implemented multi agent strategies for manipulation tasks by distributing mechanically based sequential algorithms across sev eral autonomous spatially separated agents such as mobile robots Our experience using mobile robots for the manipulation of large objects couches boxes le cabinets etc leads us to recommend a minimalist architecture for multi agent programming In particu lar our methodology has led us to derive asynchronous distributed strategies that require no direct communi cation between agents and very sparse geometric and dynamic models of the objects our robots manipulate We argue for a design principle called supermodu larity which is orthogonal both to the notion of modu larity in cognitive AI and also to horizontal decompo sition the non modularity advocated in the subsump tion connectionist literature Finally we discuss a simple mobot Scheme in frastructure to implement supermodular architectures In the past few years we have programmed many su permodular manipulation protocols and tested them ex tensively on our team of mobile robots We describe why we think the supermodular infrastructure results in robust simple readable manipulation strategies that can be recycled and reused

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supermodularity is not Falsifiable∗

Supermodularity has long been regarded as a natural notion of complementarities in individual decision making; it was introduced as such in the nineteenth century by Edgeworth and Pareto. But supermodularity is not an ordinal property. We study the ordinal content of assuming a supermodular utility, i.e. what it means for the individual’s underlying preferences. We show that supermodularity is ...

متن کامل

Supermodularizability *

We study the ordinal content of assuming supermodularity, including conditions under which a binary relation can be represented by a supermodular function. When applied to revealed-preference relations, our results imply that supermodularity is some times not refutable: Choices on consumption at different prices can be rationalized with a supermodular utility if they can be rationalized. Hence,...

متن کامل

Supermodularity and risk aversion

In this paper, we consider the relationship between supermodularity and risk aversion. We show that supermodularity of the certainty equivalent implies that the certainty equivalent of any random variable is less than its mean. We also derive conditions under which supermodularity of the certainty equivalent is equivalent to aversion to mean-preserving spreads in the sense of Rothschild and Sti...

متن کامل

Supermodularity and preferences

We uncover the complete ordinal implications of supermodularity on finite lattices under the assumption of weak monotonicity. In this environment, we show that supermodularity is ordinally equivalent to the notion of quasisupermodularity introduced by Milgrom and Shannon. We conclude that supermodularity is a weak property, in the sense that many preferences have a supermodular representation.

متن کامل

Exploiting Weak Supermodularity for Coalition-Proof Mechanisms

Under the incentive-compatible Vickrey-Clarke-Groves mechanism, coalitions of participants can influence the auction outcome to obtain higher collective profit. These manipulations were proven to be eliminated if and only if the market objective is supermodular. Nevertheless, several auctions do not satisfy the stringent conditions for supermodularity. These auctions include electricity markets...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Exp. Theor. Artif. Intell.

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1997