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.
The paper presents a general-purpose algorithm for solving stochastic combinatorial optimization problems with the expected value of a random variable as objective and deterministic constraints. The algorithm follows the Ant Colony Optimization (ACO) approach and uses Monte-Carlo sampling for estimating the objective. It is shown that on rather mild conditions, including that of linear increment of...
We consider the problem of information consensus in networked multiagent systems in the presence of switching topology and time delay. The stability analysis is performed based on algebraic graph theory and matrix theory. We overview existing convergence results, and propose some new ones for both continuous and discrete time consensus protocols.
This paper has considered the information consensus problems among a group of robots connected via a communication network. With the basis of some mathematical knowledge about graph theory and distributed algorithm, a consensus protocol for a partial synchronous network of multi-robot system was proposed, and its convergence was analyzed. Simulation was given to verify and evaluate the proposed consensus...
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.