- We will send in 10–14 business days.
/images/books/7107171/9781249595021.jpg)
- Author: Kevin Cousin
- Publisher: BiblioScholar
- ISBN-10: 1249595029
- ISBN-13: 9781249595021
- Format: 18.9 x 24.6 x 1.2 cm, minkšti viršeliai
- Language: English
- SAVE -10% with code: EXTRA
A Unified Framework for Solving Multiagent Task Assignment Problems (e-book) (used book) | bookbook.eu
Reviews
Description
This research presents a unified approach to representing and solving the multiagent task assignment problem for complex problem domains using ideas central to multiagent task allocation, project scheduling, constraint satisfaction, and coalition formation, forming the basis of the constrained multiagent task scheduling (CMTS) problem. The CMTS descriptor represents a wide range of classical and modern problems, such as job shop scheduling, the traveling salesman problem, vehicle routing, and cooperative multi-object tracking. Problems using the CMTS representation are solvable by a suite of algorithms ranging from simple random scheduling to state-of-the-art biologically inspired approaches incorporating evolutionary algorithms, dynamic coalition formation, auctioning, and behavior-based robotics to highlight different solution generation strategies.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 22d.05:37:57
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Kevin Cousin
- Publisher: BiblioScholar
- ISBN-10: 1249595029
- ISBN-13: 9781249595021
- Format: 18.9 x 24.6 x 1.2 cm, minkšti viršeliai
- Language: English English
This research presents a unified approach to representing and solving the multiagent task assignment problem for complex problem domains using ideas central to multiagent task allocation, project scheduling, constraint satisfaction, and coalition formation, forming the basis of the constrained multiagent task scheduling (CMTS) problem. The CMTS descriptor represents a wide range of classical and modern problems, such as job shop scheduling, the traveling salesman problem, vehicle routing, and cooperative multi-object tracking. Problems using the CMTS representation are solvable by a suite of algorithms ranging from simple random scheduling to state-of-the-art biologically inspired approaches incorporating evolutionary algorithms, dynamic coalition formation, auctioning, and behavior-based robotics to highlight different solution generation strategies.
Reviews