A hybrid control approach is proposed to achieve the desired performance. Firstly a robust input shaper is designed to reduce the transient vibration and residual vibration of the container efficiently. Then a simple ...A hybrid control approach is proposed to achieve the desired performance. Firstly a robust input shaper is designed to reduce the transient vibration and residual vibration of the container efficiently. Then a simple fuzzy logic controller is designed to eliminate the residual vibration completely in order to guarantee the positioning precision. Such a hybrid approach is simple in structure and readily realizable. Simulation results verify the fine performance of this hybrid control approach. It can achieve perfect elimination of residual vibration and concise positioning of the container load, and it is robust to parameter variations （mainly for cable length） and external disturbances.展开更多
Analysis and verification of pointer programs are still difficult problems so far. This paper uses a shape graph logic and a shape system to solve these problems in two stages. First, shape graphs at every program poi...Analysis and verification of pointer programs are still difficult problems so far. This paper uses a shape graph logic and a shape system to solve these problems in two stages. First, shape graphs at every program point are constructed using an analysis tool. Then, they are used to support the verification of other properties （e.g., orderedness）. Our prototype supports automatic verification of programs manipulating complex data structures such as splay trees, treaps, AVL trees and AA trees, etc. The proposed shape graph logic, as an extension to Hoare logic, uses shape graphs directly as assertions. It can be used in the analysis and verification of programs manipulating mutable data structures. The benefit using shape graphs as assertions is that it is convenient for acquiring the relations between pointers in the verification stage. The proposed shape system requires programmers to provide lightweight shape declarations in recursive structure type declarations. It can help rule out programs that construct shapes deviating from what programmers expect （reflected in shape declarations） in the analysis stage. As a benefit, programmers need not provide specifications （e.g., pre-/post-conditions, loop invariants） about pointers. Moreover, we present a method doing verification in the second stage using traditional Hoare logic rules directly by eliminating aliasing with the aid of shape graphs. Thus, verification conditions could be discharged by general theorem provers.展开更多
基金This project is supported by National Hi-tech Research and DevelopmentProgram of China (863 Program, No.2002AA412010).
文摘A hybrid control approach is proposed to achieve the desired performance. Firstly a robust input shaper is designed to reduce the transient vibration and residual vibration of the container efficiently. Then a simple fuzzy logic controller is designed to eliminate the residual vibration completely in order to guarantee the positioning precision. Such a hybrid approach is simple in structure and readily realizable. Simulation results verify the fine performance of this hybrid control approach. It can achieve perfect elimination of residual vibration and concise positioning of the container load, and it is robust to parameter variations （mainly for cable length） and external disturbances.
基金supported by the National Natural Science Foundation of China under Grant Nos.61003043,61170018the National High Technology Research and Development 863 Program of China under Grant No.2012AA010901-2the Postdoctoral Science Foundation of China under Grant No.2012M521250
文摘Analysis and verification of pointer programs are still difficult problems so far. This paper uses a shape graph logic and a shape system to solve these problems in two stages. First, shape graphs at every program point are constructed using an analysis tool. Then, they are used to support the verification of other properties （e.g., orderedness）. Our prototype supports automatic verification of programs manipulating complex data structures such as splay trees, treaps, AVL trees and AA trees, etc. The proposed shape graph logic, as an extension to Hoare logic, uses shape graphs directly as assertions. It can be used in the analysis and verification of programs manipulating mutable data structures. The benefit using shape graphs as assertions is that it is convenient for acquiring the relations between pointers in the verification stage. The proposed shape system requires programmers to provide lightweight shape declarations in recursive structure type declarations. It can help rule out programs that construct shapes deviating from what programmers expect （reflected in shape declarations） in the analysis stage. As a benefit, programmers need not provide specifications （e.g., pre-/post-conditions, loop invariants） about pointers. Moreover, we present a method doing verification in the second stage using traditional Hoare logic rules directly by eliminating aliasing with the aid of shape graphs. Thus, verification conditions could be discharged by general theorem provers.
