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

IEEE Conference on Global Communications (GLOBECOM)

作者： Kengo Nakamura Takeru Inouey Masaaki Nishino Norihito Yasuda NTT Communication Science Laboratories NTT Corporation Kyoto Japan NTT Network Innovation Laboratories NTT Corporation Japan

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

As the reliability requirements increase for communication networks, e.g., the seven 9’s reliability for 6G, network operators must evaluate the reliability of their networks more accurately. Since public-communication networks are designed to be less prone to large-scale outages, their (un)reliability should be evaluated per outage scale (the number of disconnected nodes). Traditionally, scale-wise unreliability has been evaluated approximately or requires several hours due to its computational hardness. This paper proposes an efficient algorithm that exactly evaluates scale-wise unreliability by leveraging the given reliability requirements for computation acceleration. We first define a sub-problem that computes the probability of disconnecting x or more nodes and introduce a core algorithm that solves this problem with binary decision diagrams. The core algorithm is used to evaluate the scale-wise unreliability according to the given requirements, e.g., the outage probability or outage scale. The time complexity is theoretically analyzed, and its performance is experimentally verified. The proposed algorithm successfully evaluates in 82 minutes large benchmark networks with 400 links and the seven 9’s requirements; the state-of-the-art algorithm fails to evaluate it within 12 hours.

关键词： Network topology Reliability theory Probability approximation algorithms Power system reliability Topology Computational efficiency Global communication Communication networks Time complexity

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Properties of Recursive Particle Maximum Likelihood Estimation

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2021年第3期67卷 1825-1848页

作者： Tadic, Vladislav Z. B. Doucet, Arnaud Univ Bristol Sch Math Bristol BS8 1TW Avon England Univ Oxford Dept Stat Oxford OX1 3LB England

Using stochastic gradient search and the optimal filter derivative, it is possible to perform recursive maximum likelihood estimation in a non-linear state-space model. As the optimal filter and its derivative are analytically intractable for such a model, they need to be approximated numerically. In Poyiadjis et al. (G. Poyiadjis, A. Doucet, and S. S. Singh, Biometrika, vol. 98, no. 1, pp. 65-80, 2011), a recursive maximum likelihood algorithm based on a particle approximation to the optimal filter derivative has been proposed and studied through numerical simulations. This algorithm and its asymptotic behavior are here analyzed theoretically. Under regularity conditions, we show that the algorithm accurately estimates maxima of the underlying log-likelihood rate when the number of particles is sufficiently large. We also provide qualitative upper bounds on the estimation error in terms of the number of particles.

关键词： Maximum likelihood estimation State-space methods approximation algorithms Hidden Markov models Markov processes Kernel Convergence Non-linear state-space models recursive maximum likelihood estimation sequential Monte Carlo methods system identification

来源：评论

学校读者我要写书评

暂无评论

Two Approaches of Ant Colony Optimization for Sorting Center Path Finding

Two Approaches of Ant Colony Optimization for Sorting Center...

引用

Innovative Research in Applied Science, Engineering and Technology (IRASET),Conference on

作者： Illya V. Tykhonov Mariia S. Khristenko Evgeniya A. Tsybulko Taras S. Afanasenko Aleksandr V. Khelvas Matvey V. Gantsev IPMCE Moscow Russian Federation HSE Moscow Russian Federation INTC Intelligent Electronics-Valdai Velykii Novgorod Russian Federation COS&HT Dolgoprudnii Russian Federation SOCCOS Moscow Russian Federation

ISBN: (数字)9798350309508

ISBN: (纸本)9798350309515

Over the past few years, there has been a trend toward increasing levels of warehouse automation, especially in large e-commerce distribution centers. Our subject of interest is robotic sorting systems, in which autonomous or centrally controlled mobile robots are used for automatic sorting. The report examines several autonomous and centralized approaches to solving problems using mobile robots for mail sorting centers. The Ant Colony Optimization (ACO) algorithm was modified to run a swarm to deliver a large set of mail pieces with different types of mail delivery target distributions. ACO algorithms are compared with a traditional centralized robot control system based on Dijkstra's approach. It is shown that centralized algorithms have approximately twofold superiority in performance on the selected 9×9 and 12×12 model warehouses. At the same time, the complexity of centralized management algorithms leads to the need to use modern high-performance systems and imposes restrictions on the use of simulation methods to build higher-level postal logistics management solutions.

关键词： Geometry Ant colony optimization Analytical models approximation algorithms Mobile robots Task analysis Statistics

来源：评论

学校读者我要写书评

暂无评论

A Deep Reinforcement Learning-Based Whittle Index Policy for Multibeam Allocation

A Deep Reinforcement Learning-Based Whittle Index Policy for...

引用

International Conference on Information Fusion

作者： Yuhang Hao Zengfu Wang Jing Fu Quan Pan School of Automation Northwestern Polytechnical University Xi’an China School of Engineering Royal Melbourne Institute of Technology University Melbourne Australia

ISBN: (数字)9781737749769

ISBN: (纸本)9798350371420

