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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

733 篇 会议
185 册 图书

馆藏范围

917 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

806 篇 工学
- 701 篇 控制科学与工程
- 306 篇 计算机科学与技术...
- 122 篇 电气工程
- 75 篇 机械工程
- 73 篇 仪器科学与技术
- 30 篇 软件工程
- 3 篇 交通运输工程
- 2 篇 航空宇航科学与技...
- 2 篇 生物医学工程（可授...
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 测绘科学与技术
- 1 篇 船舶与海洋工程
- 1 篇 生物工程
36 篇 理学
- 33 篇 数学
- 3 篇 物理学
- 1 篇 地球物理学
- 1 篇 生物学
1 篇 农学
- 1 篇 水产
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

89 篇 artificial intel...
75 篇 robotics and aut...
54 篇 robots
47 篇 control, robotic...
46 篇 motion planning
39 篇 robotics
30 篇 systems theory, ...
25 篇 mobile robots
19 篇 anthropomorphic ...
18 篇 control and syst...
15 篇 machinery and ma...
10 篇 robot programmin...
10 篇 antennas
9 篇 mapping
9 篇 multipurpose rob...
8 篇 cognitive psycho...
7 篇 cameras
7 篇 computational in...
7 篇 autonomous under...
7 篇 controllers

机构

34 篇 carnegie mellon ...
12 篇 univ penn grasp ...
11 篇 stanford univ de...
10 篇 mit 77 massachus...
9 篇 mit comp sci & a...
9 篇 carnegie mellon ...
8 篇 univ sydney aust...
8 篇 mit comp sci & a...
8 篇 stanford univ st...
7 篇 carnegie mellon ...
7 篇 univ calif berke...
7 篇 stanford univers...
6 篇 univ study berga...
5 篇 department of co...
5 篇 duke univ dept c...
5 篇 univ penn philad...
4 篇 univ n carolina ...
4 篇 queensland unive...
4 篇 mit csail 77 mas...
4 篇 mit cambridge ma...

作者

20 篇 kumar vijay
20 篇 rus daniela
12 篇 siegwart roland
11 篇 kelly alonzo
11 篇 peter corke
10 篇 sukkarieh salah
10 篇 corke peter
10 篇 van den berg jur
9 篇 michael nathan
9 篇 schwager mac
8 篇 thrun sebastian
8 篇 manocha dinesh
8 篇 goldberg ken
8 篇 oussama khatib
8 篇 alterovitz ron
7 篇 hauser kris
7 篇 laugier christia...
7 篇 mason matthew t.
7 篇 abbeel pieter
6 篇 hsu david

语言

898 篇 英文
20 篇 中文

检索条件"丛书名=Springer Tracts in Advanced Robotics"

共 918 条记录，以下是181-190 订阅

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

详细简洁

排序：

Fast Nearest Neighbor Search in SE(3) for Sampling-Based Motion Planning 11th

Fast Nearest Neighbor Search in SE(3) for Sampling-Based Mot...

引用

11th Workshop on Algorithmic Foundations of robotics (WAFR)

作者： Ichnowski, Jeffrey Alterovitz, Ron Univ N Carolina Chapel Hill NC USA

ISBN: (纸本)9783319165950;9783319165943

Nearest neighbor searching is a fundamental building block of most sampling-based motion planners. We present a novel method for fast exact nearest neighbor searching in SE(3)-the 6 dimensional space that represents rotations and translations in 3 dimensions. SE(3) is commonly used when planning the motions of rigid body robots. Our approach starts by projecting a 4-dimensional cube onto the 3-sphere that is created by the unit quaternion representation of rotations in the rotational group SO(3). We then use 4 kd-trees to efficiently partition the projected faces (and their negatives). We propose efficient methods to handle the recursion pruning checks that arise with this kd-tree splitting approach, discuss splitting strategies that support dynamic data sets, and extend this approach to SE(3) by incorporating translations. We integrate our approach into RRT and RRT* and demonstrate the fast performance and efficient scaling of our nearest neighbor search as the tree size increases.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Stochastic Extended LQR: Optimization-Based Motion Planning Under Uncertainty 11th

Stochastic Extended LQR: Optimization-Based Motion Planning ...

引用

11th Workshop on Algorithmic Foundations of robotics (WAFR)

作者： Sun, Wen van den Berg, Jur Alterovitz, Ron Univ N Carolina Chapel Hill NC USA Univ Utah Salt Lake City UT USA

ISBN: (纸本)9783319165950;9783319165943

We introduce a novel optimization-based motion planner, Stochastic Extended LQR (SELQR), which computes a trajectory and associated linear control policy with the objective of minimizing the expected value of a user-defined cost function. SELQR applies to robotic systems that have stochastic non-linear dynamics with motion uncertainty modeled by Gaussian distributions that can be state-and control-dependent. In each iteration, SELQR uses a combination of forward and backward value iteration to estimate the cost-to-come and the cost-to-go for each state along a trajectory. SELQR then locally optimizes each state along the trajectory at each iteration to minimize the expected total cost, which results in smoothed states that are used for dynamics linearization and cost function quadratization. SELQR progressively improves the approximation of the expected total cost, resulting in higher quality plans. For applications with imperfect sensing, we extend SELQR to plan in the robot's belief space. We show that our iterative approach achieves fast and reliable convergence to high-quality plans in multiple simulated scenarios involving a car-like robot, a quadrotor, and a medical steerable needle performing a liver biopsy procedure.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Featureless Motion Vector-Based Simultaneous Localization, Planar Surface Extraction, and Moving Obstacle Tracking 11th

