Supervised learning for kinetic consensus control
File(s)1-s2.0-S2405896322026647-main.pdf (718.09 KB)
Published version
Author(s)
Albi, Giacomo
Bicego, Sara
Kalise, Dante
Type
Conference Paper
Abstract
In this paper, how to successfully and efficiently condition a target population of agents towards consensus is discussed. To overcome the curse of dimensionality, the mean field formulation of the consensus control problem is considered. Although such formulation is designed to be independent of the number of agents, it is feasible to solve only for moderate intrinsic dimensions of the agents space. For this reason, the solution is approached by means of a Boltzmann procedure, i.e. quasi-invariant limit of controlled binary interactions as approximation of the mean field PDE. The need for an efficient solver for the binary interaction control problem motivates the use of a supervised learning approach to encode a binary feedback map to be sampled at a very high rate. A gradient augmented feedforward neural network for the Value function of the binary control problem is considered and compared with direct approximation of the feedback law.
Date Issued
2022-12-01
Date Acceptance
2022-06-06
Citation
IFAC-PapersOnLine, 2022, 55 (30), pp.103-108
ISSN
2405-8963
Publisher
Elsevier BV
Start Page
103
End Page
108
Journal / Book Title
IFAC-PapersOnLine
Volume
55
Issue
30
Copyright Statement
Copyright © 2022 The Authors. This is an open access article under the CC BY-NC-ND license.
Identifier
https://www.sciencedirect.com/science/article/pii/S2405896322026647?via%3Dihub
Source
25th International Symposium on Mathematical Theory of Networks and Systems
Publication Status
Published
Start Date
2022-09-12
Finish Date
2022-09-16
Coverage Spatial
Bayreuth, Germany
Date Publish Online
2022-11-23