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

Workpiece localization algorithms: Performance evaluation and reliability analysis

JOURNAL OF MANUFACTURING SYSTEMS 1999年第2期18卷 113-126页

作者： Chu, YX Gou, JB Li, ZX Hong Kong Univ Sci & Technol Dept Elect & Elect Engn Clearwater Bay Kowloon Peoples R China

Workpiece localization plays an important role in automation of many manufacturing processes, such as workpiece setup, refixturing, dimensional inspection, and robotic assembly/manipulation. This paper provides unified treat ment of three geometric algorithms for workpiece localization. Local convergence of these localization algorithms is shown, and new techniques are developed to make these local algorithms globally convergent. A method is presented for analyzing the reliability of localization solutions. Along with extensive simulation results, the performance of the algorithms is studied and analyzed in terms of accuracy, convergence, and computational efficiency. The Hong-Tan algorithm has better accuracy and computational efficiency than two other algorithms tested. Finally, the experimental implementation of the algorithms is performed, and the experimental results are presented to confirm the proposed global convergence method and the reliability analysis method.

关键词： workpiece localization dimensional inspection localization algorithm performance evaluation reliability analysis

来源：评论

学校读者我要写书评

暂无评论

An algorithm for Target localization in Sensor Networks Based on Overlap Area Boundary of Sensor Detection

An Algorithm for Target Localization in Sensor Networks Base...

引用

9th International Conference for Young Computer Scientists

作者： Li, Quanlong Yu, Luo Xu, Xiaofei Zhao, Zhijia Harbin Inst Technol Sch Comp Sci & Technol Harbin Peoples R China

ISBN: (纸本)9781424441983

A novel localization algorithm for moving target in sensor networks is proposed, which is based on overlap area boundary of sensor detection. The algorithm inherits the advantage of binary sensing model that sensor nodes only need provide 0 or 1 information to represent whether detect a target or not, and improves the location precision compares to traditional centroid localization algorithm that can only locate a tat-get position between inlet-section area of sensor nodes. According to the spatio-temporal continuity of the trajectory of a moving target, the algorithm determines a dynamic queue of sensor nodes those have detected the target in order, and shrinks the possible location of a tat-get into a boundary of intersection area of all nodes in the queue. In this way, the algorithm achieves better location precision than traditional centroid localization algorithm. Results of simulation experiments prove the truth of better location precision of this algorithm. Moreover, the algorithm has the features of good expansibility and robustness by avoiding whole net time synchronization instead of local communication between nodes.

关键词： Sensor Networks localization algorithm Target localization Target Tracking

来源：评论

学校读者我要写书评

暂无评论

A Low Complexity Adjustable algorithm for localization in Wireless Cellular Networks 2

A Low Complexity Adjustable Algorithm for Localization in Wi...

引用

2017 IEEE 2nd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC 2017)

作者： Jin Ren Yunan Wang Liang Feng Wenle Bai Shan Meng School of Electronic and Information Engineering North China University of Technology

ISBN: (纸本)9781509064151;9781509064144

In these years, wireless applications based on subscriber location information have been receiving more attention. One of the most popular research areas is radio location techniques of wireless cellular networks. RBF neural network(Radial Basis Function Network) is a typical supervised learning feedforward neural network. Taylor-series expansion location algorithm based on the RBF neural network was proposed in some papers. In this paper, an adjustable localization algorithm with more accurate and lower cost is proposed. The simulation results indicate that this algorithm can obtain different RMSE performance with decision threshold E. When threshold E is low value, the performance is better than Chan's algorithm, LS's algorithm, Taylor's algorithm and LS-Taylor's algorithm in NLOS environment.

关键词： RBF localization algorithm Taylor-series expansion positioning accuracy

来源：评论

学校读者我要写书评

暂无评论

Stitching orders in patch-and-stitch localization algorithms for wireless sensor networks

Stitching orders in patch-and-stitch localization algorithms...

引用

5th Workshop on Positioning, Navigation and Communication 2007 (WPNC 08)

