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 is concerned with optimal coalition structure generation in multi-agent systems. For characteristic function game representations, we propose a branch and bound technique presented in the form of possible bipartite partitions and upper bound of coalition structure value, these techniques can be incorporated into many potential coalition structure generation algorithms. In order to test...
In the field of multi-agent systems, the coalition structure generation problem is extremely challenging due to the exponential number of partitions that need to be examined. What kind of appearance the space of coalition structure is, there is few man to research it. This paper take the space of coalition structure as a coalition structure graph, give four properties of OCS (optimal coalition structure)...
This paper studies the discrete-time switched LQR (DSLQR) problem using a dynamic programming approach. Efficient algorithms are proposed to solve both the finite-horizon and the infinite-horizon suboptimal DSLQR problems. More importantly, we establish analytical conditions under which the strategies generated by the algorithms are stabilizing and suboptimal. These conditions are derived explicitly...
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.