机器人与人工智能爱好者论坛

 找回密码
 立即注册
查看: 6759|回复: 0
打印 上一主题 下一主题

邻域约束下空地异构机器人系统路径规划方法

[复制链接]

285

主题

451

帖子

1万

积分

超级版主

Rank: 8Rank: 8

积分
13726
跳转到指定楼层
楼主
发表于 2017-9-3 09:17:19 | 只看该作者 回帖奖励 |倒序浏览 |阅读模式
邻域约束下空地异构机器人系统路径规划方法






邻域约束下空地异构机器人系统路径规划方法.pdf (620.15 KB, 下载次数: 0)



邻域约束下空地异构机器人系统路径规划方法
陈洋1,2, 谭艳平1,2, 程磊1,2, 吴怀宇1,2
1. 武汉科技大学信息科学与工程学院,湖北 武汉 430081;
2. 冶金自动化与检测技术教育部工程研究中心,湖北 武汉 430081
Path Planning for a Heterogeneous Aerial-Ground Robot System with Neighbourhood Constraints
CHEN Yang1,2, TAN Yanping1,2, CHENG Lei1,2, WU Huaiyu1,2
1. School of Information Science and Engineering, Wuhan University of Science and Technology, Wuhan 430081, China;
2. Engineering Research Center for Metallurgical Automation and Detecting Technology of Education Ministry, Wuhan 430081, China

全文: PDF (621 KB)   HTML (1 KB)  
输出: BibTeX | EndNote (RIS)
摘要 针对一类带邻域约束的空地异构机器人系统的路径规划问题,提出了一种利用混合整数凸优化模型进行求解的方法.异构机器人系统由一台空中飞行机器人与一台地面自主移动机器人构成.机器人系统的任务是按给定顺序访问已知的目标序列.由于空中机器人每次持续飞行时间受限,因此必须及时返回地面机器人以节省能量或补充能量.分别考虑了空中飞行机器人和地面移动机器人的最大运动速度,空中飞行机器人的最小充电时间、最大滞空时间,以及各目标位置的邻域等约束,以完成所有目标序列访问任务的总时间最短为代价,建立了相应的目标优化模型,从而将机器人系统的路径规划问题转化为混合整数凸优化问题.基于建立的凸优化模型,考虑飞行机器人起降过程的时间消耗,分析了无人机起降过程的敏捷性能对路径规划结果的影响.最后通过仿真实验验证了所提方法的可行性和有效性.
关键词 异构机器人系统,  路径规划,  无人机,  空地合作,  混合整数规划   
Abstract:For the path planning problem of a class of heterogeneous aerial-ground robot systems with neighborhood constraints, a convex optimization based on mixed integer programming is proposed. The heterogeneous robot system consists of an unmanned aerial vehicle (UAV) and an autonomous ground mobile vehicle. A sequence of targets, whose positions are known as prior knowledge, are expected to be accessed in a given order. Owing to its limited duration in the air, the unmanned aerial vehicle should return to the ground vehicle timely and land on the deck for its energy-saving and recharge. The maximum speeds of the both vehicles, the minimum time for charging and the maximum duration time in the air for the aerial robot, and the neighborhood of each target is carefully considered in the model. An objective optimization model is developed by minimizing the time cost spent on all the targets, and the path planning problem of the heterogeneous aerial-ground robot system is formulated as a mixed integer convex optimization problem. Considering the time consumption on takeoff or landing of the aerial robot, the influence of the UAV agility on path solutions is analyzed based on the proposed convex optimization model. Finally, the simulation results show the feasibility and efficiency of the proposed method.
Key wordsheterogeneous vehicle system           path planning           unmanned aerial vehicle           aerial-ground cooperation           mixed integer programming
收稿日期: 2016-10-06      出版日期: 2016-12-26
1:
TP13
基金资助:国家自然科学基金(61573263,61203331);湖北省科技支撑计划(2015BAA018)
通讯作者: 陈洋,chenyag@wust.edu.cn    E-mail: chenyag@wust.edu.cn
作者简介: 陈洋(1980-),男,博士,副教授.研究方向:移动机器人建模、控制与路径规划.
谭艳平(1992-),女,硕士生.研究方向:移动机器人路径规划.
程磊(1976-),男,博士,教授.研究方向:机器嗅觉与多机器人群集运动控制.
引用本文:   
陈洋, 谭艳平, 程磊, 吴怀宇. 邻域约束下空地异构机器人系统路径规划方法[J]. 机器人, 2017, 39(1): 1-7.        
CHEN Yang, TAN Yanping, CHENG Lei, WU Huaiyu. Path Planning for a Heterogeneous Aerial-Ground Robot System with Neighbourhood Constraints. ROBOT, 2017, 39(1): 1-7.
链接本文:  
http://robot.sia.cn/CN/10.13973/j.cnki.robot.2017.0001         http://robot.sia.cn/CN/Y2017/V39/I1/1


我是笨鸟,我先飞!
回复

使用道具 举报

您需要登录后才可以回帖 登录 | 立即注册

本版积分规则

关闭

站长推荐上一条 /1 下一条

QQ|Archiver|手机版|小黑屋|陕ICP备15012670号-1    

GMT+8, 2024-5-7 21:11 , Processed in 0.060016 second(s), 27 queries .

Powered by Discuz! X3.2

© 2001-2013 Comsenz Inc.

快速回复 返回顶部 返回列表