作者： Kwon, Oh-Heum Song, Ha-Joo Pukyong Natl Univ Div Elect Comp & Telecommun Engn Pusan South Korea

ISBN: (纸本)9781424417988

In localization algorithms following the "patch-and-stitch" strategy, the network is divided Into small overlapping subregions. For each subregion, the algorithm builds a local structure called a patch which Is actually an embedding of the nodes It spans In a relative coordinate system. Then, the patches are stitched together to form a single global map. In this class of algorithms, the stitching order makes a great Influence on the performance of the algorithm. In this paper, we present a formal framework to deal with stitching orders. In our framework, each stitching scheme consists or a stitching policy and a potential function. The potential function is to predict how well a patch Will be stitched If patches are stitched according to a given partial order. The stitching policy Is a mechanism that determines the stitching order based on the predictions by the potential function. We present various stitching schemes and evaluate their performances though simulations.

关键词： wireless sensor network localization algorithm distributed algorithms patch and stitch

来源：评论

学校读者我要写书评

暂无评论

A Survey on localization algorithms for Wireless Ad Hoc Networks

A Survey on Localization Algorithms for Wireless Ad Hoc Netw...

引用

1st International Conference on Communications and Information Processing (ICCIP 2012)

作者： Pei, Yanlin Beijing Univ Posts & Telecommun Int Sch Dept Telecommun Engn & Management Beijing 100088 Peoples R China

ISBN: (纸本)9783642319679

In wireless ad hoc networks, location service is used to confirm geographical position and data information of a specific node for efficient routing. However, since in some specific circumstances ad hoc network localization cannot just rely on global positioning system (GPS), self-localization algorithm is a focus during wireless ad hoc research process and supplies solution for the problem. This paper integrates some existing prevalent self-localization algorithms and introduces some representative algorithms, then evaluates the algorithms and makes a comparison, at last educes a conclusion.

关键词： wireless ad hoc networks localization algorithm non-GPS

来源：评论

学校读者我要写书评

暂无评论

Performances of localization algorithms in a Prototype WSN System

Performances of Localization Algorithms in a Prototype WSN S...

引用

International Conference on Advanced Materials and Engineering Materials (ICAMEM 2011)

作者： Ye, Jingzhi Zhao, Ling Luo, Wenfeng S China Univ Technol Ctr Control & Optimizat Guangzhou 510640 Guangdong Peoples R China

ISBN: (纸本)9783037853559

The proliferation of wireless sensor networks (WSNs) has fostered the demand of context aware applications, among which localization plays a significant role. localization in WSN is facing the challenges of (1) error and noise;(2) dynamic environments;(3) data packet loss. However, most presented localization algorithms are verified just by simulation but practical systems. To validate the localization algorithms realistically, a prototype WSN system equipped with a group of sensor nodes is deployed in this paper. A trilateration based optimization approaches and the Extended Kalman Filter (EKF) with position-velocity (PV) model are proposed and tested in the system comparing with the traditional trilateration. The experiment result indicates that the two proposed localization algorithms have much better accuracy than the traditional trilateration and, in a certain aspect, EKF with PV model is the most suitable algorithm among the three algorithms for localization in the prototype system.

关键词： trilateration localization algorithm Extended Kalman Filter prototype system wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of localization algorithms with Measurement Errors in WSNs

Performance Evaluation of Localization Algorithms with Measu...

引用

7th International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM)

作者： Zhao, Erdun Zheng, JunHong Yao, Juan Liu, Xinxin Cent China Normal Univ Dept Comp Sci Wuhan Peoples R China Wuhan Digital Engn Res Inst Wuhan Peoples R China

ISBN: (纸本)9781424462520

Node localization is an important area in wireless sensor networks (WSNs). Because there are unavoidable measurement errors by the popular distance measurement techniques such as RSSI and TOA, the localization precision is the main evaluation criteria for localization algorithms. In this paper, we compare the performances of localization algorithms in different error models by simulation and show that some algorithms are more sensitive to measurement errors than others. The localization errors are more serious when measurement error models are different for distance from various beacon nodes. We give a nonlinear optimal model for this case and employ the Newton Iteration algorithm to solve this problem. Simulation shows it is better when give different weights to different error models can give a better measurement precision.

