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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

274 篇 会议
156 篇 期刊文献
6 篇 学位论文

馆藏范围

436 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

378 篇 工学
- 183 篇 计算机科学与技术...
- 119 篇 电气工程
- 79 篇 控制科学与工程
- 59 篇 信息与通信工程
- 32 篇 交通运输工程
- 26 篇 机械工程
- 25 篇 仪器科学与技术
- 25 篇 软件工程
- 18 篇 材料科学与工程（可...
- 15 篇 测绘科学与技术
- 14 篇 土木工程
- 13 篇 石油与天然气工程
- 11 篇 电子科学与技术（可...
- 9 篇 航空宇航科学与技...
- 8 篇 动力工程及工程热...
- 7 篇 化学工程与技术
- 7 篇 地质资源与地质工...
- 7 篇 生物医学工程（可授...
- 6 篇 水利工程
- 6 篇 环境科学与工程（可...
72 篇 理学
- 23 篇 数学
- 15 篇 物理学
- 10 篇 化学
- 10 篇 地理学
- 8 篇 地球物理学
- 7 篇 生物学
51 篇 管理学
- 46 篇 管理科学与工程(可...
16 篇 医学
- 8 篇 临床医学
8 篇 经济学
- 8 篇 应用经济学
5 篇 法学
3 篇 农学
2 篇 教育学
2 篇 文学
1 篇 艺术学

主题

436 篇 dijkstra algorit...
38 篇 path planning
34 篇 shortest path
17 篇 graph theory
14 篇 optimization
12 篇 genetic algorith...
10 篇 optimal path
10 篇 shortest path pr...
9 篇 a* algorithm
8 篇 routing
8 篇 route optimizati...
8 篇 wireless sensor ...
5 篇 maklink graph
5 篇 wireless sensor ...
5 篇 navigation
5 篇 optimal path pla...
5 篇 dynamic programm...
5 篇 simulated anneal...
5 篇 ant colony algor...
5 篇 path optimizatio...

机构

4 篇 brno university ...
3 篇 fukuoka inst tec...
3 篇 fukuoka inst tec...
3 篇 univ elect sci &...
3 篇 southwest petr u...
3 篇 school of north ...
2 篇 rajarajeswari co...
2 篇 qatar univ dept ...
2 篇 henan institute ...
2 篇 shenyang institu...
2 篇 democritus univ ...
2 篇 northeastern uni...
2 篇 school of north ...
2 篇 univ elect sci &...
2 篇 wuhan univ techn...
2 篇 beijing univ pos...
2 篇 univ essex sch c...
2 篇 northwestern pol...
2 篇 univ sfax digita...
2 篇 north china elec...

作者

6 篇 uchida kazunori
3 篇 hou xiaorong
3 篇 barolli leonard
3 篇 luo min
2 篇 raj pethuru
2 篇 hakim hela
2 篇 guo shi-ze
2 篇 selvarani r.
2 篇 yunjuan liang
2 篇 ouarzazi jamal
2 篇 yang yang
2 篇 zhang hanyu
2 篇 boujemaa hatem
2 篇 zhang ruifang
2 篇 georgiadi irene
2 篇 dechuan kong
2 篇 ji tianyi
2 篇 luo yaozhi
2 篇 yoo mintaek
2 篇 touati farid

语言

411 篇 英文
14 篇 其他
10 篇 中文
1 篇 西班牙文

检索条件"主题词=Dijkstra Algorithm"

共 436 条记录，以下是411-420 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

3D Geological and Laneway Model for Aided Mine Disasters Rescue

3D Geological and Laneway Model for Aided Mine Disasters Res...

引用

The Second International ISCRAM Workshop on Information Systems for Crisis Response and Management

作者： Suping Peng National Laboratory of Coal Resources and Mine Safety,China University of Minging and Technology Lianying Sun National Laboratory of Coal Resources and Mine Safety,China University of Minging and Technology Ming Huang National Laboratory of Coal Resources and Mine Safety,China University of Minging and Technology Qingzhi Liu National Laboratory of Coal Resources and Mine Safety,China University of Minging and Technology

To improve efficiency in aided mine disaster rescue,the 3D geological and laneway model was proposed and 3D visualization technique was integrated into *** order to effectively establishing topological relations between 3D laneway net node model and stratum lithology and nodes interrelation,3D complex geological entity model desiring was given emphases *** the 3D geological and laneway model and applying dijkstra algorithm,fast intelligent selection of lash-up rescue routes was *** is demonstrated that this system including 3D geological and laneway model and 3D visualization model is practicable.

关键词： Mine Disasters 3D geological model laneway model 3D visualization dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

DC Emergency Power Control Strategy for AC/DC Multi-Channel Interconnected System

DC Emergency Power Control Strategy for AC/DC Multi-Channel ...

引用

The 9th Asia-Pacific Power and Energy Engineering Conference (APPEEC 2017)

作者： Yicong Wang Dejun Shao Zhiqiang Zhang Youping Xu Xiaojie Pan Haishun Sun State Key Laboratory of Advanced Electromagnetic Engineering and Technology Huazhong University of Science and Technology Central China Branch of State Grid Corporation of China China Electric Power Research Institute

Inter-regional transmission line fault often results in power flow transferring,tie-line overloading and system islanding. Traditional control methods such asgenerator tripping and load shedding are costly, and also have undesirable impacts on theloadside. In this paper, a new emergency power control strategy is proposed for multi-channel interconnected system by using the overload capacity of non-fault DC lines. First of all, the capacity of emergency power control can be acquired by critical transmission power of a certain tie-line for stability. Secondly, the shortest electric distance can be calculated by dijkstra algorithm, and then the priority of emergency control of the DC lines can be obtained by the entropy weight method. When the inter-regional transmission power decreases and the effect of single DC line emergency control is poor, the multi-channel cooperative emergency control strategy is proposed to ensure the system stability. Simulation results verify the effectiveness of the method proposed.

关键词： DC Emergency Control Critical Stable Transmission Power dijkstra algorithm Entropy Weight Multi-Channel Cooperated Emergency Control

来源：评论

学校读者我要写书评

暂无评论

A Shortest Path algorithm Suitable for Navigation Software

A Shortest Path Algorithm Suitable for Navigation Software

引用

作者： Xin LU Chua sheng WU Software College University of Science and TechnologyLiaoning CHINA

In allusion to the shortage of hardware configuration in the mobile devices and high timecomplexity of dijkstra algorithm, the paper comes up with a shortest path algorithm based on cut-corner for restricted searching area. This algorithm aims at shrinking the smallest searching area quickly, and considers the advantages of Ellipse algorithm and Rectangle algorithm. When tested in the simulator, we find that the time-complexity of Cut-corner algorithm is reduced by 5%-20% compared with that of other conventional algorithms. Thus, it has better effect when used in navigation software of low-end mobile device.

关键词： dijkstra algorithm Restricted searching area Shortest path Android Navigation software

来源：评论

学校读者我要写书评

暂无评论

Multi-distribution Center Inventory Demand Forecast Model In Regional Logistics Network

Multi-distribution Center Inventory Demand Forecast Model In...

引用

2010 IEEE 17th International Conference on Industrial Engineering and Engineering Management(2010年IEEE第17届工业工程与工程管理国际学术会议)

作者： Xi HUANG An-quan ZOU Hai-tao LI Hui XIONG Department of Business Administration Changsha UniversityChangsha 410003China Changsha Institute o Changsha Institute of Logistics Technology and Application Changsha 410003China

This article is conducting a study on the demand forecast from the distribution network system composed of m-distribution centers and n-retailers. We analyze the characteristics of the regional logistics network. Use the dijkstra shortest path algorithm and gain the shortest path distribution, based on which the inventory demand forecasting model which can obtain the total demand of each distribution center is established. Finally, an example is given to show that the model is correct and feasible.

关键词： regional logistics network distribution center dijkstra algorithm demand forecast

来源：评论

学校读者我要写书评

暂无评论

A Path Planning Method for Substation Laser Inspection Robot Based on Improved Ant Colony algorithm

A Path Planning Method for Substation Laser Inspection Robot...

引用

2nd International Conference on Computer Engineering,Information Science & Application Technology(ICCIA 2017)

作者： Yan Deng Hongyu Hu Xiaolu Tian Jiake Liu Mingyang Liu Yafei Wang Shandong Luneng Intelligence Technology co. LTD Jiangxi Electric Power Company Lanzhou University

ISBN: (纸本)9781510845008

In order to shorten the inspection path and time-consuming, improve the intelligence degree of the laser inspection robot and apply to the large-scale TSP in the substation, the paper proposes a path planning method based on the improved ant colony algorithm, the navigation method, the walking characteristics, the inspection task and the road environment. This method uses the topological method to model the road environment. The dijkstra algorithm and the improved ant colony algorithm are used to plan the inspection path of the laser inspection robot. In this way, the laser inspection robot can re-plan the new inspection path for the remaining undetected task points after encountering an obstacle, and finally return to the starting point. In this paper, Visual Studio C++ is used to test the improved ant colony algorithm and Greedy algorithm. The results show that the improved ant colony algorithm has obvious advantages in path length and the number of passing points, which can realize that the inspection route of the laser inspection robot is optimal or sub-optimal. At the same time, the dynamic simulation of the method is carried out based on MATLAB. The simulation results show that the method can realize self-real-timely avoid obstacle and re-plan the new inspection route after encountering an obstacle. It can ensure the completion of the inspection task. And the method has good applicability, robustness and high efficiency.

关键词： Laser Inspection Robot Path plan Topology Undirected Graph Ant Colony algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Road Finding Under Complicated Constraints Based on Ant Colony algorithm

Research on Road Finding Under Complicated Constraints Based...

引用

2017 2nd International Conference on Computer, Mechatronics and Electronic Engineering(CMEE 2017)

作者： Ke WANG Yi-fan PENG Xiu-qi ZHANG Yougar School of Resources and Environment University of Electronic Science and Technology of China School of Optoelectronic Information University of Electronic Science and Technology of China School of computer Science and Engineering University of Electronic Science and Technology of China

This paper proposes a novel method which combines dijkstra algorithm(DA) and ant colony optimization(ACO) algorithm. This method is competent to satisfy the cost priority of path-finding under constraint and complex conditions. First, build a network pruning, and use the dijkstra algorithm to generate a secondary synthesis network diagram, and then make use of ant colony algorithm in the secondary synthesis network diagram to search for paths. Simulation results based on network topology show this improved algorithm is efficient and feasible to search for paths under complex constraints.

关键词： Complex constraint path-finding(CCP) Ant colony algorithm dijkstra algorithm Secondary synthesis network diagram

来源：评论

学校读者我要写书评

暂无评论

Research on dynamic energy saving path planning algorithm based on real-time traffic information

Research on dynamic energy saving path planning algorithm ba...

引用

2016 4th International Conference on Advanced Materials and Information Technology Processing(AMITP 2016)

作者： Lin Liu Yibin Zhang Huizong Feng School of Automation Chongqing University of Posts and Telecommunications

Path planning is an important way to alleviate traffic congestion, but the traditional path planning algorithm can only tell us the shortest distance path. Meanwhile, the traffic information is dynamic and changes over time, so the initial optimal path is likely to be invalid when traffic conditions change. A dynamic energy saving path planning algorithm(DESPP) based on real-time traffic information is proposed in this paper, which can plan the energy saving path for driver dynamically. A dynamic road network model is designed to reflect the actual traffic condition, and then an extended dijkstra algorithm is elaborated, by setting the fuel consumption for the calculation of weight, changing the storage structure of road data, and using the improved quick sort algorithm to sort the weights, so that fast search to the adjacent node can be realized, then the dynamic energy saving path planning algorithm(DESPP) will be obtained. The simulation results show that DESPP algorithm is able to get the energy saving path correctly and effectively. It reduces about 15.19% of the total fuel consumption compared with the traditional dijkstra algorithm. The DESPP algorithm can be applied in finding energy saving path for navigation system, which is more suitable for the actual need of drivers.

关键词： path planning energy saving path real-time traffic information dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

On Flight Route Planning Method of the Terrain Avoidance System

On Flight Route Planning Method of the Terrain Avoidance Sys...

引用

2014中国制导、导航与控制学术会议

作者： Dongcai Qu Dehai Yu Yuguang Feng Binwen Lu Department of Control Engineering Naval Aeronautical and Astronautical UniversityYantaiShandong ProvinceChina264001 Train DepartmentNaval Aeronautical and Astronautical University YantaiShandong ProvinceChina264001 Department of Ordnance Science and TechnologyNaval Aeronautical and Astronautical UniversityYantaiShandong ProvinceChina264001 College of Mechatronic Engineering and AutomationNational Univerisity of Defense TechnologyChangshaHunan ProvinceChina410000

ISBN: (纸本)9781479946983

It is an important step for flight route planning in the process of air terrain avoidance.A reference air route that can guarantee the flight safety,meet flight quality is the basis to accomplish the flying *** paper research the air route planning for flight terrain avoidance,classify and model to the terrain sampled point by using k mean-value algorithm,and set up the feasible point *** then using the dijkstra algorithm to find a high quality air route,based on considering the restrained conditions of *** the simulation,the feasibility and rationality of the scheme was verified

关键词： air safety aircraft control collision avoidance pattern clustering dijkstra algorithm air terrain avoidance feasible point space flight conditions flight quality flight route planning method flight safety flying task high quality air route k mean-value algorithm reference air route terrain avoidance system terrain sampled point Atmospheric modeling Classification algorithms Clustering algorithms Educational institutions Heart Path planning Planning flight safety air safety Aircraft control Atmospheric models flight conditions flight line Sorting algorithm Clustering algorithms Educational institutions dijkstra's algorithm Path planning Collision avoidance Airlines Cluster Analysis Heart

来源：评论

学校读者我要写书评

暂无评论

Analysis and Decision of Optimal Path of Forest Disaster Patrol Based on Beidou Navigation

Analysis and Decision of Optimal Path of Forest Disaster Pat...

引用

第三十九届中国控制会议

作者： Jinyi Ma Lifu Hu Bini Pan Zhongzhi Li Yuqing Tian Chunyu Chen Department of Automation Shenyang Aerospace University Department of Computer Science Shenyang Aerospace University

In this paper, a forest data map returned by Beidou satellites is combined with classic theories such as graph theory and mathematical planning, and the dijkstra algorithm, which is the most widely used in practice, is the core to propose a forest patrol optimal path planning model. And by comparing with the Floyd path planning algorithm, the correctness and implementability of the model are verified. The experimental results show that the algorithm effectively solves the problem of optimal path decision from a patrol base to an arbitrary forest area in a certain forest, and verifies that the dijkstra algorithm can be accurately and reliably applied to the optimal path planning field of forest patrol.

关键词： Beidou navigation Optimal path planning Forest patrol dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

The Mission Planning of Multi-wave Missile Launching Based on 0-1 Integer Programming

The Mission Planning of Multi-wave Missile Launching Based o...

引用

作者： Chunmei Chen Ping Yang Subing Liu Basic Disciplinary Department Rocket Force University of Engineering

In this paper, an optimization problem based on multi-wave missile launching mission planning and maneuvering route was studied. Firstly, a 0-1 integer programming model was established by using the global optimization, and then the exposure time was defined as three parts: Road maneuvering time, node waiting time and waiting time for shooting at the same time. Because the road maneuvering time was the main time of them, the shortest path based on it was solved by dijkstra algorithm. Finally, the results of global optimization were obtained by adjusting the latter two parts of time. The study of this problem provides a method for the task assignment problem with multi-waves, and can be extended to n waves easily.

关键词： 0-1 Programming the Shortest Route Optimization dijkstra algorithm the Exposure Time

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共44页 << < 35 36 37 38 39 40 41 42 43 44 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：