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

A generalized S-d assignmentd* algorithm for multisensor-multitarget state estimation

IEEE TRANSACTIONS ON AEROSPACE ANd ELECTRONIC SYSTEMS 1997年第2期33卷 523-538页

作者： deb, S Yeddanapudi, M Pattipati, K BarShalom, Y UNIV CONNECTICUT DEPT ELECT & SYST ENGNSTORRSCT 06269

We develop a newd* algorithm to associate measurements from multiple sensors to identify the real targets in a surveillance region, and to estimate their states at any given time. The central problem in a multisensor-multitarget state estimation problem is that of data association-the problem of determining from which target, if any, a particular measurement originated, The data association problem is formulated as a generalized 5-dimensional (S-d) assignment problem, which is NP-hard for S greater than or equal to 3 sensor scans (i.e., measurement lists). We present an efficient and recursive generalized S-d assignmentd* algorithm (S greater than or equal to 3) employing a successive Lagrangian relaxation technique, with application to the localization of an unknown number of emitters using multiple high frequency direction tinder sensors (S = 3, 5, and 7).

关键词： relaxation theory sensor fusion state estimation surveillance target tracking algorithm data association generalized S-d assignmentd* algorithm localization multiple high frequency direction finder sensors multiple sensors multisensor-multitarget state est relaxation theory Target tracking algorithms State estimation Sensor fusion data association Relaxation Techniques

来源：评论

学校读者我要写书评

暂无评论

A new 3d watermarkingd* algorithm

A new 3D watermarking algorithm

引用

3dTV Conference - True Vision - Capture, Transmission and display of 3d Video

作者： Burdescu, dumitru dan Stanescu, Liana Ion, Anca Tanasie, Razvan Univ Craiova Fac Automat Comp & Elect Craiova Romania

ISBN: (纸本)9781424417605

In this paper, an original spatial watermarking technique adapted for 3d images is presented. This technique lowers the computational complexity that normally rises with the traditional watermarkingd* algorithms. This newd* algorithm produces an invisible watermark that is robust to various kinds of attacks. The technique uses a slice-based approach to 3d watermarking. The proposed technique modifies pixels of the 3d object by a spatial watermark insertion. Spatial mask of suitable size is used to hide data with less visual impairments.

关键词： digital watermark digital images algorithm robustness

来源：评论

学校读者我要写书评

暂无评论

NASA Technical Reports Server (Ntrs) 19940010375: the development of a Scalable Parallel 3-d Cfd* algorithm for Turbomachinery. M.S. Thesis Final Report

引用

2016年

NASA Technical Reports Server (Ntrs) 19940010375: the development of a Scalable Parallel 3-d Cfd* algorithm for Turbomachinery. M.S. Thesis Final Report by NASA Technical Reports Server (Ntrs); published by

关键词： (ntrs) 19940010375: algorithm algorithms computational fluid dynamics development final flow distribution inviscid flow luke, edward allen nasa technical reports server (ntrs) parallel processing (computers) three dimensional flow transonic flow turbomachinery

来源：评论

学校读者我要写书评

暂无评论

NASA Technical Reports Server (Ntrs) 20140008892: 4d Bada-Based Trajectory Generator and 3d Guidanced* algorithm

引用

2016年

NASA Technical Reports Server (Ntrs) 20140008892: 4d Bada-Based Trajectory Generator and 3d Guidanced* algorithm by NASA Technical Reports Server (Ntrs); NASA Technical Reports Server (Ntrs); published by

关键词： (ntrs) 20140008892: air traffic control airline operations airspace algorithm algorithms bada-based collision avoidance dynamic models flight paths generator johnson, marcus a. mathematical models nasa technical reports server (ntrs) national airspace system palacios, eduardo sepulveda pilotless aircraft root-mean-square errors trajectory control trajectory planning unmanned aircraft systems

来源：评论

学校读者我要写书评

暂无评论

NASA Technical Reports Server (Ntrs) 19920021910: demonstration of a 3d Visiond* algorithm for Space Applications

引用

2017年

NASA Technical Reports Server (Ntrs) 19920021910: demonstration of a 3d Visiond* algorithm for Space Applications by NASA Technical Reports Server (Ntrs); published by

关键词： (ntrs) 19920021910: aerospace environments algorithm algorithms applications computer vision computerized simulation defigueiredo, rui j. p. [editor] demonstration image processing nasa technical reports server (ntrs) pattern recognition polyhedrons robot sensors technology utilization three dimensional bodies

来源：评论

学校读者我要写书评

暂无评论

A NOVEL 2-d GENETICd* algorithm FOR STANdARd PE PLACEMENT IN OPTOELECTRONIC MCM

引用

Journal of Shanghai Jiaotong university(Science) 2000年第2期5卷 103-107页

