检索结果-内蒙古大学图书馆

Learning Goal-based Movement via Motivational-based Models in Cognitive Mobile Robots

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Berto, Letícia Costa, Paula Simões, Alexandre Gudwin, Ricardo Colombini, Esther Laboratory of Robotics and Cognitive Systems Institute of Computing University of Campinas Brazil Dept. of Computer Engineering and Industrial Automation School of Electrical and Computer Engineering University of Campinas Brazil Dept. of Control and Automation Engineering Institute of Science and Technology São Paulo State University Sorocaba Brazil University of Campinas Brazil

Humans have needs motivating their behavior according to intensity and context. However, we also create preferences associated with each action’s perceived pleasure, which is susceptible to changes over time. This makes decision-making more complex, requiring learning to balance needs and preferences according to the context. To understand how this process works and enable the development of robots with a motivational-based learning model, we computationally model a motivation theory proposed by Hull. In this model, the agent (an abstraction of a mobile robot) is motivated to keep itself in a state of homeostasis. We added hedonic dimensions to see how preferences affect decision-making, and we employed reinforcement learning to train our motivated-based agents. We run three agents with energy decay rates representing different metabolisms in two different environments to see the impact on their strategy, movement, and behavior. The results show that the agent learned better strategies in the environment that enables choices more adequate according to its metabolism. The use of pleasure in the motivational mechanism significantly impacted behavior learning, mainly for slow metabolism agents. When survival is at risk, the agent ignores pleasure and equilibrium, hinting at how to behave in harsh scenarios. Copyright © 2023, The Authors. All rights reserved.

关键词： Metabolism

EEG Signals Classification in Time-Frequency Images by Fusing Rotation-Invariant Local Binary Pattern and Gray Level Co-occurrence Matrix Features 1st

学校读者我要写书评

暂无评论

EEG Signals Classification in Time-Frequency Images by Fus...

1st CAAI International Conference on Artificial Intelligence, CICAI 2021

作者： Hu, Zhongyi Luo, Zhenzhen Jin, Shan Li, Zuoyong College of Computer and Artificial Intelligence Intelligent Information Systems Institute Wenzhou University Wenzhou China Zhejiang Topcheer Information Technology Co. Ltd Zhejiang China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fuzhou China

ISBN: (纸本)9783030930455

Automatic epilepsy diagnosis system based on EEG signals is critical in the classification of epilepsy. This disease classification through doctors’ visual observation of transient EEG signals is more art than science. This paper proposes a novel EEG signals classification method based on time-frequency images by fusing rotation-invariant local binary pattern and gray level co-occurrence matrix features. Specifically, a continuous wavelet transform is applied to perform wavelet decomposition of mutated EEG signals and obtain their time-frequency images. Then, the binary particle swarm optimization algorithm is used to eliminate redundant features in feature selection and optimize the hyperparameters of SVM. The proposed method was verified by its comparison with other available cutting-edge classification methods. The proposed EEG signals classification framework achieved a better classification effect, which will help expert clinicians and neuroscientists to make more accurate and rapid epilepsy diagnosis. © 2021, Springer Nature Switzerland AG.

关键词： Neurology

Global solution to sensor network localization: A non-convex potential game approach and its distributed implementation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xu, Gehui Chen, Guanpu Hong, Yiguang Fidan, Baris Parisini, Thomas Johansson, Karl H. Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures StockholmSE-10044 Sweden Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China The Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada The Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom The Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Consider a sensor network consisting of both anchor and non-anchor nodes. We address the following sensor network localization (SNL) problem: given the physical locations of anchor nodes and relative measurements among all nodes, determine the locations of all non-anchor nodes. The solution to the SNL problem is challenging due to its inherent non-convexity. In this paper, the problem takes on the form of a multi-player nonconvex potential game in which canonical duality theory is used to define a complementary dual potential function. After showing the Nash equilibrium (NE) correspondent to the SNL solution, we provide a necessary and sufficient condition for a stationary point to coincide with the NE. An algorithm is proposed_ to reach the NE and shown to have convergence rate O(1/√k). With the aim of reducing the information exchange within a network, a distributed algorithm for NE seeking is implemented and its global convergence analysis is provided. Extensive simulations show the validity and effectiveness of the proposed approach to solve the SNL problem. Copyright © 2024, The Authors. All rights reserved.

