HPA4CF · Collectiveware: Highly-parallel algorithms for collective intelligence
„Хоризонт 2020“ — Действия „Мария Склодовска-Кюри“
- Период
- 2017-06-16 → 2019-06-15
- Финансиране от ЕС
- 158 122 €
- Участници
- 1
- Схема
- MSCA-IF-EF-ST
Линиите свързват координатора с партньорите.
Накратко на български
Алгоритми за колективен интелект оптимизират групирането на хора за споделен транспорт или съвместно обучение. Те помагат за намаляване на разходите и вземането на по-добри решения от страна на управляващите.
Кратко обяснение, генерирано от езиков модел по текста на CORDIS. Оригиналът е по-долу.
Резултати накратко
Collectiveware: Highly-parallel algorithms for collective intelligence
In recent years, more and more scenarios pose challenges that require Collective Intelligence solutions based on networks (e.g., knowledge networks, social networks, sensor networks), enabling novel ways of social production, promoting innovation and encouraging the exchange of ideas. New forms of collaborative consumption, collaborative making, collaborative production, all rely on a common and fundamental task, i.e., the formation of collectives. Hence, the computation of policies for Collective Intelligence scenarios plays a crucial role in many real-world applications domains, where groups need to be formed in order to complete tasks and achieve costs reductions, both for individuals and for the entire collective. During my MSCA project I tackled two prominent Collective Intelligence scenarios, namely shared mobility and cooperative learning, developing novel AI optimisation algorithms that can deal with the associated computational challenges, quantify the potential benefits, and, ultimately, help policy makers to take better collective decisions.
Текст от CORDIS, на английски · Данни: CORDIS, © Европейски съюз
Цел на проекта
In recent years, more and more scenarios pose challenges that require collective intelligence solutions based on networks (knowledge networks, social networks, sensor networks). New forms of collaborative consumption, collaborative making, collaborative production, all rely on a common task, the formation of collectives. This task is crucial in many real-world applications domains. Notable examples of actual-world collective formation scenarios are Collective Energy Purchasing (CEP), a collaborative consumption scenario, and Team Formation (TF), a collaborative production scenario. Within the Artificial Intelligence literature, current state of the art algorithms cannot provide the level of scalability and the solutionquality required by actual-world collective formation problems, hence novel algorithms are needed to tackle these problems. To achieve this objective, we aim at proposing novel algorithms that are capable to exploit modern highly-parallel architectures. On the one hand, highly-parallel architectures have been successfully applied in many different scenarios so to achieve tremendous performance improvements. These advancements encourage the investigation of parallelisation also in collective formation, with the objective of achieving the same benefits. On the other hand, our past research indicates that considering the structure of the collective formation problem leads to notable benefits in terms of scalability and solution quality. Thus, we propose to take a novel algorithmic design approach that considers both the structure of the scenario and at the same time exploits modern highly-parallel architectures. Our algorithms will be evaluated in two prominent collective intelligence application domains: the CEP and TF domains. The choice of these two application domains will serve to show the generality of our algorithmic design approach, since they are representative of two structurally different families of actual-world collective formation problems.
Оригинален текст от CORDIS (на английски).
Участници
- AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS · MadridКоординаторИспания
Връзки
Данни: CORDIS, © Европейски съюз
