检索结果-南通市图书馆

Research 2022年第4期2022卷 657-675页

作者： Na Tan Jiaying Shi Lingyu Xu Yanrong Zheng Xia Wang Nanxi Lai Zhuowen Fang Jialu Chen Yi Wang Zhong Chen Institute of Pharmacology and Toxicology College of Pharmaceutical SciencesZhejiang UniversityHangzhouChina Key Laboratory of Neuropharmacology and Translational Medicine of Zhejiang Province School of Pharmaceutical SciencesZhejiang Chinese Medical UniversityHangzhouChina

Predatory hunting is an innate appetite-driven and evolutionarily conserved behavior essential for animal survival, integrating sequential behaviors including searching, pursuit, attack, retrieval, and ultimately consumption. Nevertheless, neural circuits underlying hunting behavior with different features remain largely unexplored. Here, we deciphered a novel function of lateral hypothalamus (LH) calcium/calmodulin-dependent protein kinase II α (CaMKIIα^(+)) neurons in hunting behavior and uncovered upstream/downstream circuit basis. LH CaMKIIα^(+) neurons bidirectionally modulate novelty-seeking behavior, predatory attack, and eating in hunting behavior. LH CaMKIIα^(+) neurons integrate hunting-related novelty-seeking information from the medial preoptic area (MPOA) and project to the ventral periaqueductal gray (vPAG) to promote predatory eating. Our results demonstrate that LH CaMKIIα^(+) neurons are the key hub that integrate MPOA-conveyed novelty-seeking signals and encode predatory eating in hunting behavior, which enriched the neuronal substrate of hunting behavior.

关键词： seeking integrate integrating

Prescribed-Time Nash Equilibrium seeking for Pursuit-Evasion Game

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2024年第6期11卷 1518-1520页

作者： Lei Xue Jianfeng Ye Yongbao Wu Jian Liu D.C.Wunsch Key Laboratory of Measurement and Control of Complex Systems of Engineering Ministry of EducationNanjing 210096 School of Automation Southeast UniversityNanjing 210096China Department of Electrical and Computer Engineering Missouri University of Science and TechnologyRollaMO 65409 USA IEEE

Dear Editor,This letter is concerned with prescribed-time Nash equilibrium(PTNE)seeking problem in a pursuit-evasion game(PEG)involving agents with second-order dynamics.In order to achieve the prior-given and user-defined convergence time for the PEG,a PTNE seeking algorithm has been developed to facilitate collaboration among multiple pursuers for capturing the evader without the need for any global information.Then,it is theoretically proved that the prescribedtime convergence of the designed algorithm for achieving Nash equilibrium of PEG.Eventually,the effectiveness of the PTNE method was validated by numerical simulation results.A PEG consists of two groups of agents:evaders and pursuers.The pursuers aim to capture the evaders through cooperative efforts,while the evaders strive to evade capture.PEG is a classic noncooperative game.It has attracted plenty of attention due to its wide application scenarios,such as smart grids[1],formation control[2],[3],and spacecraft rendezvous[4].It is noteworthy that most previous research on seeking the Nash equilibrium of the game,where no agent has an incentive to change its actions,has focused on asymptotic and exponential convergence[5]-[7].

关键词： seeking prescribed convergence

Remaining original aspirations,seeking innovation,striving for excellence

同方期刊数据库博看期刊评论

在线全文

学校读者我要写书评

暂无评论

International Journal of Nursing Sciences 2023年第1期10卷 5-7页

作者： Xiaoying Jiang The Chinese Nursing Journals Publishing House BeijingChina

Prof.Xiaoying Jiang Director of the Chinese Nursing Journals Publishing House As time passes,a new chapter emerges.Looking back at the year 2022,under the leadership and strong support of the China Association for Science and Technology(CAST)and the Chinese Nursing Association,the Chinese Nursing Journals Publishing House,with its original aspirations,has always insisted on serving the overall national construction and development of nursing disciplines.

