КФУ. Карточка публикации. An Algorithm for Decentralized Multi-agent Feasibility Problems

КАЗАНСКИЙ
ФЕДЕРАЛЬНЫЙ УНИВЕРСИТЕТ

RUS

- EN
- 中文
- ES

AN ALGORITHM FOR DECENTRALIZED MULTI-AGENT FEASIBILITY PROBLEMS

Форма представления

Статьи в зарубежных журналах и сборниках

Год публикации

2023

Язык

английский

Авторы, сотрудники КФУ

Пинягина Ольга Владиславовна, автор

Библиографическое описание на языке оригинала

Pinyagina O., An Algorithm for Decentralized Multi-agent Feasibility Problems//Communications in Computer and Information Science. - 2023. - Vol.1881 CCIS, Is.. - P.19-28.

Аннотация

We consider the feasibility problem in a multi-agent decentralized form, where each agent has the personal information of the feasible subset, which is unknown to other agents. The common feasible set is composed of the agents' feasible subsets. For solving this problem, we reformulate it in the form of a variational inequality and propose an algorithm based on the projection method. Preliminary test calculations confirm the efficiency of the proposed approach.

Ключевые слова

Feasibility problem, Decentralized system, Projection method, Variational inequality

Название журнала

Communications in Computer and Information Science

URL

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85174624553&doi=10.1007%2f978-3-031-43257-6_2&partnerID=40&md5=cff0d523c62cfe8e70c61d891d76a731

Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на эту карточку

https://repository.kpfu.ru/?p_id=290811

Полная запись метаданных

Поле DC	Значение	Язык
dc.contributor.author	Пинягина Ольга Владиславовна	ru_RU
dc.date.accessioned	2023-01-01T00:00:00Z	ru_RU
dc.date.available	2023-01-01T00:00:00Z	ru_RU
dc.date.issued	2023	ru_RU
dc.identifier.citation	Pinyagina O., An Algorithm for Decentralized Multi-agent Feasibility Problems//Communications in Computer and Information Science. - 2023. - Vol.1881 CCIS, Is.. - P.19-28.	ru_RU
dc.identifier.uri	https://repository.kpfu.ru/?p_id=290811	ru_RU
dc.description.abstract	Communications in Computer and Information Science	ru_RU
dc.description.abstract	We consider the feasibility problem in a multi-agent decentralized form, where each agent has the personal information of the feasible subset, which is unknown to other agents. The common feasible set is composed of the agents' feasible subsets. For solving this problem, we reformulate it in the form of a variational inequality and propose an algorithm based on the projection method. Preliminary test calculations confirm the efficiency of the proposed approach.	ru_RU
dc.language.iso	ru	ru_RU
dc.subject	Feasibility problem	ru_RU
dc.subject	Decentralized system	ru_RU
dc.subject	Projection method	ru_RU
dc.subject	Variational inequality	ru_RU
dc.title	An Algorithm for Decentralized Multi-agent Feasibility Problems	ru_RU
dc.type	Статьи в зарубежных журналах и сборниках	ru_RU