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

optimal selection algorithm of logistics distribution route based on machine vision

JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2023年第1期23卷 37-50页

作者： Li, Hua Xichang Univ Sch Informat Technol Xichang 615000 Sichuan Peoples R China

In order to improve the centralized planning ability of logistics distribution path data, improve the efficiency of logistics distribution and reduce the cost of logistics distribution, this paper proposes an optimal path selection algorithm based on machine vision. Using machine vision technology to calibrate the coordinates of logistics distribution path, combined with EMD decomposition method and wavelet denoising method to remove redundant data in logistics distribution data, particle swarm optimization algorithm to complete logistics distribution path planning, and ant colony algorithm to realize the optimal path selection of logistics distribution. The experimental results show that the average distribution cost of this method is only 766.7 yuan, the distribution time is less than 0.3 h, and the customer satisfaction is as high as 98%, which shows that this method can effectively optimize the distribution path.

关键词： Machine vision logistics distribution distribution path optimal selection algorithm

来源：评论

学校读者我要写书评

暂无评论

A Crossing Azimuth based optimal Base Station selection algorithm for 5G Positioning 35

A Crossing Azimuth based Optimal Base Station Selection Algo...

引用

35th Chinese Control and Decision Conference (CCDC)

作者： Song, Bao Wang, Bo Beijing Inst Technol Sch Automat Beijing Peoples R China

ISBN: (纸本)9798350334722

We propose an optimal selection method for 5G base station data to achieve high-accuracy positioning estimation in indoor and outdoor environments. The proposed method is mainly composed of three sequential modules, namely initial positioning estimation, measurement data optimization and estimated position update. Initial positioning estimation uses the raw measurement data and the basic mathematical model with position estimation to work out the mobile vehicle position. The measurement data optimization module takes the number of buildings in the azimuth threshold area set between the initial position of the mobile vehicle and the 5G base station position as the judgment condition to achieve the re-selection of data. The estimated position update implements the initial estimated position update of the mobile vehicle by using the preferred data and the basic mathematical model with pose estimation. The results of the simulations show that the performance of the localization results of the solution mode with preferred data is significantly better than that of the solution mode using the initial data measurement.

关键词： Crossing Azimuth 5G Positioning optimal selection algorithm Chan-Taylor

来源：评论

学校读者我要写书评

暂无评论

A Crossing Azimuth based optimal Base Station selection algorithm for 5G Positioning

A Crossing Azimuth based Optimal Base Station Selection Algo...

引用

第35届中国控制与决策会议

作者： Bao Song Bo Wang School of Automation Beijing Institute of Technology

We propose an optimal selection method for 5 G base station data to achieve high-accuracy positioning estimation in indoor and outdoor *** proposed method is mainly composed of three sequential modules,namely initial positioning estimation,measurement data optimization and estimated position *** positioning estimation uses the raw measurement data and the basic mathematical model with position estimation to work out the mobile vehicle *** measurement data optimization module takes the number of buildings in the azimuth threshold area set between the initial position of the mobile vehicle and the 5 G base station position as the judgment condition to achieve the re-selection of *** estimated position update implements the initial estimated position update of the mobile vehicle by using the preferred data and the basic mathematical model with pose *** results of the simulations show that the performance of the localization results of the solution mode with preferred data is significantly better than that of the solution mode using the initial data measurement.

关键词： Crossing Azimuth 5G Positioning optimal selection algorithm Chan-Taylor

来源：评论

学校读者我要写书评

暂无评论

Massive MIMO Antenna selection: Switching Architectures, Capacity Bounds, and optimal Antenna selection algorithms

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2018年第5期66卷 1346-1360页

作者： Gao, Yuan Vinck, Han Kaiser, Thomas Univ Duisburg Essen Inst Digital Signal Proc D-47057 Duisburg Germany

Antenna selection is a multiple-input multiple-output (MIMO) technology, which uses radio frequency (RF) switches to select a good subset of antennas. Antenna selection can alleviate the requirement on the number of RF transceivers, thus being attractive for massive MIMO systems. In massive MIMO antenna selection systems, RF switching architectures need to be carefully considered. In this paper, we examine two switching architectures, i.e., full-array and sub-array. By assuming independent and identically distributed Rayleigh flat fading channels, we use asymptotic theory on order statistics to derive the asymptotic upper capacity bounds of massive MIMO channels with antenna selection for the both switching architectures in the large-scale limit. We also use the derived bounds to further derive the upper bounds of the ergodic achievable spectral efficiency considering the channel state information (CSI) acquisition. It is also showed that the ergodic capacity of sub-array antenna selection system scales no faster than double logarithmic rate. In addition, optimal antenna selection algorithms based on branch-and-bound are proposed for both switching architectures. Our results show that the derived asymptotic bounds are effective and also apply to the finite-dimensional MIMO. The CSI acquisition is one of the main limits for the massive MIMO antenna selection systems in the time-variant channels. The proposed optimal antenna selection algorithms are much faster than the exhaustive-search-based antenna selection, e.g., 1000 x speedup observed in the large-scale system. Interestingly, the full-array and sub-array systems have very close performance, which is validated by their exact capacities and their close upper bounds on capacity.

关键词： Massive MIMO antenna selection full-array and sub-array switching architectures capacity bound optimal selection algorithm

来源：评论

学校读者我要写书评

暂无评论

Paired-relay-selection schemes for two-way relaying with network coding

引用

IET COMMUNICATIONS 2015年第6期9卷 888-896页

作者： Jiang, Yunxiang Lau, Francis Chung Ming Sattar, Zeeshan Ho, Ivan Wang-Hei Zhou, Qing Feng Hong Kong Polytech Univ Dept Elect & Informat Engn Hong Kong Hong Kong Peoples R China HeFei Univ Technol HFUT Sch Comp & Informat Dept Commun Engn Hefei Peoples R China Hong Kong Polytech Univ Shenzhen Res Inst Hong Kong Hong Kong Peoples R China

To exchange information between two sources in a two-way relaying network with multiple potential relays, most researches focus on two-hop relay system with single-relay-selection (SRS) scheme. Comparing with SRS scheme, the authors first design a paired-relay-selection (PRS) scheme in which a pair of best' relays broadcast network-coded information to other nodes (source or relay). They propose an optimal selection algorithm and a suboptimal algorithm that selects the pair of best' relays in the PRS scheme and they describe how the nodes exchange information in a frame consisting of four timeslots. Both the analytical and simulation results show that when the pathloss exponent is large and/or there is a sufficient number of relays to choose from, using two relay nodes can provide a lower outage compared with using only one relay node even under the same total transmit power in uniformly distributed relay networks. In addition, to reduce the overhead of the PRS scheme, they propose an iterative-PRS (I-PRS) scheme in which the paired relay is selected in an iterative and opportunistic way. Simulation results show that the I-PRS scheme has nearly the same outage performance as the PRS scheme under time-invariant channels and significantly outperforms the PRS scheme under time-varying channels.

关键词： relay networks (telecommunication) network coding broadcast communication iterative methods time-varying channels wireless channels paired-relay-selection scheme two-way relaying network multiple potential relay two-hop relay system single-relay-selection scheme SRS scheme broadcast network-coded information optimal selection algorithm suboptimal algorithm one-dimensional space 1D space 2D space path-loss exponent uniformly distributed relay network iterative-PRS scheme I-PRS scheme iterative method time-invariant channel scheme time-varying channel

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：