作者：徐勇放黄培中 National Lab.on Local Fiber-Optic Comm.Networks & Advanced Optical Comm.Systems Inst.of Optical FiberTech. Shanghai Jiaotong Univ.Shanghai 200030China

In order for optical interconnection technologies to be incorporated into the next generation parallel computers, new optoelectronic computer aided design, integration, and packaging technologies must be investigated. One of the key issues in designing is the system volume, which is determined by maximum interconnection distance(MId) between PEs. A novel 2 d geneticd* algorithm was presented in this paper at the first time, and used to solve the placement of twin butterfly multistage networks based on transmissive physical model. The experiment result shows that thisd* algorithm case works better than otherd* algorithm cases.

关键词： placement genetic algorithm optoelectronic MCM(OEMCM) document code:A

来源：评论

学校读者我要写书评

暂无评论

Terrain Based d ∗d* algorithm for Path Planning

引用

IFAC-PapersOnLine 2016年第1期49卷 178-182页

作者： C. Saranya Manju Unnikrishnan S. Akbar Ali d.S. Sheela dr. V.R. Lalithambika Scientist/Engineer SCG ISRO Satellite Centre India Deputy Division Head CGFSD Vikram Sarabhai Space Centre India Division Head CGFSD Vikram Sarabhai Space Centre India Group Director Control and Guidance Design Group Vikram Sarabhai Space Centre India Deputy Director Control Guidance and Simulation Entity Vikram Sarabhai Space Centre India

Path planningd* algorithms provide autonomy in mobile robots to reach targets even in unknown environments. Path planning using grid based techniques such as A ∗ and d ∗ , are cost function based, which is primarily a function of the distance to be travelled to reach the target. Robots targeted for outdoor environments should consider the terrain features also during path planning. In this paper, a modified approach of d ∗ path planningd* algorithm is proposed. In addition to distance to be travelled, terrain slope estimate is also used in cost function computation to plan the path. Thed* algorithm was simulated and tested with different terrain slopes. Results with different test scenarios are also brought out.

关键词： Terrain based Path planning d ∗ algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Contactd* algorithm for 3d Finite Element Modeling of Bottomhole Assemblies: Validation and Application

引用

SPE JOURNAL 2025年第3期30卷 1237-1255页

作者： Zhang, He Tian, Kaixiao Bhaidasna, Ketan Halliburton Houston TX 77032 USA

Static analysis of the lateral deformation of a bottomhole assembly (BHA) is essential for controlling borehole trajectories in directional drilling. A major technical challenge in static BHA modeling is efficiently determining the contact configuration between the BHA and the borehole wall. This configuration, including contact locations and orientations, is not known a priori and introduces nonlinearities into the analysis. Mostd* algorithms addressing the contact problem in BHA modeling are proprietary and lack detailed descriptions. Explicitd* algorithms based on the Newton-Raphson iteration method and linear/nonlinear complementarity problem formulations have limitations, such as computational inefficiency and the need for predefined contact locations. In this paper, we derive governing differential equations for 3d BHA static deformation, incorporating nonlinear effects from borehole curvature, axial forces, and both discrete and continuous contacts. The finite element method (FEM) is used to solve these equations under appropriate boundary conditions. Within the finite element framework, the Lagrange multiplier method (LMM) is used to impose displacement constraints at contact points, while an innovative iterative process ensures the unilateral nature of the contacts. Thed* algorithm typically converges in O (10) each iteration involving the solution of approximately O (10(2)) iterations, with finite element equations, ensuring high computational efficiency. Thed* algorithm, grounded in principles of structural mechanics, is robust across a wide range of conditions, and its accuracy is validated against a published* algorithm. The proposed BHA model is further validated using downhole measurements. In one scenario, bending moment on bit (BOB) measurements from a BHA equipped with a rotary steerable system (RSS) shows strong agreement with the model results, both in magnitude and variation pattern, when a fixed displacement boundary condition is applied at the bit. In

关键词： geology contact point drilling operation trajectory design geologist directional drilling drillstring design deformation algorithm bit side force

来源：评论

学校读者我要写书评

暂无评论

Wave effect of gravitational waves intersected with a microlens field II:An adaptive hierarchical treed* algorithm and population study

引用

Science China(Physics,Mechanics & Astronomy) 2025年第1期68卷 237-250页

作者： Xikai Shan Guoliang Li Xuechun Chen Wen Zhao Bin Hu Shude Mao Purple Mountain Observatory Chinese Academy of SciencesNanjing 210023China Department of Astronomy Tsinghua UniversityBeijing 100084China Institute for Frontier in Astronomy and Astrophysics Beijing Normal UniversityBeijing 102206China School of Physics and Astronomy Beijing Normal UniversityBeijing 100875China School of Astronomy and Space Science University of Science and Technology of ChinaHefei 230026China CAS Key Laboratory for Researches in Galaxies and Cosmology Department of AstronomyUniversity of Science and Technology of ChinaChinese Academy of SciencesHefei 230026China