关键词： Wireless sensor networks localization algorithm measurement error models Newton Iteration algorithm

来源：评论

学校读者我要写书评

暂无评论

Study on node localization algorithms in wireless sensor network

Study on node localization algorithms in wireless sensor net...

引用

International Conference on Mechatronics Engineering and Computing Technology (ICMECT)

作者： Jian, Deng Chongqing Business Vocat Coll Chongqing 400036 Peoples R China

ISBN: (纸本)9783038351153

This paper introduces an improved localization algorithm that bases on distance and local coordinate system which is built up by beacon nodes. This algorithm evaluates the differences of several independent localization information to determine whether upgrade this node as beacon nodes according to the size of the difference whether beyond the prescribed or not. It can effectively prevent and reduce the accumulated and spread error in localization process by the audit of beacon nodes, and improve the positioning accuracy of nodes in the network.

关键词： wireless sensor networks node localization localization algorithm

来源：评论

学校读者我要写书评

暂无评论

Analysis of OSSDL and IVCN Self-localization algorithms in Wireless Sensor Networks

Analysis of OSSDL and IVCN Self-localization Algorithms in W...

引用

2nd International Conference on Computer Science and Network Technology (ICCSNT)

作者： Hua, Wu Zhang Guangyuan Yang, Liu Xiao Hairong Xing Jianping Hui, Zhang Shandong Univ Sch Informat Sci & Elect Engn Jinan 250100 Peoples R China

ISBN: (纸本)9781467329644;9781467329637

A range-free three dimensional localization scheme based on optimum space step distance (OSSDL) and an improved node self-localization algorithm based on virtual central node (IVCN) for wireless sensor network (WSN) are proposed in our previous papers. By analyzing classic two dimensional DV-Hop localization algorithm, OSSDL algorithm realizes localization. Especially by optimizing distances from the 3D network model, the optimum space step distance from nodes to anchors in OSSDL is obtained and the coordinates of all unknown nodes can be derived finally. However in IVCN localization algorithm, by deducing a 3D special node in the cube which is virtually formed by eight anchor nodes, which is called virtual central node, unknown nodes can compute their own estimated positions automatically. In this paper, a comprehensive analysis of OSSDL and IVCN are presented to explore their true performances. We also have made comparisons with classic DV-Hop and Centroid algorithms with several parameters changed under the same simulation environments. The index of positioning accuracy is addressed. From simulation results, IVCN performs better on localization accuracy than OSSDL, which is definitely much better than that of original DV-Hop.

关键词： WSN localization algorithm OSSDL IVCN performance analysis

来源：评论

学校读者我要写书评

暂无评论

Proximity-Distance Mapping and Jaya Optimization algorithm Based on localization for Wireless Sensor Network

引用

INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE 2022年第6期36卷

作者： Peng, Duo Gao, Yuwei Lanzhou Univ Technol Sch Comp & Commun Lanzhou 730050 Peoples R China

Aiming at the problem of large location errors of traditional ranging-free algorithms in Wireless Sensor Network (WSN), a novel node location algorithm based on proximity-distance mapping (PDM) and Jaya optimization was proposed. In this algorithm, proximity and Euclidean distance are extracted from the relationship of anchor nodes to construct a mapping matrix by using the idea of PDM. It is calculated by using the mapping matrix that the estimated distance from the unknown node to the anchor node can be used for the subsequent calculations. After the estimated distance is obtained, the Jaya optimization algorithm is imported to calculate the location of the unknown one. To accelerate the convergence and enhance the accuracy of the algorithm, the idea of a boundary box is used to limit the initial feasible region of unknown nodes. The experiment results show that the PDM-Jaya algorithm has better positioning accuracy than the original PDM in the same condition.

关键词： Wireless sensor network localization algorithm Jaya optimization algorithm proximity-distance mapping

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：