Optimum integrated design of mechanical structure/controller using bargaining game theory
Graduated Sch. of Eng., Univ. of Hyogo, HimejiDOI: 10.1109/ICCAS.2008.4694519 Conference: Control, Automation and Systems, 2008. ICCAS 2008. International Conference on
Source: IEEE Xplore
We present that the application of the Nash bargaining model, which is a solution method in the bargaining game theory, to setting the utility function for integrated design which has some design purposes. The bargaining game theory is often introduced to explain situations in economic activity, but it is also applicable to engineering problem. Applying the Nash bargaining model to integrated design problem, each design purposepsilas index is mapped into utility functions defined by design parameters, and the utility function for integrated design is easily constructed by the utility functions of each purposepsilas index. Using this method, the design problem shift into the optimum problem, which means to find the maximum problem. However, it is difficult to find the maximum of the utility function analytically. To deal with this difficulty, we use extremum seeking studied by Krstic to find the maximum of the utility function. As a design example, we design mass-damper-spring system with proportional-integral controller and verify the effectiveness of our integrated design method.
Full-text previewDOI: · Available from: www2.ktokai-u.ac.jp
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.
Conference Paper: Extremum seeking from 1922 to 2010[Show abstract] [Hide abstract]
ABSTRACT: Extremum seeking is a form of adaptive control where the steady-state input-output characteristic is optimized, without requiring any explicit knowledge about this input-output characteristic other than that it exists and that it has an extremum. Because extremum seeking is model free, it has proven to be both robust and effective in many different application domains. Equally being model free, there are clear limitations to what can be achieved. Perhaps paradoxically, although being model free, extremum seeking is a gradient based optimization technique. Extremum seeking relies on an appropriate exploration of the process to be optimized to provide the user with an approximate gradient, and hence the means to locate an extremum. These observations are elucidated in the paper. Using averaging and time-scale separation ideas more generally, the main behavioral characteristics of the simplest (model free) extremum seeking algorithm are established.
- [Show abstract] [Hide abstract]
ABSTRACT: Is it possible to develop a computer program that can learn to play different video games by itself depending on the interactions with other players? Can video game characters learn new skills through interacting with human players? Can we make video games more interesting by allowing in-game characters to behave according to human player's strategy? These are just some of the questions that video game developers and artificial intelligence researchers are working on. In this paper, we present an evolutionary approach that uses a modified particle swarm optimization algorithm and artificial neural networks, to answer these questions by allowing the agents to respond to changes in their surroundings. Video games usually require intelligent agents to adapt to new challenges and optimize their own utility with limited resources and our approach utilizes adaptive intelligence to improve an agent's game playing strategies. This research is directly applicable to video games research and evolutionary gaming. The approach presented here can be further extended to develop intelligent systems for the exploitation of weaknesses in an evolutionary system. ICIC International
- [Show abstract] [Hide abstract]
ABSTRACT: A dynamically and partially reconfigurable system can arbitrarily swap hard-ware tasks at runtime. However, such FPGA systems require a long time to read and much memory to store the hardware context, when a hardware task is swapped out. A solution to this problem is to adjust the amount of read-back data in a hardware task to reduce the required memory size and reconfiguration time. Therefore, this investigation develops an adaptive frame length method for hardware context-switching with a context reading and writing (CRW) algorithm in dynamically partial self-reconfigurable (DPSR) FPGA systems. The proposed CRW algorithm requires less instruction to execute Read-back and Writeback procedures. Therefore, the CRW algorithm is one means of reducing reconfiguration time. Experimental results show that the proposed method reduces hard-ware reconfiguration time by 7.763%, memory size by 63.79% and resource overhead by 47.33%.