Featureless Motion Vector-Based Simultaneous Localization, P...

引用

11th Workshop on Algorithmic Foundations of robotics (WAFR)

作者： Li, Wen Song, Dezhen Texas A&M Univ Dept Comp Sci & Engn College Stn TX 77843 USA

ISBN: (纸本)9783319165950;9783319165943

Motion vectors (MVs) characterize the movement of pixel blocks in video streams and are readily available. MVs not only allow us to avoid expensive feature transform and correspondence computations but also provide the motion information for both the environment and moving obstacles. This enables us to develop a new framework that is capable of simultaneous localization, scene mapping, and moving obstacle tracking. This method first extracts planes from MVs and their corresponding pixel macro blocks (MBs) using properties of plane-induced homographies. We then classify MBs as stationary or moving using geometric constraints on MVs. Planes are labeled as part of the stationary scene or moving obstacles using MB voting. Therefore, we can establish planes as observations for extended Kalman filters (EKFs) for both the stationary scene and moving objects. We have implemented the proposed method. The results show that the proposed method can establish plane-based rectilinear scene structure and detect moving objects while achieving similar localization accuracy of 1-Point EKF. More specifically, the system detects moving obstacles at a true positive rate of 96.6% with a relative absolution trajectory error of no more than 2.53%.

关键词： Extended Kalman filters

来源：评论

学校读者我要写书评

暂无评论

Visual and Inertial Odometry for a Disaster Recovery Humanoid 9

Visual and Inertial Odometry for a Disaster Recovery Humanoi...

引用

Field and Service robotics

作者： George, Michael Tardif, Jean-Philippe Kelly, Alonzo Carnegie Mellon Univ Natl Robot Engn Ctr 10 40th St Pittsburgh PA 15221 USA Carnegie Mellon Univ Inst Robot Pittsburgh PA 15213 USA

ISBN: (纸本)9783319074887;9783319074870

Disaster recovery robots must operate in unstructured environments where wheeled or tracked motion may not be feasible or where it may be subject to extreme slip. Many industrial disaster scenarios also preclude reliance on GNSS or other external signals as robots are deployed indoors or underground. Two of the candidates for precise positioning in these scenarios are visual odometry and inertial navigation. This paper presents some practical experience in the design and analysis of a combined visual and inertial odometry system for the Carnegie Mellon University Highly Intelligent Mobile Platform (CHIMP);a humanoid robot competing in the DARPA robotics Challenge.

关键词： Anthropomorphic robots

来源：评论

学校读者我要写书评

暂无评论

Optimal Trajectories for Planar Rigid Bodies with Switching Costs 11th

Optimal Trajectories for Planar Rigid Bodies with Switching ...

引用

11th Workshop on Algorithmic Foundations of robotics (WAFR)

作者： Lyu, Yu-Han Balkcom, Devin Dartmouth Coll Dept Comp Sci Hanover NH 03755 USA

ISBN: (纸本)9783319165950;9783319165943

The optimal trajectory with respect to some metric may require very many switches between controls, or even infinitely many, a phenomenon called chattering;this can be problematic for existing motion planning algorithms that plan using a finite set of motion primitives. One remedy is to add some penalty for switching between controls. This paper explores the implications of this switching cost for optimal trajectories, using rigid bodies in the plane (which have been studied extensively in the cost-free-switch model) as an example system. Blatt's Indifference Principle (BIP) is used to derive necessary conditions on optimal trajectories;Lipschitzian optimization techniques together with an A* search yield an algorithm for finding trajectories that can arbitrarily approximate the optimal trajectories.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Autonomous River Exploration 9

Autonomous River Exploration

引用

Field and Service robotics

作者： Jain, Sezal Nuske, Stephen Chambers, Andrew Yoder, Luke Cover, Hugh Chamberlain, Lyle Scherer, Sebastian Singh, Sanjiv Carnegie Mellon Univ Inst Robot 5000 Forbes Ave Pittsburgh PA USA

ISBN: (纸本)9783319074887;9783319074870

Mapping a rivers course and width provides valuable information to help understand the ecology, topology and health of a particular environment. Such maps can also be useful to determine whether specific surface vessels can traverse the rivers. While rivers can be mapped from satellite imagery, the presence of vegetation, sometimes so thick that the canopy completely occludes the river, complicates the process of mapping. Here we propose the use of a micro air vehicle flying under the canopy to create accurate maps of the environment. We study and present a system that can autonomously explore rivers without any prior information, and demonstrate an algorithm that can guide the vehicle based upon local sensors mounted on board the flying vehicle that can perceive the river, bank and obstacles. Our field experiments demonstrate what we believe is the first autonomous exploration of rivers by an autonomous vehicle. We show the 3D maps produced by our system over runs of 100-450 meters in length and compare guidance decisions made by our system to those made by a human piloting a boat carrying our system over multiple kilometers.

