Search results

1 – 2 of 2
Per page
102050
Citations:
Loading...
Access Restricted. View access options
Article
Publication date: 6 December 2022

Xinhong Zou, Hongchang Ding and Jinhong Li

This paper aims to present a sliding mode control method based on disturbance observer (DO) for improving the reaching law of permanent magnet synchronous motor (PMSM).

164

Abstract

Purpose

This paper aims to present a sliding mode control method based on disturbance observer (DO) for improving the reaching law of permanent magnet synchronous motor (PMSM).

Design/methodology/approach

Aiming at the insufficiency of the traditional exponential reaching law used in sliding mode variable structure control, an exponential reaching law related to the speed error is proposed. The improved exponential reaching law can adaptively adjust the size of the constant velocity term in the reaching law according to the size of the speed error, so as to adaptively adjust the speed of the system approaching the sliding mode surface to overcome the control deviation and improve the dynamic and steady state performance. To improve the anti-interference ability of the system, a DO is proposed to observe the external disturbance of the system, and the observed value is used to compensate the system. The stability of the system is analyzed by Lyapunov theorem. The effectiveness of this method is proved by simulation and experiment.

Findings

Simulation and experiment show that the proposed method has the advantages of fast response and strong anti-interference ability.

Research limitations/implications

The proposed method cannot observe the disturbance caused by the change of internal parameters of the system.

Originality/value

A sliding mode control method for PMSM is proposed, which has good control performance. The proposed method can effectively suppress chattering, ensure fast response speed and have strong anti-interference ability. The effectiveness of the algorithm is verified by simulation and experiment.

Details

COMPEL - The international journal for computation and mathematics in electrical and electronic engineering , vol. 42 no. 6
Type: Research Article
ISSN: 0332-1649

Keywords

Access Restricted. View access options
Article
Publication date: 11 July 2018

Wanyue Jiang, Daobo Wang and Yin Wang

The purpose of this paper is to find a solution for the unmanned aerial vehicle (UAV) rendezvous problem, which should be feasible, optimal and not time consuming. In the existing…

96

Abstract

Purpose

The purpose of this paper is to find a solution for the unmanned aerial vehicle (UAV) rendezvous problem, which should be feasible, optimal and not time consuming. In the existing literatures, the UAV rendezvous problem is always presented as a matter of simultaneous arrival. They focus only on the time consistency. However, the arrival time of UAVs can vary according to the rendezvous position. The authors should determine the best rendezvous position with considering UAVs’ maneuver constraint, so that UAVs can construct a formation in a short time.

Design/methodology/approach

The authors present a decentralized method in which UAVs negotiate with each other for the best rendezvous positions by using Nash bargain. The authors analyzed the constraints of the rendezvous time and the UAV maneuver, and proposed an objective function that allows UAVs to get to their rendezvous positions as fast as possible. Bezier curve is adopted to generate smooth and feasible flight trajectories. During the rendezvous process, UAVs adjust their speed so that they can arrive at the rendezvous positions simultaneously.

Findings

The effectiveness of the proposed method is verified by simulation experiments. The proposed method can successfully and efficiently solve the UAV rendezvous problem.

Originality/value

As far as the authors know, it is the first time Nash bargain is used in the UAV rendezvous problem. The authors modified the Nash bargain method and make it distributed, so that it can be computed easily. The proposed method is much less consuming than ordinary Nash bargain method and ordinary swarm intelligence based methods. It also considers the UAV maneuver constraint, and can be applied online for its fast calculation speed. Simulations demonstrate the effectiveness of the proposed method.

Details

International Journal of Intelligent Computing and Cybernetics, vol. 11 no. 3
Type: Research Article
ISSN: 1756-378X

Keywords

1 – 2 of 2
Per page
102050