1 November 2017 in ISA Transactions
8 March 2023 in IEEE Transactions on Network Science and Engineering
This paper proposes a distributed model predictive control (DMPC) algorithm for the formation flight of a group of UAVs modeled by six degree-of-freedom (6-DoF) spatial kinematics. The formation system has a leader-follower structure with the leader cruising at a constant linear velocity during the flight, and the UAVs transmit data in a unidirectional order. The DMPC algorithm utilizes the unidirectional structure through the reception and transmission of an assumed output sequence as the reference trajectory, which is constructed from the solutions to the local DMPC problem and the prediction model. Based on the interactions between UAVs, convergence and stability of the multi-UAV formation are ensured by the terminal constraints and recursive feasibility of the DMPC optimization. Simulations involving time-delays, packet drops and turbulence effect are conducted to verify the effectiveness of the proposed algorithm. Comparisons with non-unidirectional data transmissions further demonstrate that the unidirectional structure plays a critical role in the convergence performance
16 May 2024 in IEEE Access
Quadruped robots, with their superior terrain adaptability and flexible movement capabilities, demonstrate greater application potential in complex environments compared to traditional ground robots. However, their non-negligible body shape and anisotropic motion characteristics complicate the achievement of high-precision motion planning and autonomous navigation. In this paper, we propose a safe and robust motion planning system tailored for autonomous navigation of quadruped robots in cluttered environments. We adopt a hierarchical architecture and decompose the planning process into front-end searching and back-end optimization. In the front-end searching stage, the robot finds a smooth, feasible, and energy-efficient initial trajectory with safety consideration. In the back-end optimization stage, we leverage B-splines to enhance the trajectory smoothness, safety, and motion stability. Finally, the time allocation is fine-tuned through iterative refinement, ensuring the feasibility of the optimized trajectory. Our method is extensively validated in challenging simulations as well as in real-world testing environments, benchmark comparisons also demonstrate the improved performance of our method.
15 May 2024 in IEEE Transactions on Industrial Informatics
This article studies the tracking control problem of an autonomous quadruped robot (AQR). A new kinematic model is presented to describe both the translation mode and the rotation mode of the AQR using the same number of inputs as compared with the linear inverted pendulum model. We newly propose a sequence-scaling Lyapunov-based model predictive control algorithm for the AQR to improve the tracking performance. Within the control framework, the sequence-scaling strategy is introduced to optimize the tracking, and simultaneously guarantee the closed-loop stability. The practical constraints, such as dynamic balance of motion and speed limits, are explicitly considered to provide a feasible tracking trajectory to the AQR. We analytically address the closed-loop stability, where a contraction constraint is built within the gait sequence. Simulation and hardware experiments on Unitree Aliengo witness the superior real-time control performance via the proposed algorithm.
3 August 2022 in IEEE Transactions on Network Science and Engineering
Vertex covering a static network has received much attention in the past few years, while vertex covering a dynamical network has rarely been reviewed. In this paper, we newly establish a vertex cover game model of dynamical networks with integrating prospect theory, and design an adaptive evolution scheme for network structure and vertices' strategies to achieve the adaptive covering of a dynamical network concurrently. We define a Nash equilibrium state of the network structure and vertices' strategies. Subsequently, we prove that given the reference point in the active region, the designed adaptive evolution scheme can drive the network structure and vertices' strategies to a Nash cover equilibrium (NCE) state with probability one. Intensive examples verify the effectiveness of the designed adaptive evolution scheme to the vertex covering of dynamical networks, presenting that in the NCE states, the less the average number of covered vertices, the less the average clustering coefficient and the ratio of the average degree of covered vertices to the average degree of uncovered vertices.