15.07.2014 Views

Conference Program of WCICA 2012

Conference Program of WCICA 2012

Conference Program of WCICA 2012

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

<strong>WCICA</strong> <strong>2012</strong><br />

Book <strong>of</strong> Abstracts: Friday Sessions<br />

state or input transformation. Finally, the simulation results show the<br />

effectiveness <strong>of</strong> the proposed control design approach.<br />

◮ FrB10-4 16:50–17:10<br />

Stabilizing the Attitude <strong>of</strong> a Flexible Spacecraft with Fast Convergence,<br />

pp.1676–1681<br />

Ding, Shihong<br />

Zheng, Wei Xing<br />

Jiangsu Univ.<br />

Univ. <strong>of</strong> Western Sydney<br />

To achieve the high accuracy attitude stabilization, by utilizing finitetime<br />

control technique, a non-smooth attitude stabilizing control strategy<br />

for flexible spacecrafts is investigated in this paper. Based on a<br />

backstepping-like control scheme, the non-smooth attitude controller<br />

can be constructed step by step. The rigorous mathematical stability<br />

analysis <strong>of</strong> the overall closed-loop system is made by means <strong>of</strong> the<br />

cascaded systems theory. Simulation results show that not only can the<br />

attitude be stabilized precisely, but also the elastic vibration <strong>of</strong> flexible<br />

appendages can be suppressed effectively.<br />

◮ FrB10-5 17:10–17:30<br />

Finite-Time Consensus Problem for Multiple Non-holonomic Mobile A-<br />

gents, pp.1739–1744<br />

Wang, Jiankui<br />

Qiu, Zhihui<br />

Zhang, Guoshan<br />

Yang, Weichao<br />

Tianjin Univ.<br />

Tianjin Univ.<br />

Tianjin Univ.<br />

Tianjin Univ.<br />

In this paper, the problem <strong>of</strong> finite time consensus is discussed for<br />

multiple non-holonomic mobile agents. The objective is to design a<br />

distributed finite time control law such that the controlled multiple nonholonomic<br />

mobile agents can reach consensus within any given finite<br />

settling time. We propose a novel switching control strategy with the<br />

help <strong>of</strong> time-rescalling technique and graph theory. The numerical simulations<br />

are presented to show the effectiveness <strong>of</strong> the method.<br />

◮ FrB10-6 17:30–17:50<br />

Flux Estimation <strong>of</strong> Induction Motors Using High-order Terminal Sliding-<br />

Mode Observer, pp.1860–1863<br />

Feng, Yong<br />

Zhou, Minghao<br />

Shi, Hongyu<br />

Yu, Xinghuo<br />

Harbin Inst. <strong>of</strong> Tech.<br />

Harbin Inst. <strong>of</strong> Tech.<br />

Harbin Inst. <strong>of</strong> Tech.<br />

RMIT Univ.<br />

This paper presents a rotor flux estimation method for induction motors<br />

based on high-order terminal sliding-mode observer. A terminal sliding<br />

mode manifold is designed for the observer and a control strategy is applied<br />

to stabilize the observer. A high-order sliding-mode mechanism is<br />

utilized in the observer controller to generate a smooth control signal,<br />

which can be directly used for the estimation <strong>of</strong> the rotor flux. The estimate<br />

<strong>of</strong> the rotor flux can be used for implementing the field orientation<br />

control <strong>of</strong> an induction motor. The effect <strong>of</strong> the equivalent low-pass filter<br />

in the high-order sliding-mode mechanism can be regulated according<br />

to the performance requirements.<br />

FrB11 15:50–17:50 Room 311C<br />

Invited Session: Intelligent Optimization and Evolutionary Computation<br />

(II)<br />

Chair: Chen, Jie<br />

Beijing Inst. <strong>of</strong> Tech.<br />

Co-Chair: Wang, Ling<br />

Tsinghua Univ.<br />

◮ FrB11-1 15:50–16:10<br />

Three-dimensional Deployment Optimization <strong>of</strong> Sensor Network Based<br />

on An Improved Particle Swarm Optimization Algorithm, pp.4395–4400<br />

Lian, Xiaoyan<br />

Zhang, Juan<br />

Chen, Chen<br />

Deng, Fang<br />

Beijing Inst. <strong>of</strong> Tech.<br />

Beijing Inst. <strong>of</strong> Tech.<br />

Tsinghua Univ.<br />

Beijing Inst. <strong>of</strong> Tech.<br />

Compared with the traditional two-dimensional (2D) deployment form,<br />

three-dimensional (3D) deployment <strong>of</strong> sensor network has greater research<br />

significance and practical potential to satisfy the detecting needs<br />

<strong>of</strong> targets with complex properties. In this paper, a method for 3D deployment<br />

optimization <strong>of</strong> sensor network based on an improved Particle<br />