关键词： Game theory

CoNi-MPC: Cooperative Non-inertial Frame Based Model Predictive control

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Zhang, Baozhe Chen, Xinwei Li, Zhehan Beltrame, Giovanni Xu, Chao Gao, Fei Cao, Yanjun Huzhou Institute of Zhejiang University Huzhou313000 China State Key Laboratory of Industrial Control Technology Institute of Cyber-Systems and Control Zhejiang University Hangzhou310027 China The Chinese University of Hong Kong Shenzhen518172 China Department of Computer Engineering and Software Engineering Poly-technique Montreal Canada

This paper presents a novel solution for UAV control in cooperative multi-robot systems, which can be used in various scenarios such as leader-following, landing on a moving base, or specific relative motion with a target. Unlike classical methods that tackle UAV control in the world frame, we directly control the UAV in the target coordinate frame, without making motion assumptions about the target. In detail, we formulate a nonlinear model predictive controller of a UAV, referred to as the agent, within a non-inertial frame (i.e., the target frame). The system requires the relative states (pose and velocity), the angular velocity and the accelerations of the target, which can be obtained by relative localization methods and ubiquitous MEMS IMU sensors, respectively. This framework eliminates dependencies that are vital in classical solutions, such as accurate state estimation for both the agent and target, prior knowledge of the target motion model, and continuous trajectory re-planning for some complex tasks. We have performed extensive simulations to investigate the control performance with varying motion characteristics of the target. Furthermore, we conducted real robot experiments, employing either simulated relative pose estimation from motion capture systems indoors or directly from our previous relative pose estimation devices outdoors, to validate the applicability and feasibility of the proposed approach. © 2023, CC BY.

关键词： Unmanned aerial vehicles (UAV)

Benchmarking Semantic Communications for Image Transmission Over MIMO Interference Channels

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Yanhu Guo, Shuaishuai Dong, Anming Zhao, Hui School of Control Science and Engineering Shandong Key Laboratory of Wireless Communication Technologies Shandong University Jinan250061 China The School of Computer Science and Technology Qilu University of Technology Jinan250353 China The Communication Systems Department EURECOM Sophia Antipolis 06410 France

Semantic communications offer promising prospects for enhancing data transmission efficiency. However, existing schemes have predominantly concentrated on point-to-point transmissions. In this paper, we aim to investigate the validity of this claim in interference scenarios compared to baseline approaches. Specifically, our focus is on general multiple-input multiple-output (MIMO) interference channels, where we propose an interference-robust semantic communication (IRSC) scheme. This scheme involves the development of transceivers based on neural networks (NNs), which integrate channel state information (CSI) either solely at the receiver or at both transmitter and receiver ends. Moreover, we establish a composite loss function for training IRSC transceivers, along with a dynamic mechanism for updating the weights of various components in the loss function to enhance system fairness among users. Experimental results demonstrate that the proposed IRSC scheme effectively learns to mitigate interference and outperforms baseline approaches, particularly in low signal-to-noise (SNR) regimes. © 2024, CC BY.