In this paper, a non-myopic beam scheduling policy is proposed for multi-target tracking (MTT) in a phased-array radar network, seeking to minimize the discounted sum of tracking error of targets and improve the long-term tracking performance. The Whittle index policy based on the restless multiarmed bandit (RMAB) model can decompose the state space of the underlying optimization problem into independent spaces with reduced sizes. We consider the tracking error covariance (TEC) matrix as the state of each target (arm), which evolves based on the Kalman filter. However, for a real-world MTT, the exact calculation of the Whittle index in multiple dimensions is challenging. The neural network is established to achieve the feature extraction of TEC states and learn the corresponding Whittle index. The deep reinforcement learning (DRL) method is exploited to train the neural network by leveraging the threshold property of the Whittle index policy and engaging in interactions with a single target tracking environment. We propose the DRL-based Whittle index policy, namely DRLWI, aiming to solve the beam allocation problem for MTT with multi-dimensional TEC states. This approach effectively mitigates the exponential computational complexity of classical dynamic programming approaches and the low convergence rate caused by large joint state and action spaces in the simple application of DRL algorithms. Numerical results demonstrate the performance of the proposed DRLWI policy surpasses that of DRL algorithms and myopic policies.

关键词： Training Target tracking Heuristic algorithms Simulation Neural networks Radar Radar tracking approximation algorithms Indexes Resource management

来源：评论

学校读者我要写书评

暂无评论

Research on Heading Adaptive Control for Unmanned Surface Vehicles

Research on Heading Adaptive Control for Unmanned Surface Ve...

引用

Artificial Intelligence, Networking and Information Technology (AINIT), International Seminar on

作者： Qian Xiang Jinghua Tie Yong Tang Zhenguo Wang College Information Science and Engineering Wuchang Shouyi University Wuhan China Information Technology Department Wuhan Nanhua Industrial Equipments Engineering CO. LTD. Wuhan China School of Electrical and Automation Hubei Normal university Wuhan China

ISBN: (数字)9798350385557

ISBN: (纸本)9798350385564

Addressing the issues of nonlinearity., uncertainty., and high dynamics in the heading control of unmanned surface vehicles (USV)., a strategy is proposed that combines Particle Swarm Optimization (PSO) algorithm with Radial Basis Function (RBF) neural network for precise heading control of unmanned surface vehicles. Firstly., an RBF network is designed for quasi-real-time modeling of the USV motion model. PSO algorithm is applied to optimize the parameters of the heading PID controller for USV. To validate the effectiveness of the proposed control strategy., a series of experiments are conducted. The results demonstrate that the designed RBF -PSO-PID controller exhibits superior dynamic response characteristics and stability in the heading control of USV compared to the BP-PID controllers., offering practical significance for high-precision heading control and traj ectory tracking of USV.

关键词： Adaptation models Heuristic algorithms Dynamics Radial basis function networks approximation algorithms Stability analysis Vehicle dynamics

来源：评论

学校读者我要写书评

暂无评论

An Interval-Peak-Based Algorithm for Range Image Reconstruction of GM-APD Lidar

An Interval-Peak-Based Algorithm for Range Image Reconstruct...

引用

Academic International Symposium on Optoelectronics and Microelectronics Technology (AISOMT)

作者： Shihang Sun Jianfeng Sun Peng Jiang Hongchao Ni Xin Zhou Le Ma Ruobin Lin National Key Laboratory of Laser Spatial Information Harbin Institute of Technology Harbin Heilongjiang China Zhengzhou Research Institute Harbin Institute of Technology Zhengzhou Henan China Science and Technology on Complex System Control and Intelligent Agent Cooperation Laboratory Beijing China

ISBN: (数字)9798331542283

ISBN: (纸本)9798331542290

GM-APD lidar has single-photon sensitivity, so that it can obtain 3D information of distant targets. On the other hand, the laser echo of targets is easily drowned by noise. In order to solve this problem, an interval-peak-based algorithm for range image reconstruction is proposed in this paper. Firstly, in the photon counts histogram, the x-axis is divided into small intervals and the peak value of each interval is taken. This step weakens the bad characteristic caused by the trigger probability. Secondly, according to the data feature, the trigger probability ratio coefficient and the neighborhood correlation coefficient are obtainned. Finally, the range image can be extracted by the peak method after the peak value of each interval is multiplied with this two coefficients. It is verified by the experimental data that when the SNR of target echo data is 0.022, the recovery ratio of the proposed algorithm can reach 80%, which is 25% higher than the matching filter algorithm. The proposed algorithm has a good application prospect in the range image reconstruction of GM-APD lidar.

关键词： Laser radar Three-dimensional displays Sensitivity Filtering Logic gates approximation algorithms Spatiotemporal phenomena Image reconstruction Signal to noise ratio Photonics

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Sparse and Conventional Channel Estimation algorithms in Wireless MIMO Channel Models

Comparative Analysis of Sparse and Conventional Channel Esti...

引用

Mobile Networks and Wireless Communications (ICMNWC), IEEE International Conference on