关键词： seeking nursing Director

Distributed Nash Equilibrium seeking Over Random Graphs

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2022年第12期9卷 2193-2196页

作者： Ji Ma Jiayu Qiu Xiao Yu Weiyao Lan Department of Automation Xiamen Universityand the Key Laboratory of Control and Navigation(Xiamen University)Fujian Province UniversityXiamen 361005China IEEE Department of Automation Xiamen University and the Key Laboratory of Control and Navigation(Xiamen University)Fujian Province UniversityXiamen 361005China Innovation Laboratory for Sciences and Technologies of Energy Materials of Fujian Province(IKKEM) Xiamen 361005China

Dear Editor,This letter is concerned with the distributed Nash equilibrium(NE)seeking in an N-player game over random graphs. We develop a distributed stochastic forward-backward(DSFB) algorithm based on local information exchange between agents. We prove that the DSFB algorithm can converge to an NE almost surely, and analyze the convergence rate of the proposed algorithm. Compared with the existing works on distributed NE seeking, the communication graph in this letter is supposed to be time-varying and stochastic, which makes the NE seeking algorithm more suitable for practical scenarios, but brings a great challenge in both the design and convergence analysis of the algorithm. Besides, by establishing a variational inequality on NE, we relax the co-coercivity or strong monotonicity assumption on the extended pseudo-gradient.

关键词： seeking letter stochastic

A novel gradient climbing control for seeking the best communication point for data collection from a seabed platform using a single unmanned surface vehicle

在线全文

学校读者我要写书评

暂无评论

Frontiers of Information Technology & Electronic Engineering 2019年第6期20卷 751-759页

作者： Jiu-cai JIN Jie ZHANG Zhi-chao LV First Institute of Oceanography Ministry of Natural Resources Qingdao 266061 China College of Underwater Acoustic Engineering Harbin Engineering University Harbin 150001 China

A novel controller for finding the best communication point is proposed for collecting data from a seabed platform by a single unmanned surface vehicle(USV) using underwater acoustic communication(UAC). As far as we know, extremum seeking based on climbing control is usually implemented by multiple vehicles or agents because of the large range of measurement and easy acquisition of gradient estimation. A single vehicle cannot rapidly estimate the field because of the limited extent for measurement;therefore, it is difficult for a single vehicle to seek the extremum point in a field. In this study, an oscillation motion(OM) is designed for a single USV to acquire UAC’s link strength data between the seabed platform and the USV. The field for UAC’s link strength is updated using new measurement from an OM of the USV based on a multi-variable weight linear iteration method. A controller for seeking the best UAC’s point of the USV is designed using gradient climbing and artificial potential considering iterative estimation of an unknown field and an OM operation, and the stability is proved. The reliability and efficiency are shown in simulation results.

关键词： Unmanned surface vehicle Data collection Underwater acoustic communication Gradient climbing Extremum seeking

New directions in distributed Nash equilibrium seeking based on monotone operator theory

在线全文

学校读者我要写书评

暂无评论

Control Theory and Technology 2020年第3期18卷 333-335页

作者： Peng YI Tongyu WANG Department of Control Science&Engineering Tongji UniversityShanghai 201804China Shanghai Institute of Intelligent Science and Technology Tongji UniversityShanghai 201804China

There has been an increasing research interest in modeling,optimization and control of various multi-agent networks that have wide applications in industry,defense,security,and social areas,such as computing clusters,interconnected micro-grid systems,unmanned vessel swarms[1],power systems[2],multiple UAV systems[3]and sensor networks[4].For non-cooperative agents that only concern selfish profit-maximizing,the decision making problem can be modelled and solved with the help of game theory,while Nash equilibrium(NE)seeking is at the core to solve the non-cooperative multi-agent games[5-7].Distributed NE seeking methods are appealing compared with the center-based methods in large-scale networks due to its scalability,privacy protection,and adaptability.Recently,monotone operator theory is explored for distributed NE seeking,which is shown to provide an uniform framework for various algorithms in different scenarios.It has been gradually developing into a cutting-edge research field,with the prospect and necessity of future in-depth research.

关键词： seeking monotone operator

Multi-Timescale Distributed Approach to Generalized-Nash-Equilibrium seeking in Noncooperative Nonconvex Games

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2024年第3期11卷 791-793页

作者： Banghua Huang Yang Liu Kit Ian Kou Weihua Gui the School of Mathematical Sciences Zhejiang Normal UniversityJinhua 321004China IEEE the Key Laboratory of Intelligent Education Technology and Application of Zhejiang Province Jinhua 321004China the Faculty of Science and Technology University of MacaoMacaoChina the School of Automation Central South UniversityChangsha 410083China

Dear Editor,The distributed generalized-Nash-equilibrium(GNE)seeking in noncooperative games with nonconvexity is the topic of this letter.Inspired by the sequential quadratic programming(SQP)method,a multi-timescale multi-agent system(MAS)is developed,and its convergence to a critical point of the game is proven.To illustrate the qualities and efficacy of the theoretical findings,a numerical example is elaborated.

关键词： letter seeking programming

Prescribed-Time Fully Distributed Nash Equilibrium seeking Strategy in Networked Games

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2024年第1期11卷 261-263页

作者： Cheng Qian Lei Ding the Institute of Advanced Technology for Carbon Neutrality College of Automation&the College of Artificial Intelligence Nanjing University of Posts and TelecommunicationsNanjing 210023China IEEE

Dear Editor, This letter is concerned with prescribed-time fully distributed Nash equilibrium seeking for networked games under directed graphs. An adaptive algorithm is proposed to ensure the convergence of all players to the Nash equilibrium without requiring any knowledge of global parameters. Moreover, it is theoretically proved that the convergence time of the proposed seeking strategy can be predefined based on practical requirements. Finally, a numerical example is presented to validate the effectiveness of the proposed method.

关键词： parameters seeking prescribed

Undertaking the mission,innovating courageously,and seeking development

在线全文

学校读者我要写书评

暂无评论

International Journal of Nursing Sciences 2021年第1期8卷 3-4页

作者： Xiaoying Jiang The Chinese Nursing Journals Publishing House China

When the wind rises and sails,those who can,rise to the top!In this special period of saying goodbye to the old and welcoming the new,we will enter 2021 with hope.In the past year,under the leadership of the Chinese Nursing Association and strong support from all walks of life,all editorial teams for the series of journals that form the Chinese Nursing Journals Publishing House(including the Chinese Journal of Nursing,Chinese Journal of Nursing Education,Chinese Journal of Emergency and Critical Care Nursing,and International Journal of Nursing Sciences),together with the majority of authors and readers,have worked hard to shoulder the social responsibility and made great progress.We are profoundly grateful to all of you for continued supporting and excellent contribution to the journals.

关键词： seeking continued supporting

Fixed-Time Consensus-Based Nash Equilibrium seeking

在线全文

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2024年第1期11卷 267-269页

作者： Mengwei Sun Jian Liu Lu Ren Changyin Sun the Institutes of Physical Science and Information Technology Anhui UniversityHefei 230601China IEEE the School of Automation and the Key Laboratory of Measurement and Control of Complex System of Engineering Ministry of EducationSoutheast UniversityNanjing 210096China the School of Artificial Intelligence and the Engineering Research Center of Autonomous Unmanned System Technology Ministry of EducationAnhui UniversityHefei 230601China

Dear Editor,This letter examines the fixed-time stability of the Nash equilibrium(NE)in non-cooperative games.We propose a consensus-based NE seeking algorithm for situations where players do not have perfect information and communicate via a topology graph.The proposed algorithm can achieve NE in a fixed time that does not depend on initial conditions and can be adjusted in advance.

关键词： Fixed seeking letter