关键词： Channel state information

Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater’s Condition

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Ding, Jinliang Cao, Ming Johansson, Karl H. Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201800 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper studies the distributed bandit convex optimization problem with time-varying inequality constraints, where the goal is to minimize network regret and cumulative constraint violation. To calculate network cumulative constraint violation, existing distributed bandit online algorithms solving this problem directly use the clipped constraint function to replace its original constraint function. However, the use of the clipping operation renders Slater’s condition (i.e, there exists a point that strictly satisfies the inequality constraints at all iterations) ineffective to achieve reduced network cumulative constraint violation. To tackle this challenge, we propose a new distributed bandit online primal–dual algorithm. If local loss functions are convex, we show that the proposed algorithm establishes an O(T max{c,1−c})network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the total number of iterations and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds, the network cumulative constraint violation bound is reduced to O(T 1−c). In addition, if local loss functions are strongly convex, for the case where strongly convex parameters are unknown, the network regret bound is reduced to O(T1−c), and the network cumulative constraint violation bound is O(T1−c/2) and O(T1−c) without and with Slater’s condition, respectively. For the case where strongly convex parameters are known, the network regret bound is further reduced to O)(log(T)), and the network cumulative constraint violation bound is reduced to O(log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is among the first to establish reduced (network) cumulative constraint violation bounds for (distributed) bandit convex optimization with time-varying constraints under Slater’s condition. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2

关键词： Convex optimization

Stability of the distributed Kalman filter using general random coefficients

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2021年第7期64卷 66-79页

作者： Die GAN Siyu XIE Zhixin LIU Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences The Department of Electrical and Computer Engineering Wayne State University

In this paper, we propose a distributed Kalman filter(DKF) for the dynamical system with general random coefficients. In the proposed method, each estimator shares local innovation pairs with its neighbors to collectively complete the estimation task. Further, we introduce a collective random observability condition by which the Lp-stability of the covariance matrix and the Lp-exponential stability of the homogeneous part of the estimation error equation can be established. In contrast, the stringent conditions on the coefficient matrices, such as independency and stationarity are not required. Besides, the stability of the DKF, i.e., the boundedness of the filtering errors, can be established. Finally, from the simulation result,we demonstrate the cooperative effect of the sensors.

关键词： distributed Kalman filter collective random observability L p-stable L p-exponentially stable state estimation

Adaptive Estimation for Environmental Monitoring Using an Autonomous Underwater Vehicle

学校读者我要写书评

暂无评论

Adaptive Estimation for Environmental Monitoring Using an Au...

IEEE Conference on Decision and control

作者： Ziwen Yang Joana Fonseca Shanying Zhu Cailian Chen Xinping Guan Karl H. Johansson Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Digital Futures

This paper considers the problem of monitoring and adaptively estimating an environmental field, such as temperature or salinity, using an autonomous underwater vehicle (AUV). The AUV moves in the field and persistently measures environmental scalars and its position in its local coordinate frame. The environmental scalars are approximately linearly distributed over the region of interest, and an adaptive estimator is designed to estimate the gradient. By orthogonal decomposition of the velocity of the AUV, a linear time-varying system is equivalently constructed, and the sufficient conditions on the motion of the AUV are established, under which the global exponential stability of the estimation error system is rigorously proved. Furthermore, an estimate of the exponential convergence rate is given, and a reference trajectory that maximizes the estimate of the convergence rate is obtained for the AUV to track. Numerical examples verify the stability and efficiency of the system.

关键词：

Minimal realizations of input-output behaviors by LPV state-space representations with affine dependency

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Petreczky, Mihály Tóth, Roland Mercère, Guillaume Univ. Lille CNRS Centrale Lille UMR 9189 CRIStAL LilleF-59000 France The University of Poitiers Laboratoire d’Informatique et d’Automatique pour les Systèmes France The Control Systems Group Department of Electrical Engineering Eindhoven University of Technology Eindhoven Netherlands The Systems and Control Laboratory Institute for Computer Science and Control Budapest Hungary

The paper makes the first steps towards a behavioral theory of LPV state-space representations with an affine dependency on scheduling, by characterizing minimality of such state-space representations. It is shown that minimality is equivalent to observability, and that minimal realizations of the same behavior are isomorphic. Finally, we establish a formal relationship between minimality of LPV state-space representations with an affine dependence on scheduling and minimality of LPV state-space representations with a dynamic and meromorphic dependence on scheduling. © 2023, CC BY.

关键词： State space methods