作者： Vaibhav N Patil Vishal R Sanjay M Belgaonkar Shrehari BM Vipula Singh Department of ECE RNS Institute of Technology Bengaluru India Department of AI & ML BMS Institute of Technology and Management Bengaluru India

ISBN: (数字)9798331528348

ISBN: (纸本)9798331528355

In the present scenario, Multiple Input Multiple Output (MIMO) systems are in use because of the high data capacity and efficiency of the system. There is a special importance on correct channel estimation to in getting the highest performance out of these systems. Seeking efficient solutions to this problem, various practitioners have resorted to the application of sparse signal processing that makes use of the sparsity character of wireless channels. This paper focuses on the scope of sparse signal processing in the field of wireless communications with special focus on this study on the BP and OMP algorithms while comparing them to LS and ZF estimation. The simulations are conducted in several surroundings including urban and rural as well as in free space. A clear impact of sparse signal processing in alleviating the training requirements and the computing cost has been achieved with BP considered to be the most effective tool for compressed sensing. In this regard, the effectiveness of sparse approaches in MIMO channel estimation is anticipated.

关键词： Wireless sensor networks Accuracy Signal processing algorithms Channel estimation Matching pursuit algorithms Estimation approximation algorithms Real-time systems Computational complexity Tuning

来源：评论

学校读者我要写书评

暂无评论

Investigation of Optical Flow Performance

Investigation of Optical Flow Performance

引用

International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science

作者： Olena Mazurkiewicz Lev Volkov Viktor Lysohor Volodymir Baliar Roman Fokin Radioelectronic systems and technologies department State University of Intellectual Technologies and Telecommunications Odesa Ukraine

ISBN: (数字)9798331520564

ISBN: (纸本)9798331520571

This article provides the quantitative evaluation of traditional real-time optical flow algorithms performed for the purpose of application in automated systems for object movement tracking. The paper discusses possible performance metrics for optical flow estimation by moving vector and provides guidelines for their selection, defines possible criteria for testing video sequences selection and includes relative evaluations and conclusions.

关键词： Accuracy Search methods Video sequences approximation algorithms Vectors Real-time systems Telecommunications Object tracking Optical flow Testing

来源：评论

学校读者我要写书评

暂无评论

An Improved Short-Course Path Planning Algorithm for Unmanned Sailboats with Adjustable Center of Gravity Position

An Improved Short-Course Path Planning Algorithm for Unmanne...

引用

IEEE International Conference on Unmanned Systems (ICUS)

作者： Zhongjie Li Yang Zhao Ying Gong Fan Shen Yan Peng Min Wang School of Mechatronic Engineering and Automation Shanghai University Shanghai P.R. China Institute of Artificial Intelligence Shanghai University Shanghai P.R. China

ISBN: (数字)9798350384185

ISBN: (纸本)9798350384192

This paper proposes an improved short-course path planning algorithm for unmanned sailboats based on polar plot of the coefficient of thrust of arc-shaped sails to reduce the number of large-angle direction changes. The algorithm plans better paths in any wind direction, allowing unmanned sailboats to reach their destinations faster. This work introduces, for the first time, a method to adjust the sailboat's center of gravity to utilize lateral forces for reducing drift and turning time, particularly in headwinds. Furthermore, it addresses the drift caused by lateral forces to enhance heading accuracy, enabling the sailboat to reach within a 0.5-meter radius of the target point. Simulation results demonstrate that the algorithm enables the unmanned sailboat to reach its destination faster and with lower energy consumption, achieving a reduction in arrival time ranging from 20% to 50% compared to the original algorithm.

关键词： Energy consumption Torque Navigation Simulation Turning approximation algorithms Distance measurement Trajectory Planning Gravity

来源：评论

学校读者我要写书评

暂无评论

Inversion of Oblique Ionograms Using the Newton-Raphson Optimizer

Inversion of Oblique Ionograms Using the Newton-Raphson Opti...

引用

International Symposium on Antennas, Propagation and EM Theory (ISAPE)

作者： Xiao Han Shikai Wang Na Wei China Research Institute of Radio Wave Propagation Qingdao China

ISBN: (数字)9798350353129

ISBN: (纸本)9798350353136

The inversion of oblique ionograms allows for extraction of ionospheric state information and retrieval of electron density profiles at midpoints along oblique sounding paths, However, traditional inversion methods often face the problems of large computation and slow convergence. This paper presents an enhanced Newton-Raphson-based optimizer (NRBO) algorithm with dynamically adjusted decision factors (DF). It compares the inversion results with those obtained from various optimization algorithms. Experimental results demonstrate that the new algorithm outperforms the improved Particle Swarm Optimization (PSO) algorithm in both inversion accuracy and computational speed. In a multi-layer Quasi-Parabolic Segment (QPS) ionospheric model inversion scenario, even with an observation error increase of 10 km, the inverted electron density profiles closely approximate the true values, showcasing robust noise resistance. Thus, this method proves suitable for practical oblique ionogram inversion based on actual measurements.

关键词： Accuracy Atmospheric measurements Heuristic algorithms Noise approximation algorithms Particle measurements Electrical resistance measurement Particle swarm optimization Ionosphere Electrons

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：