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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

55 篇 会议
52 篇 期刊文献
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

105 篇 工学
- 56 篇 计算机科学与技术...
- 38 篇 电气工程
- 23 篇 控制科学与工程
- 19 篇 信息与通信工程
- 14 篇 机械工程
- 13 篇 软件工程
- 11 篇 仪器科学与技术
- 11 篇 交通运输工程
- 5 篇 电子科学与技术（可...
- 5 篇 土木工程
- 5 篇 船舶与海洋工程
- 3 篇 材料科学与工程（可...
- 3 篇 动力工程及工程热...
- 3 篇 石油与天然气工程
- 3 篇 环境科学与工程（可...
- 3 篇 网络空间安全
- 2 篇 建筑学
- 2 篇 地质资源与地质工...
- 2 篇 航空宇航科学与技...
- 2 篇 安全科学与工程
17 篇 理学
- 5 篇 海洋科学
- 4 篇 数学
- 4 篇 化学
- 3 篇 物理学
- 3 篇 生物学
- 2 篇 地球物理学
16 篇 管理学
- 14 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
2 篇 教育学
- 2 篇 心理学(可授教育学...
1 篇 经济学
- 1 篇 理论经济学
1 篇 农学
1 篇 军事学

主题

108 篇 a-star algorithm
39 篇 path planning
8 篇 mobile robot
6 篇 fuzzy logic
6 篇 routing
4 篇 network lifetime
4 篇 heuristic functi...
4 篇 shortest path
4 篇 heuristic algori...
3 篇 robot arm
3 篇 tortuous failure...
3 篇 snap-width
3 篇 optimization
3 篇 wireless sensor ...
3 篇 mobile navigatio...
3 篇 inverse kinemati...
3 篇 global positioni...
3 篇 geographic infor...
3 篇 genetic algorith...
3 篇 task allocation

机构

2 篇 beihang univ sch...
2 篇 nanchang hangkon...
2 篇 school of inform...
2 篇 guilin univ elec...
2 篇 hebei univ sci &...
1 篇 sardar vallabhbh...
1 篇 jiangsu ocean un...
1 篇 univ antwerp dep...
1 篇 univ sci & techn...
1 篇 liaocheng vocati...
1 篇 tsinghua univ sc...
1 篇 khon kaen univ f...
1 篇 college of compu...
1 篇 seoul natl univ ...
1 篇 ningbo madeit se...
1 篇 bina nusantara u...
1 篇 nanjing univ aer...
1 篇 shandong univ sc...
1 篇 hebei prov key l...
1 篇 southwest jiaoto...

作者

3 篇 zhang zhe
3 篇 wu jian
2 篇 suarez-burgoa lu...
2 篇 montoya-araque e...
2 篇 zhou zhide
2 篇 qian junyan
2 篇 pan wei
2 篇 zhang yan
2 篇 alshawi imad s.
2 篇 ma zewen
2 篇 li ling-ling
2 篇 chaichawananit j...
2 篇 he cheng
2 篇 lin hsiung-cheng
2 篇 yan lianshan
2 篇 zhao jiang
2 篇 luo bin
2 篇 dai jiyang
2 篇 zhao lingzhong
2 篇 saiyod saiyan

语言

102 篇 英文
4 篇 其他
2 篇 中文

检索条件"主题词=A-Star Algorithm"

共 108 条记录，以下是71-80 订阅

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

详细简洁

排序：

Shortest Path Discovery in Consideration of Obstacle in Mobile Social Network Environments 13th

Shortest Path Discovery in Consideration of Obstacle in Mobi...

引用

13th European-Alliance-for-Innovation (EAI) International Conference on Collaborative Computing - Networking, Applications and Worksharing (CollaborateCom)

作者： Sun, Dawei Qu, Wentian Gao, Shang Liu, Li China Univ Geosci Sch Informat Engn Beijing 100083 Peoples R China Deakin Univ Sch Informat Technol Geelong Vic 3216 Australia Univ Sci & Technol Beijing Sch Automat & Engn Beijing 100083 Peoples R China

ISBN: (纸本)9783030009168;9783030009151

The issue of shortest path discovery in consideration of obstacle is one of the problems for location-based services in mobile social network environments. Currently, most research focuses on quickly discovering the shortest path in obstacle free area with reasonable latency, while the obstacle issue, especially the obstacles that enter temporarily is not fully considered. This creates the need for investigation on shortest path discovery at the same time avoiding detected obstacles. In this paper, a shortest path discovery approach is proposed. The following contributions are made: (1) Modeling the shortest path discovery problem in consideration of obstacle. (2) Discovering the shortest path using an improved a-star algorithm with reasonable latency. (3) Evaluating the accuracy rate of shortest path discovery with acceptable latency for a location-based service in a mobile social network. Experimental results conclusively demonstrate the efficiency and effectiveness of the proposed approach.

关键词： Mobile social network Location-based service Shortest path discovery a-star algorithm

来源：评论

学校读者我要写书评

暂无评论

An Intelligent Vision System to Navigate a Robot Without On-Board Sensors 4

An Intelligent Vision System to Navigate a Robot Without On-...

引用

4th International Conference on Computer Science and Engineering (UBMK)

作者： Masri, Ibrahim Erdal, Erdal Kirikkale Univ Dept Comp Engn Kirikkale Turkey

ISBN: (纸本)9781728139647

This paper presents a smart system to navigate a robot without sensors using a vertical camera and real-time data processing to identify static and dynamic obstacles. To identify the obstacles, image processing techniques are used such as background subtraction and morphological operations in real-time. After detecting the obstacles, the optimal path is determined, and control commands are sent to the robot accordingly. The navigation path of the robot from the start point (robot current location) to the destination point is determined based on graph theory. A graph is created to cover all possible routes in the work area, then a-star algorithm is utilized to find the optimal path. The optimal path is updated continuously to account for any moving obstacles that could obstruct the robot's path.

关键词： Real time image processing Avoid obstacles Graph theory a-star algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient Task Allocation and Path Planning for Unmanned Surface Vehicle in Supply Chain 25

Efficient Task Allocation and Path Planning for Unmanned Sur...

引用

25th IEEE International Conference on Mobile Data Management (IEEE MDM)

作者： Xidias, Elias Zissis, Dimitris Univ Aegean Dept Prod & Syst Design Engn Syros Greece

ISBN: (纸本)9798350374551;9798350374568

The rapid development of autonomous transportation systems is currently motivating several research initiatives. This paper presents an approach for efficient task allocation and path planning for an Unmanned Surface Vehicle (USV) which is requested to transfer products in an island group in the Aegean Sea. The proposed approach is based on a bi-level scheduling methodology, in the upper level, considering the weather conditions and the geographical characteristics of the area we create a square (from/to) travel time matrix. In the lower level, considering travel times we develop a Genetic algorithm to achieve the USV's task allocation and path planning. Experimental results demonstrate the effectiveness of our approach in guiding the USV's to efficiently accomplish short sea container transshipment in the island group of Cyclades.

关键词： Unmanned Surface Vessel Task Allocation Path Planning a-star algorithm Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Unmanned Ground Vehicle Local Trajectory Planning algorithm 5

Unmanned Ground Vehicle Local Trajectory Planning Algorithm

引用

5th Mediterranean Conference on Embedded Computing (MECO)

作者： Goll, Stanislav A. Leushkin, Vladimir S. Luksha, Sergey S. Borisov, Alexandr G. Ryazan State Radio Engn Univ Dept Informat Measuring & Biomed Engn Ryazan Russia

ISBN: (纸本)9781509022212

Local trajectory is the base of motion UGV and several algorithms used to calculate desired land robot path. A common approach is to use a 2-D grid based algorithm, such a well-known A*. But problems arise due to specific kinematic of ground vehicle and nonideal movement realisation. In this paper presented an approach to local trajectory planning on base 2-D passability map with considering UGV kinematic constrains and also errors in the implementation of the path, computed for UGV motion.

关键词： autonomous ground vehicles local trajectory planning obstacle avoidance a-star algorithm trajectory smoothing

来源：评论

学校读者我要写书评

暂无评论

Towards Novel Meta-heuristic algorithms for Dynamic Capacitated Arc Routing Problems 16th

Towards Novel Meta-heuristic Algorithms for Dynamic Capacita...

引用

16th International Conference on Parallel Problem Solving from Nature (PPSN)

作者： Tong, Hao Minku, Leandro L. Menzel, Stefan Sendhoff, Bernhard Yao, Xin Univ Birmingham Sch Comp Sci Birmingham B15 2TT W Midlands England Honda Res Inst Europe GmbH D-63073 Offenbach Germany

ISBN: (纸本)9783030581145;9783030581152

TheCapacitated ArcRouting Problem (CARP) is an abstraction for typical real world applications, like waste collection, winter gritting and mail delivery, to allow the development of efficient optimization algorithms. Most research work focuses on the static CARP, where all information in the problem remains unchanged over time. However, in the real world, dynamic changes may happen when the vehicles are in service, requiring routes to be rescheduled. In this paper, we mainly focus on this kind of Dynamic CARP (DCARP). Some meta-heuristics solve (D)CARP by generating individuals that are sequences of tasks to be served as the individual representation. The split of this sequence into sub-sequences to be served by different vehicles needs to be decided to generate an executable solution, which is necessary for calculating individual's fitness. However, the existing split schemes for static CARP and DCARP are not capable of getting high quality feasible solutions for DCARP. Therefore, we propose two different split schemes in this paper - an optimal and a greedy split scheme. The optimal split scheme, assisted by a-star algorithm, can obtain the best vehicle routes from an ordered list. The greedy split scheme is not guaranteed to obtain optimal splits, but it is much more efficient. More importantly, it can keep the rank information between different individuals. Our experiments show that the greedy split scheme has good relative accuracy with respect to the optimal split scheme and that the two proposed split schemes are better than the existing DCARP split scheme in terms of the obtained solutions' quality.

关键词： Dynamic CARP Split scheme a-star algorithm Greedy search

来源：评论

学校读者我要写书评

暂无评论

DESIGN AND IMPLEMENTATION OF GPS&GIS-BASED MOBILE NAVIGATION SYSTEM

DESIGN AND IMPLEMENTATION OF GPS&GIS-BASED MOBILE NAVIGATION...

引用

IEEE International Conference on Network Infrastructure and Digital Content

作者： He, Li Wu, Jieming Fu, Xiaoling Beijing Forestry Univ Coll Informat Sci & Technol Beijing Peoples R China Tata Memorial Hosp Dept Surgical Oncol Bombay Maharashtra India

ISBN: (纸本)9781424448982

With the development of GPS, GIS and mobile network communication technology, it has been becoming, possible for mobile phone users to acquire the geographical information anytime and anywhere. This paper proposes a novel solution of embedded navigation system based on GPS/GIS that realizes some functions such as PDA data enquiry and parsing, terminal communication service, map application service, geographic information collection, embedded navigation electronic map etc. In this paper, we discuss the system topology architecture, technical scheme and the key realization technologies. At last, test results prove that the solution of embedded navigation system based on GPS/GIS is feasible and valid, and it can be installed in PDA, mobile phones and other portable information terminals.

关键词： geographic information system (GIS) mobile navigation system global positioning systems (GPS) geographic information collection a-star algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improved Multi-objective Evolutionary algorithm for A Robot Detect Path Planning Problem 41

An Improved Multi-objective Evolutionary Algorithm for A Rob...

引用

第41届中国控制会议

作者： Jinshuai Dong Hongguo Wang Quan-ke Pan School of Mechanical and Electrical Engineering and Automation Shanghai University Liaocheng Vocational & Technical College

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

In this paper,we study the path planning problem of the detection robot after the coal mine disaster,and arrange a robot to detect multiple target *** objective is to minimize the path length and the degree of danger ***,the a-star algorithm is used to obtain the path matrix of any two target *** an improved multi-objective optimization algorithm is proposed to find paths with Pareto optimal or near-optimal ***,the multi-objective optimization algorithm is compared with other multi-objective optimization *** experimental results demonstrate that the algorithm can effectively obtain the detection path and minimize the length of the path and the degree of danger.

关键词： Detection robot Path planning a-star algorithm Multi-objective optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

High-Speed Shortest Path Co-processor Design

High-Speed Shortest Path Co-processor Design

引用

3rd Asia International Conference on Modelling and Simulation

作者： Idris, Mohd Yamani Idna Abu Bakar, Suraya Tamil, Emran Mohd Razak, Zaidi Noor, Noorzaily Mohamed Univ Malaya Dept Syst & Comp Technol Fac Comp Sci & Informat Technol Kuala Lumpur Malaysia

ISBN: (纸本)9781424441549

Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. Most of the shortest path calculation is performed on general purpose processor where instructions must be run to read the input, compute the result, and set the output which later on will slow down the overall performance. Therefore, the authors proposed a hardware approach which implements FPGA technology to find the shortest path between two nodes. The FPGA approach will demonstrate how parallelism can be used to significantly reduce calculation steps compared to sequential effort. In this paper, a-star algorithm has been chosen for the shortest path calculation since it can achieve superior time running based on its heuristic behavior.

关键词： Shortest path a-star algorithm FPGA implementation

来源：评论

学校读者我要写书评

暂无评论

Cooperative Tactical Planning Method for UAV Formation 39

Cooperative Tactical Planning Method for UAV Formation

引用

39th Chinese Control Conference (CCC)

作者： Zhang, Zhe Wu, Jian Dai, Jiyang Ying, Jin He, Cheng Nanchang Hangkong Univ Sch Informat Engn Nanchang 330063 Jiangxi Peoples R China Beihang Univ Sch Reliabil & Syst Engn Beijing 100191 Peoples R China

ISBN: (纸本)9789881563903

This paper addresses a hierarchical structure for the cooperative tactical planning to solve the problem of autonomous control and decision-making of unmanned aerial vehicles(UAVs) in modem air combat. Firstly, the hierarchical relationship between the operational and tactical levels is discussed according to the offline and online operational planning of UAV, and the iterative optimization scheme of operational objectives is proposed. Additionally, some feasible methods of UAV formation cooperative operation are studied in three-dimensional space, which includes the allocation of combat resources, formation cooperative task allocation, and route planning. Further combined with the a-star algorithm, the cooperative combat experiment of UAV formation is carried out in different threat scenarios. Finally, simulation results verify the effectiveness of the tactical planning method.

关键词： Unmanned combat aerial vehicle hierarchical structure task allocation path planning a-star algorithm

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Sampling Strategy With Optimized Probabilistic Roadmap Method 12

A Hybrid Sampling Strategy With Optimized Probabilistic Road...

引用

12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Yuan, Fang Liang, Jia-Hong Fu, Yue-Wen Xu, Han-Cheng Ma, Ke Natl Univ Def Technol Coll Informat Syst & Management Changsha 410073 Hunan Peoples R China Aviat Univ Air Force Changchun 130022 Jilin Peoples R China

ISBN: (纸本)9781467376822

Probabilistic Roadmap Method(PRM) is sampling-based techniques being extensively used for virtual humans field. In this paper, we present a hybrid sampling strategy with PRM for multi-agent path planning in a complex environment. The two aspects are optimized: first, we propose a hybrid sampling strategy which is composed of bridge test sampling and non-uniform sampling to enhance milestones in narrow passages and boundary regions;second, we propose a optimized a-star algorithm which is able to remove redundant milestones to plan a proper path. Our planner is tested on five agents in complex environment. Preliminary experiments show that the hybrid sampling strategy enables effectively increase the number of milestones in crucial space, and the optimized a-star algorithm is able to availably shorten the length of path.

关键词： multi-agent path planning probabilistic roadmap method a-star algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共11页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：