2010 IEEE International Conference on Robotics and Automation最新文献_第2页

WiFi localization and navigation for autonomous indoor mobile robots 自主室内移动机器人的WiFi定位与导航

2010 IEEE International Conference on Robotics and Automation Pub Date : 2010-05-03 DOI: 10.1109/ROBOT.2010.5509842

Joydeep Biswas, M. Veloso

引用次数: 312

An indoor flying platform with collision robustness and self-recovery 具有碰撞鲁棒性和自恢复的室内飞行平台

2010 IEEE International Conference on Robotics and Automation Pub Date : 2010-05-03 DOI: 10.1109/ROBOT.2010.5509338

A. Klaptocz, Grégoire Boutinard-Rouelle, A. Briod, J. Zufferey, D. Floreano

引用次数: 22

Switching control and quick stepping motion generation based on the maximal CPI sets for falling avoidance of humanoid robots 基于最大CPI集的仿人机器人避落切换控制与快速步进运动生成

2010 IEEE International Conference on Robotics and Automation Pub Date : 2010-05-03 DOI: 10.1109/ROBOT.2010.5509824

Ko Yamamoto, Yoshihiko Nakamura

引用次数: 14

Reconfiguration algorithms for mobile robotic networks 移动机器人网络的重构算法

2010 IEEE International Conference on Robotics and Automation Pub Date : 2010-05-03 DOI: 10.1109/ROBOT.2010.5509484

N. Chakraborty, K. Sycara

{"title":"Reconfiguration algorithms for mobile robotic networks","authors":"N. Chakraborty, K. Sycara","doi":"10.1109/ROBOT.2010.5509484","DOIUrl":"https://doi.org/10.1109/ROBOT.2010.5509484","url":null,"abstract":"For a deployed mobile robotic network to function usefully, the robots should have the capability to adjust their positions, while maintaining the network connectivity. In this paper, we present algorithms that allows a robot to decide when it is feasible for it to move to a desired point by adjusting its own positions (and the positions of some other robots in the network), while maintaining all the network connectivity constraints. Under the assumption of a disc model of communication, we show that the problem can be formulated as a convex optimization (or feasibility) problem (actually a second order cone program). Thus, the problem can be solved in polynomial time by centralized interior point algorithms. However, this requires the robot to have knowledge of the position of all the nodes in the network. Our main contribution is the development of an incremental algorithm, that solves the feasibility problem (of whether the robot can move to its desired goal) by obtaining the information about the position of the robots and their immediate neighbors only if they are required to move. We present simulation results comparing the performance of the centralized algorithm with the incremental algorithm for randomly generated networks. From simulation results, we observe that the time required by the incremental algorithm to solve the feasibility problem is relatively independent of the size of the network.","PeriodicalId":289706,"journal":{"name":"2010 IEEE International Conference on Robotics and Automation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121242085","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 25

A hybrid model of obstacle-aided snake robot locomotion 障碍物辅助蛇形机器人运动的混合模型

2010 IEEE International Conference on Robotics and Automation Pub Date : 2010-05-03 DOI: 10.1109/ROBOT.2010.5509834

Pål Liljebäck, K. Pettersen, Ø. Stavdahl, J. Gravdahl

引用次数: 8

High-speed 3D object recognition using additive features in a linear subspace 利用线性子空间中的加性特征进行高速三维目标识别

2010 IEEE International Conference on Robotics and Automation Pub Date : 2010-05-03 DOI: 10.1109/ROBOT.2010.5509271

Asako Kanezaki, Hideki Nakayama, T. Harada, Y. Kuniyoshi

引用次数: 14

Distributed nonlinear estimation for robot localization using weighted consensus 基于加权一致性的机器人定位分布非线性估计

2010 IEEE International Conference on Robotics and Automation Pub Date : 2010-05-03 DOI: 10.1109/ROBOT.2010.5509143

Andrea Simonetto, T. Keviczky, Robert Babuška

引用次数: 47

Near-optimal autonomous pursuit evasion for nonholonomic wheeled mobile robot subject to wheel slip 考虑轮滑的非完整轮式移动机器人的近最优自主追逃

2010 IEEE International Conference on Robotics and Automation Pub Date : 2010-05-03 DOI: 10.1109/ROBOT.2010.5509631

Yu Tian, Jadav Das, N. Sarkar

引用次数: 8

Reporting on a large ocean inlet crossing live transmission line inspection performed by linescout technology 报告了用线路测量技术进行的大型海洋入口穿越带电输电线路的检查

2010 IEEE International Conference on Robotics and Automation Pub Date : 2010-05-03 DOI: 10.1109/ROBOT.2010.5509190

Serge Montambault, N. Pouliot, J. Tóth, Bernhard Spalteholz

引用次数: 8

Geodesic trajectory generation on learnt skill manifolds 基于学习技能流形的测地线轨迹生成

2010 IEEE International Conference on Robotics and Automation Pub Date : 2010-05-03 DOI: 10.1109/ROBOT.2010.5509819

I. Havoutis, S. Ramamoorthy

{"title":"Geodesic trajectory generation on learnt skill manifolds","authors":"I. Havoutis, S. Ramamoorthy","doi":"10.1109/ROBOT.2010.5509819","DOIUrl":"https://doi.org/10.1109/ROBOT.2010.5509819","url":null,"abstract":"Humanoid robots are appealing due to their inherent dexterity. However, these potential benefits may only be realized if the corresponding motion synthesis procedure is suitably flexible. This paper presents a flexible trajectory generation algorithm that utilizes a geometric representation of humanoid skills (e.g., walking) - in the form of skill manifolds. These manifolds are learnt from demonstration data that may be obtained from off-line optimization algorithms (or a human expert).We demonstrate that this model may be used to produce approximately optimal motion plans as geodesics over the manifold and that this allows us to effectively generalize from a limited training set. We demonstrate the effectiveness of our approach on a simulated 3-link planar arm, and then the more challenging example of a physical 19-DoF humanoid robot. We show that our algorithm produces a close approximation of the much more computationally intensive optimization procedure used to generate the data. This allows us to present experimental results for fast motion planning on a realistic - variable step length, width and height - walking task on a humanoid robot.","PeriodicalId":289706,"journal":{"name":"2010 IEEE International Conference on Robotics and Automation","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123449420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11