The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper focuses on the resource allocation problem with equality and inequality constraints in a fixed weight-balanced directed or undirected network. Moreover, we propose a fully decentralized subgradient algorithm with event-triggered for solving above resource allocation problem based on first-order discrete-time multi-agent systems. Where each agent only communicates with its neighbors and...
This paper studies a distributed dynamic resource allocation problem for a multi-agent network with a strongly connected digraph, which has increased an equality constraint for individual node requirement from the point of dynamic prediction horizon. Each agent at each prediction horizon in the network is associated with a local resource and a quadratic convex cost function. The goal is to minimize...
This paper studies a distributed resource allocation problem for a multiagent network with a time-varying digraph. Each agent in the network is associated with a local variable (resource) and a convex cost function. The goal is to collectively minimize the total cost in a distributed fashion, subject to individual resource constraints, and collective equality constraints. The main challenge of the...
This paper addresses the distributed resource allocation problem for a network of multiple agents with directed and time-varying communication topologies. Suppose that the total amount of resources is a constant, represented by an equality constraint, and that the amount of resources allocated to each agent is subject to an inequality constraint, called the state constraint. We then aim to solve it...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.