Hallo! Tracked shipping to Netherlands with Delivery Duty Paid for just €7 

Ship to
Netherlands
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Agent Coordination Mechanisms for Solving a Partitioning Task
Type
Physical Book
Publisher
Author
Language
English
Pages
201
Format
Paperback
ISBN13
9783832514839

Agent Coordination Mechanisms for Solving a Partitioning Task

Andreas Goebels (Author) · Logos Verlag · Paperback

Agent Coordination Mechanisms for Solving a Partitioning Task - Andreas Goebels

New Book Imported to Netherlands
Delivery: 14 Oct - 19 Oct Shipping: 13 to 15 business days.
€ 85,21
Import costs and 9% BTW included in the price ✅
€ 85,21

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Agent Coordination Mechanisms for Solving a Partitioning Task"

Multi Agent Systems and Swarm Intelligence are two recent and very promising topics in current computer science research. Swarm intelligence deals with large sets of individuals or agents that are regarded as a self-organizing system showing emergent behaviour. Ideas from biology are often and successfully applied to (optimization) problems in the computer science area. Nature provides several examples of complex architectures that are created by very simple insects with highly limited abilities. These insects live in social colonies and coordinate their actions by a concept called stigmergy. A frequently occurring question when designing multi agent or swarm systems that are (partly) inspired by natural examples is how to coordinate a large group of individuals or instances. This matter is closely connected with the question about the essential characteristics and parameters for both the whole system and each single agent. This thesis deals with these fundamental questions of multi agent and swarm intelligence systems. It presents several approaches for the different problems that might arise during system design. As background for all these approaches, a complex optimization problem has been chosen. The Online Partitioning Problem (OPP) addresses the uniform distribution of a group of agents onto targets under several restrictions, i.e. distance minimization and feature restriction. It is intriguing because it is easy to state but often very difficult to solve. Using such a reference problem allows us to compare the single approaches with each other. Though the presented new approaches deal only with this OPP, most of them can easily be adapted to other problems or are general concepts.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews