<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005">
<channel xmlns:cfi="http://www.microsoft.com/schemas/rss/core/2005/internal" cfi:lastdownloaderror="None">
<title cf:type="text"><![CDATA[Editorial department of the Journal of National University of Defense Technology -->信息与通信工程·控制科学与工程]]></title>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[State of the art and prospects of neural architecture search]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Neural architecture search is a task that aims to automatically search for the optimal neural network structure for different tasks, which is of great importance and inevitability in the joint development of deep learning and computer vision to the current stage. A comprehensive review of the research on neural network search was provided. In specific, the definition and significance of neural architecture search were introduced, and the difficulties and challenges faced in relevant research were deeply analyzed. Based on this, the mainstream search strategies was elaborate and summarize; Finally, the potential problems and possible future research directions were summarized and discussed to promote further development in this field.]]></description>
<pubDate>2024/11/27 0:00:00</pubDate>
<category><![CDATA[信息与通信工程·控制科学与工程]]></category>
<author><![CDATA[DING Ding,LIU Wenzhe,SHENG Changchong,SUI Jinping,LIU Li]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DING Ding,LIU Wenzhe,SHENG Changchong,SUI Jinping,LIU Li</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306013]]></guid><cfi:id>6</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Autonomous configuration planning for intelligent search and rescue robots in rough terrains]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to solve the configuration planning problem for intelligent search and rescue robots with assisted flippers to achieve autonomous obstacle crossing, a novel method for planning robot configuration during obstacle crossing was proposed that can be applied to complex terrains. The core of the proposed method is an adaptable and efficient robot pose prediction algorithm. By representing the terrain as a series of discrete point sets, a mathematical model for predicting the one-sided pose of the tracked robot was established; further, a fast solver for this model was proposed, which can predict 1000~1500 poses per second. Based on this, the evaluation metrics of the robot′s state and action in the obstacle-crossing process were established, and an optimization-based real-time flippers action planner was realized by using the dynamic programming algorithm and rolling optimization. The simulation and real-robot experiments show that the proposed approach enables the robot to control the flippers to cross rough terrains autonomously. It performs more smoothly than the reinforcement-learning method and manual operation when crossing obstacles.]]></description>
<pubDate>2024/11/27 0:00:00</pubDate>
<category><![CDATA[信息与通信工程·控制科学与工程]]></category>
<author><![CDATA[CHEN Bailiang,HUANG Kaihong,PAN Hainan,XIAO Junhao,WU Wenqi,LU Huimin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Bailiang,HUANG Kaihong,PAN Hainan,XIAO Junhao,WU Wenqi,LU Huimin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306014]]></guid><cfi:id>5</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Multi-reference-station based relative positioning method and impact analysis of the biases in priori baseline vectors]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to improve the reliability of the single-reference-station based relative positioning solutions over short baselines, the multi-reference-station based relative positioning method was explored. A priori baseline information between the reference stations was integrated into the observable model, thus giving the functional and stochastic models of the multi-reference-station based relative positioning. Based on that, the closed-form formula of the ambiguity dilution of precision for the positioning was derived so that the influence of the number of reference stations on the float ambiguity precision was revealed. Then the impacts of the biases in the a priori baseline information on the integer ambiguity resolution were analyzed theoretically. It show that the integer ambiguity resolution could barely be influenced on the condition that the bias is less than 5 cm. The multi-reference-station based relative positioning method was validated with both the simulated and real data sets. The numerical results show that, increasing the number of reference stations not only improves the single-frequency ambiguity resolution success rate and convergence rate, but also restrains the biases in the a priori baseline information. For example, the ambiguity resolution success rate is still larger than 92% even when the biases of the baseline components attain 4 cm in the field tests. This contribution provides the theoretical foundation for the fast and imprecise calibration between the multiple-reference-station in special scenarios.]]></description>
<pubDate>2024/11/27 0:00:00</pubDate>
<category><![CDATA[信息与通信工程·控制科学与工程]]></category>
<author><![CDATA[WU Shaoshi,FAN Bo,ZHONG Jilong,HOU Zhenwei,ZHANG Liang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Shaoshi,FAN Bo,ZHONG Jilong,HOU Zhenwei,ZHANG Liang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306015]]></guid><cfi:id>4</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Power output characteristics of high-rate pulse-discharged lithium battery]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Due to the existence of internal resistance and polarization, there will be a large voltage drop at the discharging moment of the lithium battery, especially the high-rate pulse-discharged lithium battery. The power characteristics of high-rate pulse-discharged lithium battery were studied, as well as the influence rules of temperature, state of charge and aging on battery power performance. The power characteristic curve of lithium battery was defined, a high-rate battery test plat-form was built, and experimental research was carried out from three impedance sensitive factors: temperature, state of charge and aging. The research methods and conclusions are of certain significance for the peak power evaluation and power curve prediction of lithium battery system.]]></description>
<pubDate>2024/11/27 0:00:00</pubDate>
<category><![CDATA[信息与通信工程·控制科学与工程]]></category>
<author><![CDATA[JIAO Shaoguang,LIU Yingquan,LU Junyong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>JIAO Shaoguang,LIU Yingquan,LU Junyong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306016]]></guid><cfi:id>3</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Analysis of high-speed railway network delay propagation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Noted the limitation of existing methods to study the delay propagation mechanism in high-speed railway network, the Bayesian network was used to analyze delay dependencies between stations based on high-speed train operation data and schedule data. The percolation theory of complex network was applied to study the evolution of delay propagation clusters. Nanjingnan Railway Station in the largest delay propagation cluster and Changshanan Railway Station in the second largest delay propagation cluster were taken as examples to analyze the network at percolation threshold. Based on core delay propagation clusters, the station delay state prediction model was established. The results show that stations can be divided into 3 categories, namely, delay generator, delay mediator and delay absorber according to their characteristic in the aspect of delay propagation. Delay generator can not only spread the delay to stations close to them, but also spread the delay to the far away stations through delay propagation chain, which makes the network taking part of the delay generator as the center and spreading delay to the delay mediator and the delay absorber in a radiational delay propagation mode.]]></description>
<pubDate>2024/11/27 0:00:00</pubDate>
<category><![CDATA[信息与通信工程·控制科学与工程]]></category>
<author><![CDATA[WANG Pu,TAN Huairui,GUO Bao,ZHOU Hui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Pu,TAN Huairui,GUO Bao,ZHOU Hui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306017]]></guid><cfi:id>2</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[KL divergence multi-block moving window slow feature analysis method for fault diagnosis]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A KL(Kullback-Leibler) divergence multi-block moving window slow feature analysis method was proposed to solve the problems that the variable feature information cannot be fully utilized by the traditional block segmentation method based on experience, the local information is ignored by a single modeling method, and the off-line model cannot adapt to the time-varying characteristics. KL divergence was used to measure the distance between variables in the normal working condition data set, and the minimum error sum criterion was introduced to cluster, which was divided into two sub-blocks with the minimum distance. On this basis, the slow feature analysis method was utilized to model each sub-block, and the optimal model was obtained by updating the sampled data with moving window. Monitoring statistics were calculated respectively, and the fault monitoring results were fused with support vector data description to achieve fault diagnosis. The proposed method was applied to the monitoring of Tennessee Eastman process, and higher fault detection rate and lower false alarm rate are obtained, verify the feasibility and effectiveness of this method.]]></description>
<pubDate>2024/11/27 0:00:00</pubDate>
<category><![CDATA[信息与通信工程·控制科学与工程]]></category>
<author><![CDATA[GUO Xingang,HUO Jinhua,CHENG Chao,XU Lianjie]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUO Xingang,HUO Jinhua,CHENG Chao,XU Lianjie</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202306018]]></guid><cfi:id>1</cfi:id><cfi:read>true</cfi:read></item>
</channel>
</rss>