关键词： Rivers

来源：评论

学校读者我要写书评

暂无评论

Optimal Path Planning in Cooperative Heterogeneous Multi-robot Delivery Systems 11th

Optimal Path Planning in Cooperative Heterogeneous Multi-rob...

引用

11th Workshop on Algorithmic Foundations of robotics (WAFR)

作者： Mathew, Neil Smith, Stephen L. Waslander, Steven L. Univ Waterloo Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9783319165950;9783319165943

This paper addresses a team of cooperating vehicles performing autonomous deliveries in urban environments. The cooperating team comprises two vehicles with complementary capabilities, a truck restricted to travel along a street network, and a quadrotor micro-aerial vehicle of capacity one that can be deployed from the truck to perform deliveries. The problem is formulated as an optimal path planning problem on a graph and the goal is to find the shortest cooperative route enabling the quadrotor to deliver items at all requested locations. The problem is shown to be NP-hard using a reduction from the Travelling Salesman Problem and an algorithmic solution is proposed using a graph transformation to the Generalized Travelling Salesman Problem, which can be solved using existing methods. Simulation results compare the performance of the presented algorithms and demonstrate examples of delivery route computations over real urban street maps.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Towards Arranging and Tightening Knots and Unknots with Fixtures 11th

Towards Arranging and Tightening Knots and Unknots with Fixt...

引用

11th Workshop on Algorithmic Foundations of robotics (WAFR)

作者： Wang, Weifu Bell, Matthew P. Balkcom, Devin Dartmouth Coll Dept Comp Sci Hanover NH 03755 USA

ISBN: (纸本)9783319165950;9783319165943

This paper presents a controlled tying approach for knots using fixtures and simple pulling motions applied to the ends of string. Each fixture is specific to a particular knot;the paper gives a design process that allows a suitable fixture to be designed for an input knot. Knot tying is separated into two phases. In the first phase, a fixture is used to loosely arrange the string around a set of rods, with the required topology of the given knot. In the second phase, the string is pulled taut and slid along the rods (the tightening fixture) in a direction such that the cross-sections of the rods get closer together, allowing controlled tightening. Successful tying is shown for two interesting cases: a "double coin" knot design, and the top of a shoelace knot.

关键词： Fixtures (tooling)

来源：评论

学校读者我要写书评

暂无评论

Algorithmic Foundations of robotics XI: Selected Contributions of the Eleventh International Workshop on the Algorithmic Foundations of robotics 1

引用

丛书名： springer tracts in advanced robotics

2015年

作者： H. Levent Akin, Nancy M. Amato, Volkan Isler, A. Frank van der Stappen (eds.)

ISBN: (数字)9783319165950

ISBN: (纸本)9783319165943;9783319165950

This carefully edited volume is the outcome of the eleventh edition of the Workshop on Algorithmic Foundations of robotics (WAFR), which is the premier venue showcasing cutting edge research in algorithmic robotics. The eleventh WAFR, which was held August 3-5, 2014 at Boazii University in Istanbul, Turkey continued this tradition. This volume contains extended versions of the 42 papers presented at WAFR. These contributions highlight the cutting edge research in classical robotics problems (e.g. manipulation, motion, path, multi-robot and kinodynamic planning), geometric and topological computation in robotics as well novel applications such as informative path planning, active sensing and surgical planning. This book - rich by topics and authoritative contributors - is a unique reference on the current developments and new directions in the field of algorithmic foundations.

关键词： robotics robotics Algorithms Machine learning Engineering. robotics and Automation. Artificial Intelligence (incl. robotics) Mathematics

来源：评论

学校读者我要写书评

暂无评论

An Approximation Algorithm for Time Optimal Multi-Robot Routing 11th

An Approximation Algorithm for Time Optimal Multi-Robot Rout...

引用

11th Workshop on Algorithmic Foundations of robotics (WAFR)

作者： Turpin, Matthew Michael, Nathan Kumar, Vijay Univ Penn GRASP Lab Philadelphia PA 19104 USA Carnegie Mellon Univ Inst Robot Pittsburgh PA 15213 USA

ISBN: (纸本)9783319165950;9783319165943

This paper presents a polynomial time approximation algorithm for Multi-Robot Routing. The Multi-Robot Routing problem seeks to plan paths for a team of robots to visit a large number of interchangeable goal locations as quickly as possible. As a result of providing a constant factor bound on the suboptimality of the total distance any robot travels, the total completion time, or makespan, for robots to visit every goal vertex using this plan is no more than 5 times the optimal completion time. This result is significant because it provides a rigorous guarantee on time optimality, important in applications in which teams of robots carry out time-critical missions. These applications include autonomous exploration, surveillance, first response, and search and rescue.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共92页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：