The gravitational lensing wave effect generated by a microlensing field embedded in a lens galaxy is an inevitable phenomenon in strong lensed gravitational waves(SLGWs).This effect presents both challenges and opportunities for the detection and appli-cation of ***,investigating this wave effect requires computing a complete diffraction integral over each microlens in the *** is extremely time-consuming due to the large number of microlenses(10^(3)-10^(6)).Therefore,simply adding all the microlenses is ***,the complexity of the time delay surface makes the lens plane resolution a crucial factor in controlling numerical *** this paper,we propose a trapezoid approximation-based adaptive hierarchical tree algo-rithm to meet the challenges of calculation speed and *** find that thisd* algorithm accelerates the calculation by four orders of magnitude compared to the simple adding method and is one order of magnitude faster than the fixed hierarchical treed* algorithm proposed for electromagnetic *** importantly,ourd* algorithm ensures controllable numerical errors,increasing confidence in the *** with our previous work(***.66,239511,2023),this paper addresses all numerical issues,including integral convergence,precision,and computational time1).Finally,we conducted a population study on the microlensing wave effect of SLGWs using thisd* algorithm and found that the microlensing wave effect cannot be ignored,especially for Type II SLGWs(from saddle position of the time delay surface)due to their intrinsic geometric structures and their typical intersection with a denser microlensing ***,more than 33%(11%)of SLGWs have a mismatch larger than 1%(3%)compared to the unlensed ***,we found that the mismatch between signal pairs in a doubly imaged GW is generally larger than 10^(−3),and 61%(25%)of signal pairs have a mismatch larger than 1%(3%).Theref

关键词： gravitational lensing diffractional integral algorithm gravitational wave

来源：评论

学校读者我要写书评

暂无评论

An improved meta-heuristicd* algorithm for energy optimization in smart grids considering photovoltaic, storage battery, and demand response

引用

JOURNAL OF ENERGY STORAGE 2025年 119卷

作者： Hafeez, Ghulam Ullah, Safeer Islam, Mazhar Khan, Farrukh Aslam Alsafran, Ahmed S. Alghamdi, Baheej Kraiem, Habib Univ Engn & Technol Dept Elect Engn Mardan 23200 Pakistan Quaid E Azam Coll Engn & Technol Dept Elect Engn Sahiwal 57000 Pakistan Shenzhen Univ China Coll Elect & Informat Engn Shenzhen 518060 Guangdong Peoples R China King Saud Univ Ctr Excellence Informat Assurance Riyadh 11653 Saudi Arabia Univ Tenaga Nas Coll Comp & Informat Kajang 43000 Selangor Malaysia King Faisal Univ Coll Engn Dept Elect Engn Al Hasa Saudi Arabia King Abdulaziz Univ Ctr Res Excellence Renewable Energy & Power Syst Smart Grids Res Grp Jeddah 21589 Saudi Arabia King Abdulaziz Univ Fac Engn Dept Elect & Comp Engn Jeddah 21589 Saudi Arabia Northern Border Univ Ctr Sci Res & Entrepreneurship Ar Ar 73213 Saudi Arabia

Residential load scheduling in smart power grids (SPGs), especially those incorporating renewable energy sources (RESs), storage battery, and demand response (dR) faces significant challenges due to the limitations of traditional optimizationd* algorithms. These challenges include premature convergence, high computational costs, imbalanced exploration and exploitation, lack of adaptability, and sensitivity to parameters. Such issues make it difficult to effectively manage energy consumption, alleviate peak loads, and reduce energy costs while maintaining user comfort. To address these challenges, we propose an improved particle swarm optimization (IPSO)d* algorithm that enhances exploration and exploitation balance through inertia weight adjustment, velocity damping, and the inclusion of crossover and mutation strategies. These enhancements prevent premature convergence and allow for faster, more accurate convergence to optimal solutions. The proposed IPSO is integrated into a power usage scheduler (PUS) for optimal residential load scheduling under an adaptive pricing scheme considering photovoltaic (PV) and storage battery, focusing on reducing peak energy usage, rebound peaks, energy costs, and user discomfort. The effectiveness of the IPSO-based PUS is demonstrated through a comparison with other optimizationd* algorithms such as genetic optimizationd* algorithm (GOA), particle swarm optimization (PSO), and wind-driven optimization (WdO). Results show that the IPSOd* algorithm consistently outperforms these alternatives in terms of energy consumption, peak energy alleviation, cost reduction, and grid stability, while also achieving faster execution times and superior convergence rates. This work provides a robust solution for residential load scheduling, offering significant insights and practical benefits for energy optimization in SPGs.

关键词： demand response distributed generation Energy storage Power usage scheduling Improved particle swarm optimization algorithm Storage battery Smart power grid

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：