This study investigates the controllability of a general heterogeneous networked sampled-data system(HNSS) consisting of nonidentical node systems, where the inner coupling between any pair of nodes can be described b...
详细信息
This study investigates the controllability of a general heterogeneous networked sampled-data system(HNSS) consisting of nonidentical node systems, where the inner coupling between any pair of nodes can be described by a unique *** signals on control and transmission channels are sampled and held by zero-order holders, and the control sampling period of each node can be different. Necessary and sufficient controllability conditions are developed for the general HNSS, using the Smith normal form and matrix equations, respectively. The HNSS in specific topology or dynamic settings is discussed subsequently with easier-to-verify conditions derived. These heterogeneous factors have been determined to independently or jointly affect the controllability of networked sampled-data systems. Notably, heterogeneous sampling periods have the potential to enhance the overall controllability, but not for systems with some special dynamics. When the node dynamics are heterogeneous,the overall system can be controllable even if it is topologically uncontrollable. In addition, in several typical heterogeneous sampled-data multi-agent systems, pathological sampling of single-node systems will necessarily cause overall uncontrollability.
This paper proposes an event-triggered stochastic model predictive control for discrete-time linear time-invariant(LTI) systems under additive stochastic disturbances. It first constructs a probabilistic invariant set...
详细信息
This paper proposes an event-triggered stochastic model predictive control for discrete-time linear time-invariant(LTI) systems under additive stochastic disturbances. It first constructs a probabilistic invariant set and a probabilistic reachable set based on the priori knowledge of system *** with enhanced robust tubes, the chance constraints are then formulated into a deterministic form. To alleviate the online computational burden, a novel event-triggered stochastic model predictive control is developed, where the triggering condition is designed based on the past and future optimal trajectory tracking errors in order to achieve a good trade-off between system resource utilization and control performance. Two triggering parameters σ and γ are used to adjust the frequency of solving the optimization problem. The probabilistic feasibility and stability of the system under the event-triggered mechanism are also examined. Finally, numerical studies on the control of a heating, ventilation, and air conditioning(HVAC) system confirm the efficacy of the proposed control.
This work presents an adaptive tracking guidance method for robotic fishes. The scheme enables robots to suppress external interference and eliminate motion jitter. An adaptive integral surge line-of-sight guidance ru...
详细信息
This work presents an adaptive tracking guidance method for robotic fishes. The scheme enables robots to suppress external interference and eliminate motion jitter. An adaptive integral surge line-of-sight guidance rule is designed to eliminate dynamics interference and sideslip issues. Limited-time yaw and surge speed observers are reported to fit disturbance variables in the model. The approximation values can compensate for the system's control input and improve the robots' tracking ***, this work develops a terminal sliding mode controller and third-order differential processor to determine the rotational torque and reduce the robots' run jitter. Then, Lyapunov's theory proves the uniform ultimate boundedness of the proposed method. Simulation and physical experiments confirm that the technology improves the tracking error convergence speed and stability of robotic fishes.
This paper studies a novel distributed optimization problem that aims to minimize the sum of the non-convex objective functionals of the multi-agent network under privacy protection, which means that the local objecti...
详细信息
This paper studies a novel distributed optimization problem that aims to minimize the sum of the non-convex objective functionals of the multi-agent network under privacy protection, which means that the local objective of each agent is unknown to others. The above problem involves complexity simultaneously in the time and space aspects. Yet existing works about distributed optimization mainly consider privacy protection in the space aspect where the decision variable is a vector with finite dimensions. In contrast, when the time aspect is considered in this paper, the decision variable is a continuous function concerning time. Hence, the minimization of the overall functional belongs to the calculus of variations. Traditional works usually aim to seek the optimal decision function. Due to privacy protection and non-convexity, the Euler-Lagrange equation of the proposed problem is a complicated partial differential ***, we seek the optimal decision derivative function rather than the decision function. This manner can be regarded as seeking the control input for an optimal control problem, for which we propose a centralized reinforcement learning(RL) framework. In the space aspect, we further present a distributed reinforcement learning framework to deal with the impact of privacy protection. Finally, rigorous theoretical analysis and simulation validate the effectiveness of our framework.
作者:
Qiming LiuXinru CuiZhe LiuHesheng WangDepartment of Automation
Shanghai Jiao Tong UniversityShanghai 200240China MoE Key Laboratory of Artificial Intelligence
AI InstituteShanghai Jiao Tong UniversityShanghai 200240China Department of Automation
Key Laboratory of System Control and Information Processing of Ministry of EducationKey Laboratory of Marine Intelligent Equipment and System of Ministry of EducationShanghai Engineering Research Center of Intelligent Control and ManagementShanghai Jiao Tong UniversityShanghai 200240China
Autonomous navigation for intelligent mobile robots has gained significant attention,with a focus on enabling robots to generate reliable policies based on maintenance of spatial *** this paper,we propose a learning-b...
详细信息
Autonomous navigation for intelligent mobile robots has gained significant attention,with a focus on enabling robots to generate reliable policies based on maintenance of spatial *** this paper,we propose a learning-based visual navigation pipeline that uses topological maps as memory *** introduce a unique online topology construction approach that fuses odometry pose estimation and perceptual similarity *** tackles the issues of topological node redundancy and incorrect edge connections,which stem from the distribution gap between the spatial and perceptual ***,we propose a differentiable graph extraction structure,the topology multi-factor transformer(TMFT).This structure utilizes graph neural networks to integrate global memory and incorporates a multi-factor attention mechanism to underscore elements closely related to relevant target cues for policy *** from photorealistic simulations on image-goal navigation tasks highlight the superior navigation performance of our proposed pipeline compared to existing memory *** validation through behavior visualization,interpretability tests,and real-world deployment further underscore the adapt-ability and efficacy of our method.
This paper develops distributed algorithms for solving Sylvester *** authors transform solving Sylvester equations into a distributed optimization problem,unifying all eight standard distributed matrix *** the authors...
详细信息
This paper develops distributed algorithms for solving Sylvester *** authors transform solving Sylvester equations into a distributed optimization problem,unifying all eight standard distributed matrix *** the authors propose a distributed algorithm to find the least squares solution and achieve an explicit linear convergence *** results are obtained by carefully choosing the step-size of the algorithm,which requires particular information of data and Laplacian *** avoid these centralized quantities,the authors further develop a distributed scaling technique by using local information *** a result,the proposed distributed algorithm along with the distributed scaling design yields a universal method for solving Sylvester equations over a multi-agent network with the constant step-size freely chosen from configurable ***,the authors provide three examples to illustrate the effectiveness of the proposed algorithms.
Real-time six degrees-of-freedom(6D)object pose estimation is essential for many real-world applications, such as robotic grasping and augmented reality. To achieve an accurate object pose estimation from RGB images i...
详细信息
Real-time six degrees-of-freedom(6D)object pose estimation is essential for many real-world applications, such as robotic grasping and augmented reality. To achieve an accurate object pose estimation from RGB images in real-time, we propose an effective and lightweight model, namely high-resolution 6D pose estimation network(HRPose). We adopt the efficient and small HRNetV2-W18 as a feature extractor to reduce computational burdens while generating accurate 6D poses. With only 33% of the model size and lower computational costs, our HRPose achieves comparable performance compared with state-of-the-art models. Moreover, by transferring knowledge from a large model to our proposed HRPose through output and feature-similarity distillations, the performance of our HRPose is improved in effectiveness and efficiency. Numerical experiments on the widely-used benchmark LINEMOD demonstrate the superiority of our proposed HRPose against state-of-the-art methods.
This paper considers the problem of approximating the infinite-horizon value function of the discrete-time switched LQR *** particular,the authors propose a new value iteration method to generate a sequence of monoton...
详细信息
This paper considers the problem of approximating the infinite-horizon value function of the discrete-time switched LQR *** particular,the authors propose a new value iteration method to generate a sequence of monotonically decreasing functions that converges exponentially to the value *** method facilitates us to use coarse approximations resulting from faster but less accurate algorithms for further value iteration,and thus,the proposed approach is capable of achieving a better approximation for a given computation time compared with the existing *** numerical examples are presented in this paper to illustrate the effectiveness of the proposed method.
Reliable bidirectional communication between the control center (CC) and manufacturing devices (MDs) along with efficient resource allocation are critical for the Industrial Internet of Things (IIoT). However, due to ...
详细信息
Preserving the topology from being inferred by external adversaries has become a paramount security issue for network systems (NSs), and adding random noises to the nodal states provides a promising way. Nevertheless,...
详细信息
暂无评论