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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

51 篇 期刊文献
48 篇 会议
3 篇 学位论文

馆藏范围

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

日期分布

学科分类号

98 篇 工学
- 52 篇 控制科学与工程
- 46 篇 计算机科学与技术...
- 30 篇 电气工程
- 14 篇 机械工程
- 9 篇 信息与通信工程
- 5 篇 仪器科学与技术
- 4 篇 交通运输工程
- 4 篇 航空宇航科学与技...
- 2 篇 土木工程
- 2 篇 船舶与海洋工程
- 2 篇 软件工程
- 1 篇 光学工程
- 1 篇 电子科学与技术（可...
- 1 篇 测绘科学与技术
- 1 篇 林业工程
- 1 篇 生物工程
- 1 篇 公安技术
20 篇 管理学
- 20 篇 管理科学与工程(可...
9 篇 理学
- 3 篇 数学
- 2 篇 海洋科学
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 地理学
2 篇 农学
- 1 篇 作物学
- 1 篇 林学
1 篇 医学
- 1 篇 临床医学

主题

102 篇 rapidly-explorin...
51 篇 path planning
14 篇 motion planning
11 篇 unmanned aerial ...
5 篇 mobile robot
4 篇 trajectory
4 篇 collision avoida...
4 篇 dynamic environm...
4 篇 obstacle avoidan...
3 篇 collision detect...
3 篇 plánování cesty
3 篇 planning
3 篇 trajectory plann...
3 篇 mobile robots
3 篇 autonomous explo...
2 篇 redundant manipu...
2 篇 performance base...
2 篇 manipulation pla...
2 篇 robot
2 篇 artificial poten...

机构

3 篇 univ chinese aca...
3 篇 chinese acad sci...
3 篇 brno university ...
3 篇 univ jinan sch e...
2 篇 kobe univ grad s...
2 篇 elect nav res in...
2 篇 beihang univ sch...
2 篇 xi an jiao tong ...
2 篇 jiangxi univ sci...
2 篇 tech univ catalo...
2 篇 jiangxi univ sci...
1 篇 hefei univ techn...
1 篇 harbin engn univ...
1 篇 south china univ...
1 篇 beirut arab univ...
1 篇 ohio state univ ...
1 篇 rochester inst t...
1 篇 hong kong polyte...
1 篇 univ sydney aust...
1 篇 politecn torino ...

作者

4 篇 li meng
4 篇 yang kwangjin
3 篇 sun qinpeng
2 篇 fan kuangang
2 篇 luciani sara
2 篇 gan seng keat
2 篇 mori ryota
2 篇 sun wen
2 篇 ryu hyejeong
2 篇 song qing
2 篇 si bailu
2 篇 feraco stefano
2 篇 amati nicola
2 篇 kim jinkyu
2 篇 joo sanghyun
2 篇 toratani daichi
2 篇 shang wei
2 篇 park frank c.
2 篇 chen meng
2 篇 saez raul

语言

98 篇 英文
3 篇 其他
1 篇 中文

检索条件"主题词=Rapidly-Exploring Random Tree"

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

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

详细简洁

排序：

Motion Planning and Task Allocation for a Jumping Rover Team

Motion Planning and Task Allocation for a Jumping Rover Team

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Tan, Kai Chuen Jung, Myungjin Shyu, Isaac Wan, Changhuang Dai, Ran Ohio State Univ Mech & Aerosp Engn Dept Columbus OH 43210 USA

ISBN: (纸本)9781728173955

This paper presents a cooperative robotic team composed of unmanned ground vehicles (UGVs) with hybrid operational modes to tackle the multiple traveling salesman problem (mTSP) with obstacles. The hybrid operational modes allow every UGV in the team to not only travel on a ground surface but also jump over obstacles. We name these UGVs jumping rovers. The jumping capability provides a flexible form of locomotion by leaping and landing on top of obstacles instead of navigating around obstacles. To solve the mTSP, an optimal path between any two objective points in an mTSP is determined by the optimized rapidly-exploring random tree method, named RRT*, and is further improved through a refined RRT* algorithm to find a smoother path between targets. We then formulate the mTSP as a mixed-integer linear programming (MILP) problem to search for the most cost-effective combination of paths for multiple UGVs. The effectiveness of the hybrid operational modes and optimized motion with assigned tasks is verified in an indoor, physical experimental environment using the customized jumping rovers.

关键词： Jumping Robots Multiple Traveling Salesman Problem Path Planning rapidly-exploring random tree Mixed-Integer Linear Programming

来源：评论

学校读者我要写书评

暂无评论

Path Planning in Large-Scale Indoor Environment Using RRT

Path Planning in Large-Scale Indoor Environment Using RRT

引用

第三十二届中国控制会议

作者： ZHAO Kaikai LI Yangmin Harbin Institute of Technology Shenzhen Graduate School Department of Electromechanical Engineering University of Macau School of Mechanical Engineering Tianjin University of Technology

ISBN: (纸本)9781479900305

This paper addresses the problem of implementing rapidly-exploring random tree(RRT) in a large-scale indoor *** details of environment modeling based on real indoor metric map are described,thereafter a novel method is used to construct a topological map.A series of tests indicate that RRT planner using this topological map can efficiently search for appropriate path by reducing the search space size.

关键词： rapidly-exploring random tree Path planning

来源：评论

学校读者我要写书评

暂无评论

Optimizing Initial Path Finding in Informed-RRT* with a Novel Map-Adaptive Sampling Technique 7

Optimizing Initial Path Finding in Informed-RRT* with a Nove...

引用

7th Iberian Robotics Conference

作者： Banfi, Tommaso Felice Dorati, Francesco Manzoni, Nicola Martinez-Gomez, Jesus Politecn Milan Dept Elect Informat & Bioengn Milan Italy Univ Castilla La Mancha Comp Syst Dept Albacete Spain

ISBN: (纸本)9798350376371;9798350376364

rapidly-exploring random trees (RRT) are extensively employed in robotics motion planning due to their efficacy in solving single-query problems. Informed-RRT* enhances RRT* by sampling within a hyperellipsoid to refine the current best solution. However, this method often encounters inefficiencies, particularly in the initial identification of a feasible path, and its subsequent refinement, due to the expansive size of the hyperellipsoid. This paper introduces an improved Informed-RRT* algorithm to address these specific challenges and enhance planning efficiency. The novel Probabilistic Ellipsoid Informed-RRT* (PEI-RRT*) accelerates the discovery of an initial solution through a probabilistic ellipsoid sampling technique. We also propose the Adaptive Probabilistic Ellipsoid Informed-RRT* (APEI-RRT*), which dynamically adjusts the ellipsoid size based on the environmental context. Numerical simulations comparing state-of-the-art Informed-RRT* with the proposed algorithms demonstrate that PEI-RRT* effectively identifies the initial solution, while APEI-RRT* excels in edge cases involving straight paths or complex environments. The results confirm that the proposed algorithms significantly enhance performance in terms of convergence rate.

关键词： Motion Planning rapidly-exploring random tree Informed-RRT Adaptive Probabilistic Ellipsoid Sampling

来源：评论

学校读者我要写书评

暂无评论

UAV Path Re-planning Based on Improved Bidirectional RRT Algorithm in Dynamic Environment 3

UAV Path Re-planning Based on Improved Bidirectional RRT Alg...

引用

3rd IEEE International Conference on Control, Automation and Robotics (ICCAR)

作者： Meng, Li Qing, Song Jun, Zhao Qin Univ Jinan Sch Elect Engn Jinan Peoples R China

ISBN: (纸本)9781509060887

An improved bidirectional RRT algorithm is proposed to solve the problem of path re-planning in a dynamic environment. The off-line path planning is carried out before the UAV takes off. During flight, if pop-up threat is detected, nodes which are affected by pop-up threat will be deleted and the remaining tree structure will be retained, then improved bidirectional RRT is used to path re-planning. A simple and efficient path pruning method is designed to delete redundant nodes on the path. The Bezier curve is used to smooth the path. Simulation results show that the proposed method can meet the demand of path re-planning in dynamic environment.

关键词： path planning unmanned aerial vehicle rapidly-exploring random tree dynamic environment

来源：评论

学校读者我要写书评

暂无评论

Environmental Complexity Based UAV Path Planning with Variable Step RRT 7

Environmental Complexity Based UAV Path Planning with Variab...

引用

7th International Conference on Electronic Information Technology and Computer Engineering (EITCE)

作者： Huang, Jingwen Lu, Jiajun Jia, Tianyi Li, Xiang Beijing Wuzi Univ Sch Logist Beijing Peoples R China

ISBN: (纸本)9798400708305

In response to the problem of three-dimensional path planning for unmanned aerial vehicles (UAVs) in complex environments, this paper proposes an environmental complexity based variable step rapidly-exploring random tree (RRT) path planning algorithm. Firstly, a model of environmental complexity function is established in a three-dimensional environment to measure the complexity of UAV flight environments. Then, an evaluation function for path planning is established. Based on the environmental complexity function and the evaluation function, the optimal step size for the RRT algorithm is found with the genetic algorithm. With a large number of simulated random environmental variables and the corresponding optimal step size, the environmental complexity based RRT step size function is identified and established that represents the relationship between the optimal step size of the RRT algorithm and the complexity of the environment. Based on the sliding window and the environmental complexity based RRT step size function, the variable step RRT path planning for UAVs is constructed. This algorithm can dynamically select the optimal step size according to the local environment, improving the overall performance of UAV path planning algorithms. Finally, comparative experiments are conducted to verify that the proposed algorithm is superior to the traditional on

关键词： Unmanned Aerial Vehicle Path Planning rapidly-exploring random tree Sliding Window Environmental Complexity

来源：评论

学校读者我要写书评

暂无评论

Sampling-Based Path Planning and Model Predictive Image-Based Visual Servoing for Quadrotor UAVs

Sampling-Based Path Planning and Model Predictive Image-Base...

引用

Chinese Automation Congress (CAC)

作者： Li, Mei Wu, Huai-Ning Liu, Zhou-Yang Beijing Univ Aeronaut & Astronaut Sci & Technol Aircraft Control Lab Beihang Univ Beijing 100191 Peoples R China Beijing Univ Aeronaut & Astronaut Sch Automat Sci & Elect Engn Beihang Univ Beijing 100191 Peoples R China

ISBN: (纸本)9781538635247

This paper incorporates sampling-based global path planning with model predictive image-based visual servoing (IBVS) for quadrotor unmanned aerial vehicles (UAVs) equipped with a fixed camera. The proposed method produces safe control inputs of quadrotor in obstacle environment by taking image feature kinematics into account. Firstly, we utilize a sampling based algorithm for optimal path planning, i.e., rapidly-exploring random tree (RRT*), to extend a search tree in camera space iteratively and generate a sequence of waypoints between the initial and desired poses of the camera. Afterwards, a model predictive IBVS scheme is proposed by optimizing a cost function of the predicted image trajectories under the constraints of visibility and velocity. The scheme can avoid the intractable problems of the classical IBVS approaches, especially when there are large displacements between the initial and the desired poses of the quadrotor UAV. The simulations on a quadrotor UAV demonstrate the validity and effectiveness of the proposed scheme.

关键词： path planning rapidly-exploring random tree image-based visual servoing model predictive control

来源：评论

学校读者我要写书评

暂无评论

Path Planning of Mobile Robot Based on RRT in Rugged Terrain 18

Path Planning of Mobile Robot Based on RRT in Rugged Terrain

引用

2nd International Conference on Computer Science and Application Engineering (CSAE)

作者： Li, Meng Sun, Qinpeng Song, Qing Wang, Zhaoliang Li, Yuan Univ Jinan Sch Elect Engn POB 250022 Jinan Shandong Peoples R China Shantui Construct Machinery Co Ltd POB 272000 Jining Shandong Peoples R China

ISBN: (纸本)9781450365123

The(1) basic RRT algorithm is difficult to realize the path planning of 3D environment. Aiming at the 3D path planning problem of mobile robot in complex environment. An improved RRT algorithm is proposed. Firstly, the 3D environment model is established for the path planning of mobile robot under complex rugged terrain, and the task requirements are analyzed. Then, based on the basic RRT algorithm, a new node acceptance criterion is proposed for the particularity of 3D environment. This acceptance criterion of new node take into account the variation of terrain height, the smooth of path, and the kinematics constraints such as turning radius and pitch angle of the mobile robot. Furthermore, the dynamic p(g) value design is carried out, and the process of improving the algorithm is given. At last, simulation results show the effectiveness of the proposed method. The generated path passes at low altitudes, avoiding peaks and rough terrain.

关键词： Path planning Mobile Robot rapidly-exploring random tree heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Hybrid Frontier Detection Strategy for Autonomous Exploration in Multi-obstacles Environment

Hybrid Frontier Detection Strategy for Autonomous Exploratio...

引用

IEEE International Conference on Robotics and Biomimetics (IEEE ROBIO)

作者： Xu, Guangjin Zhang, Liwei Chen, Meng He, Bingwei Fuzhou Univ Sch Mech Engn & Automat Fuzhou 350116 Peoples R China Inst Aerosp Syst Engn Shanghai ASES Shanghai Peoples R China

ISBN: (纸本)9781665405355

rapidly-exploring random tree (RRT) algorithm is widely used in path planning, while the RRT is inefficient for robotic exploration in large-scale environments with multi-obstacles and narrow entrances. Here, we propose a Hybrid Frontier Detection (HFD) strategy for autonomous exploration which incorporates a variable step-size random tree global frontier detector, a multi-root nodes random tree frontier detector, and a grid-based frontier detector algorithm. The proposed strategy enables a robot to quickly search for the frontier in real-time. Compared with the traditional RRT-based strategy, the exploration time and traveling length of the proposed HFD strategy are respectively decreased by over 15% and 12% in the simulation environment and decreased by over 14% and 11% under the same experimental conditions in the experimental environment. The results indicate that the HFD strategy effectively solves the problem of autonomous exploration in the environment with multi-obstacles and narrow entrances.

关键词： rapidly-exploring random tree autonomous robotic exploration autonomous navigation

来源：评论

学校读者我要写书评

暂无评论

An Improved Path Planning for Mobile Robots

An Improved Path Planning for Mobile Robots

引用

International Conference on Information Science and Cloud Computing Companion (ISCC-C)

作者： Zhou, Feng Gon, Lee Eun Shandong Inst Commerce & Technol Coll Informat Technol Jinan 250000 Peoples R China Univ Suwon Coll Econ & Business Adm Hwaseong 445743 South Korea

ISBN: (纸本)9781479952458

Path planning is one of the most important technologies in navigating mobile robot. which finds an optimal path to reach the destination within the shortest possible time. Based on the rapidly-exploring random tree (RRT) and Particle Swarm Optimizer (PSO), a path planning of the robot is proposed in this paper. The RRT which has strong global search capability algorithm is used to obtain the global navigation path, and the PSO algorithm which as strong local search capability is adopted to get a better path. Computer experiment results show that this novel algorithm can find an optimal path rapidly in short time. A successful obstacle avoidance is achieved, and the model is robust and performs reliably.

关键词： robot path planning rapidly-exploring random tree particle swarm optimizer

来源：评论

学校读者我要写书评

暂无评论

A Probability Adaptive Sampling-based Algorithm for Obstacle Avoidance Motion Planning Problems 38

A Probability Adaptive Sampling-based Algorithm for Obstacle...

引用

38th Chinese Control Conference (CCC)

作者： Mi, Kai Zheng, Jun Wang, Yunkuan Chinese Acad Sci Inst Automat Beijing 100190 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China

ISBN: (纸本)9789881563972

In recent years, with the increasingly complex robot application environments, the research of robotic autonomous obstacle avoidance motion planning is one of the key technologies to improve its intelligence. In this paper, we present an improved algorithm based on rapidly-exploring random tree (RRT) algorithm, which is called Probability Adaptive RRT (PARRT). We analyze the defects of the original algorithm in detail from the perspective of Voronoi diagram. For some complicated occasions, especially when the robot is surrounded by obstacles, the efficiency of the original algorithm will be greatly reduced. For this problem, we proposed an expansion probability adaptive method. By dynamically adjusting the extending probability of nodes near obstacles, the invalid node expansion is reduced effectively and the planning speed is greatly improved. Finally, we experiment in both two-dimensional space and the joint space of manipulators. The planning results show the improved effect of the proposed algorithm.

关键词： rapidly-exploring random tree Voronoi diagram motion planning extending probability probability adaptive

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：