Swarm Optimization (PSO) algorithm is proposed. Many factors<br />

such as coverage scale, detection probability and resource utilization<br />

are synthetically considered to optimize the sensor network’s overall<br />

detection performance. To evaluate the network’s performance, four<br />

indexes are presented and the 3D deployment space is divided into<br />

different height levels. Accordingly, the mathematical model is formulated<br />

by weighting the performance indexes and height levels due to<br />

their importance degrees. In order to solve the optimization problem,<br />

an algorithm called WCPSO is carried out, which has a dynamic inertia<br />

weight and adaptable acceleration constants. Verified by the simulation<br />

results, the presented 3D deployment optimization method effectively<br />

improves the sensor network’s detection performance. The method<br />

in this paper can provide guidance and technical reference in future<br />

application <strong>of</strong> relevant research.<br />

◮ FrB11-2 16:10–16:30<br />

Optimization <strong>of</strong> a 3-PRS parallel manipulator based on interval analysis,<br />

pp.2452–2456<br />

Zhang, Xu<br />

Fang, Hao<br />

Beijing Inst. <strong>of</strong> Tech.<br />

Beijing Inst. <strong>of</strong> Tech.<br />

This paper addresses the problem <strong>of</strong> mechanism optimization <strong>of</strong> the<br />

3-PRS parallel manipulator, a mechanism consisting <strong>of</strong> a moving platform<br />

and a base platform connected by three serial PRS chains. In<br />

order to optimize the geometrical parameters, first the inverse kinematic<br />

<strong>of</strong> the 3-PRS parallel manipulator is analyzed and the requirement <strong>of</strong><br />

specific workspace <strong>of</strong> 3-DOF independent motions is defined by satisfying<br />

the constraints <strong>of</strong> the actuator length. Then due to existence <strong>of</strong><br />

the unexpected parasitic motions, the parasitic motions are expressed<br />

as the functions <strong>of</strong> the independent motions so that the evaluation <strong>of</strong><br />

the actuator length only depends on the desired independent motions.<br />

Therefore an algorithm based on interval analysis is designed to<br />

optimize the design parameters. Interval-based optimization can provide<br />

almost all the solutions satisfying the requirement <strong>of</strong> the specific<br />

workspace. A numerical example <strong>of</strong> the optimization is presented and<br />

the comparison <strong>of</strong> two groups <strong>of</strong> design parameters is given to validate<br />

the effectiveness <strong>of</strong> the proposed interval-based optimization algorithm.<br />

◮ FrB11-3 16:30–16:50<br />

A Differential Evolution Algorithm with Two Speed-up Methods for NF-<br />

SSP with SDSTs and RDs, pp.490–495<br />

Qian, Bin<br />

Du, Puze<br />

Hu, Rong<br />

Che, Guolin<br />

Kunming Univ. <strong>of</strong> Sci. & Tech.<br />

Kunming Univ. <strong>of</strong> Sci. & Tech.<br />

Kunming Univ. <strong>of</strong> Sci. & Tech.<br />

kmust<br />

This paper presents a differential evolution algorithm with two speedup<br />

methods (DE TSM) for solving the no-wait flow-shop scheduling<br />

problem (NFSSP) with sequence-dependent setup times (SDSTs) and<br />

release dates (RDs). The criterion is to minimize the total completion<br />

time. To balance the exploration and exploitation abilities <strong>of</strong> our<br />

DE TSM, DE-based global search is utilized to find the promising regions<br />

or solutions over the solution space, and a fast local search according<br />

to two speed-up methods is designed to fast exploit the neighborhoods<br />

<strong>of</strong> these regions. Simulation results based on a set <strong>of</strong> random<br />

instances and comparisons with several effective meta-heuristics<br />

demonstrate the superiority <strong>of</strong> DE FNES in terms <strong>of</strong> searching quality<br />

and efficiency.<br />

◮ FrB11-4 16:50–17:10<br />

Implementation <strong>of</strong> Control Algorithm for Three-Dimensional Pursuer<br />

Convoy, pp.2005–2010<br />

Feng, Shulin<br />

Wang, Wei<br />

Zhang, Huanshui<br />

Shandong Univ.<br />

Shandong Univ.<br />

Shandong Univ.<br />

In this paper, we consider the problem <strong>of</strong> modeling and controlling a<br />

convoy in the three-dimensional space. The guidance laws applied for<br />

convoy are the velocity pursuit and the deviated pursuit, which steer the<br />

pursuer using the rate <strong>of</strong> line-<strong>of</strong>-sight (LOS) between successive pursuers.<br />

On the basis <strong>of</strong> the differential equations for the range, the pitch<br />

angle <strong>of</strong> LOS and the yaw angle <strong>of</strong> LOS between successive pursuers,<br />

109

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!