已阅读5页,还剩3页未读, 继续免费阅读
版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
Abstract This paper introduces an obstacle avoiding algorithm for bipedal robots especially in push recovery situations Typically There are many algorithms that plan footstep to avoid obstacles based on vision recognition data However if the robot is pushed the planned footprint will change and thus there is no guarantee that it will avoid obstacles Although modified stepping positions can be limited the robot s stability is not assured Our proposed algorithm focuses on avoiding obstacles through vision recognition in push recovery situations and generating compensation actions for instability by restricting modified footsteps We fuse vision feedback with our previous push recovery algorithm which optimizes the ankle hip and stepping strategies We build simple grid data using vision recognition and apply it to the inequality constraint of the stepping position We validate the effectiveness of our algorithm using the bipedal platform GAZELLE with the Kinect V2 RGBD sensor I INTRODUCTION Practical daily usage requires that a humanoid robot be able to walk under all conditions regardless of disturbances or ground roughness Falling over could cause serious damage to the humanoid robot as well as injure people in its vicinity Typically uncontrolled environments involve numerous risks such as external shocks and uneven ground Therefore a robust walking control algorithm is required in order to ensure safety and the robot s continued intended use Experimental research on humans has indicated that the ankle hip and stepping strategies play an important role in balancing actions 1 3 Since the most effective strategy is the stepping strategy research has been actively conducted on footstep modification Urata et al 4 selected optimal pairs of center of mass zero moment point also known as CoM ZMP pairs through the preview control approach to prevent falling due to pushes The model predictive control MPC framework was used to modify footstep timing in 5 and 6 Jeong et al 7 determined the modified step positions and step times by integrating the control zero moment point cZMP that exceeded the support polygon Khadiv et al 8 replaced the exponential of the time term to convert the problem into a linear form The step position and step time can be optimized under the weighted cost function in a single framework Therefore the user can determine which step position and step time to penalize to a greater extent by setting the weighting factors Recent research on bipedal robots focused on an algorithm that combines these strategies for walking stabilization Aftab Hyobin Jeong Joon Ha Kim Okkee Sim and Jun Ho Oh are with the Humanoid Research Center School of Mechanical Aerospace however it is difficult to apply this method flexibly to each strategy due to its hierarchical structure Our previous work 12 proposed a real time optimization based step control framework We introduced divergent component of motion DCM error dynamics to utilize the ankle strategy and showed that the step position and step time can be modified according to push strength By extending this work in 13 we added upper body angular acceleration as the hip strategy To date push recovery studies have not considered floor conditions such as the presence of obstacles or a wall Typically pre planned footsteps can be chosen after considering the floor condition using vision recognition 14 17 If the robot is pushed the pre planned footsteps should be changed However it is difficult to plan new foot positions while considering existing obstacles on the floor Merely Engineering Department of Mechanical Engineering Korea Advanced Institute of Science and Technology e mail dhb111 kaist ac kr Avoiding Obstacles during Push Recovery Using Real Time Vision Feedback Hyobin Jeong Joon Ha Kim Okkee Sim and Jun Ho Oh Member IEEE Fig 1 Obstacle avoidance when the robot is pushed 2019 IEEE RSJ International Conference on Intelligent Robots and Systems IROS Macau China November 4 8 2019 978 1 7281 4003 2 19 31 00 2019 IEEE483 restricting the modified stepping positions is simple but this action will affect the robot s stability If the stepping foot position is restricted other actions must compensate for it to maintain stability in a push recovery situation Hildebrandt et al introduced footstep planning in push recovery situations 18 This algorithm restricts modified foot positions using vision sensor feedback However other compensation actions were not considered In this paper we extend our previous framework from 12 and 26 which stabilizes the robot by using the ankle hip and stepping strategies with step time modification For the mapping we use the ROS 19 open source Elevation Mapping 20 which is a probabilistic mapping method using structured data It represents the environment in terms of grid based height map data Utilizing this grid map we generate constraints for the swing foot s steppable region The most unique feature of our study is that the robot does not simply restrict the stepping position it takes other actions to compensate for this restriction such as step time modification or upper body action which is hip strategy Fig 1 To validate the effectiveness of our algorithm we conduct an experiment using a 13 degree of freedom DOF bipedal robot named GAZELLE which was recently developed by our research group 26 II CONTROL FRAMEWORK OPTIMIZING ANKLE HIP AND STEPPING STRATEGIES In this section we briefly introduce the principle explained in 13 namely the walking control framework optimizing the ankle hip and stepping strategies A Modeling and DCM error dynamics The walking controller is derived from the dynamics of the Linear Inverted Pendulum with Flywheel Model LIPFM see Fig 2 The floating base system with a lumped mass can be easily modeled by the LIPFM The DCM dynamics are governed by the following equations 2 CMP pxx 1 CMPZMP mg pp 2 iii J iy x 3 where x T comcom xy center of mass ZMP p T ZMP ZMP yx pp zero moment point CMP p T CMP CMP y x pp centroidal momentum pivot T yx zcg and g is the gravitational acceleration The DCM is one of the motion states suggested in 21 22 and 23 x x 4 where T xy is a point on the ground The detailed description of its derivation can be found in 21 and 23 Rearranging 1 and 4 provides the following DCM dynamics equation CMP p 5 This relationship shows the dynamic characteristic of the DCM under a given centroidal momentum pivot CMP Since the DCM diverges from the CMP the latter can be used to stabilize the DCM Then we can stabilize the CoM as well For a given CMP position we can solve the differential equation over the step time If the current time is t and time of ending a step is T the analytical solution of the DCM at Tcan be expressed as follows CMP CMP T t tttT e pp 0tT 6 In general ZMP based walking is performed depending upon the pre planned CoM trajectory and footsteps This CoM trajectory is usually generated from the LIPFM dynamics as explained in 21 and 24 Here we analyze the DCM dynamics equation 6 into the reference part and the error part First we divide the current CMP CMP t p as follows CMP cCMP 0 tt ppu 7 where T 00 0 xy uu uis the center of the stance foot which is constant during the current step phase cCMPt p is a control CMP cCMP whose concept is similar to that of the cZMP in 12 The cCMP cCMPt p is expressed as cCMP cZMPtt mg pp 8 The cZMP is an additional ZMP vector generated by the ankle torque of the stance foot We can decide the ankle strategy actions by determining this cZMP The cCMP has a flywheel torque term as described in 8 The cCMP can be interpreted as an additional CMP vector generated by the ankle torque and upper body reaction torque We can also separate the current DCM and the end of step DCM err refttt 9 Fig 2 Linear Inverted Pendulum with Flywheel Model LIPFM 484 err refTTT 10 where reft is derived from the reference DCM pattern errt is the current DCM error refT is the designed end of step DCM position and errT is the DCM end of step error By assigning 7 9 and 10 to 6 we obtain 00 cCMP cCMP err ref ref err T t T t t TTt tt e e uu p p 11 Usually the DCM pattern is designed to not violate the LIPFM dynamics Therefore we can cancel the reference part of each side Then cCMP cCMP err err T t t ttT e p p 12 Equation 12 displays DCM error dynamics which shows the relationship between the DCM error and cCMPs We extend the DCM error dynamics to set up an equality constraint for our optimization B Effect of Each Strategy on Walking Stability In this section we mathematically relate the effect of the stabilizing strategies namely the ankle hip and stepping strategies For the ankle and stepping strategies the LIPFM excluding the hip reaction torque is used for the explanation The effect of the hip strategy is described by using the LIPFM In this study the current DCM error is used as an indicator of the disturbance applied to the robot If the robot receives disturbance we can expect to observe the CoM position velocity error and the current DCM error Many studies have used the current DCM error as an indicator of disturbance 7 8 22 25 1 Ankle Strategy As explained previously the cZMP can be interpreted as the ankle torque of the stance foot Thus the ankle strategy can be achieved by assigning the cZMP If the hip reaction torque does not exist cCMPt p and cZMPt pare identical and 12 becomes err err err err cZMP cZMP T t TTTttt e ub pp 13 We can find cZMPt p by eliminating the DCM end of step error Substitute err 0 T in 13 and solve for cZMPt p then we have cZMPcZMP cZMP err FootSize 1 Tt Tt t tt e e p p p 14 If the robot has an ankle torque of cZMP p T cZMP cZMP xy pp the current DCM can arrive at its original destination even if a current DCM error exists Fig 3 2 Stepping Strategy Step Position The relationship between the stepping strategy and walking stabilization can be expressed using 13 To determine the effect of stepping position change alone we set cZMP0t p and rearrange 13 err err err err T t TtT e ub 15 errT u represents an error vector of the original planned foot position and the new foot position Fig 4 Equation 15 shows the next foot adjustment when the current DCM error occurs err b is the DCM offset that determines the initial speed and direction of the DCM in the next step phase The detailed description of the DCM offset appears in 12 3 Stepping Strategy Step Time In this section we describe the effect of step time change on gait stabilization using the relationship between step time and DCM reference planning If we can change the step time it is possible to tackle disturbance more effectively compared to when it is fixed After considering the time change effect 13 transforms into Fig 3 Effect of the ankle strategy Although the current DCM is disturbed cZMP can stabilize it such that the end of step DCM is not changed Fig 4 If a larger disturbance is applied to robot the cZMP modulation cannot prevent the end of step DCM error Therefore the change in step position is inevitable 485 ori err err ref cZMP err cZMP TtT Tt T t t tt eee e ub p p 16 The derivation of 16 is described in 12 and 13 4 Hip Strategy The CMP can be regarded as the sum of the ZMP and upper body reaction torque Thus the CMP has an advantage in that it can be placed beyond the support polygon Fig 5 If we change the ZMP of 16 to the CMP we can observe the effect on the hip strategy ori err err ref cCMP err cCMP TtT Tt T t t tt eee e ub p p 17 Substituting 8 into 17 and rearranging results in the following equation ori err err ref cZMP err cZMP 1 TtTT t Tt T t t tt eeee mg e ub p p 18 C Setting up the Linearized Optimization Problem Due to the non linearity of 18 the step time term T e is replaced by as explained in 8 Moreover cZMP p can be directly used as cZMP the calculation of which is based on the current DCM error and step time If cZMP p exceeds the foot size it should be manually projected into the foot range Equality constraints err ori err ref cZMP err cZMP 1 yy tt x Txtx t tx txtx J ubee mg p pe 19 err ori err ref err cZMP cZMP 1 xxtt y yTyt t tytyty J ubee mg pep 20 Inequality constraints max err ref maxTxTx LuuL min err ref max max err ref min Right legswing Left legswing TyTy TyTy WuuW WuuW 21 minmax TTTTTt 22 Cost function err err 2222 err err yerr err 22 2 return return min TT TxTyx uxuybxby T Toriyyyxxx bbwwww wTTww uu u b 23 Other constraints for foot speed and upper body rotation acceleration are noted in 13 III REAL TIME CONSTRAINT UPDATE USING VISION FEEDBACK As we mentioned before reactive footsteps should not collide with obstacles in push recovery situations We considered only the maximum kinematical range as the position constraints so far but now we also consider areas the robot can actually step on using vision recognition A Vision System and Mapping KINECT V2 with an infrared RGBD camera as the vision sensor is used for this study KINECT V2 enjoys the advantage of high accuracy in indoor situations Calibration is needed to synchronize the infrared based depth and RGB based depth data wherein KINECT V2 uses both these data to produce the final depth data Fig 5 Effect of the hip strategy If the hip reaction torque is available the cZMP can be replaced by the cCMP that can go out of the foot Fig 6 Elevation mapping using the vision data of Kinect V2 486 We use the elevation mapping algorithm 20 which is an open source ROS package Elevation mapping is a robot centered height mapping algorithm and it requires odometry values and point cloud data The odometry information is imported from the robot state estimation algorithm in 13 Since this mapping method is based on a probability filter camera noise and odometry uncertainties are considered In addition it considers only 2 5D environments and the only height map is made up Thus the mapping does not consider multiple heights in one cell see Fig 6 B Collision Area Approximation Using the mapping algorithm environments are expressed as height map data Fig 7 a Height map data are used to check whether a certain cell is steppable or not Our purpose is to find the maximum distance from the stance foot to the edge of the steppable region We check the maximum distance along the reference line that intersects the previous stance foot position green lines in Fig 7 b This is a very efficient way to check the maximum distance for the stepping foot compared to checking every cell in the grid map It is not necessary to check the area beyond the obstacles max vision L can be found along the horizontal reference line in the vertical direction Fig 7 c Likewise max visionW and min visionW can be found along the vertical reference line in the horizontal direction Fig 7 e After iterative searching arrays of max vision L max visionW and min visionW are generated with respect to grid cell location These arrays are compared with the kinematical constraints of the foot and are used to update the inequality constraint of optimization C Update Inequality Constraint In this study we focus on the inequality constraints 21 namely the stepping foot position constraints As stated previously this inequality constraint should consider not only the physical leg range Fig 8 but also the area the robot can actually step on Here we apply the area detected from a previous section to the inequality constraint 21 To apply the actual area constraint to the optimization problem in II C vision data should be set to the same coordinate system as the optimization problem the origin being the stance foot In the previous section we derived max vision L max vision W min vision W the calculated value of which was based on the stance foot coordinate Then we find the new position constraints max Land max W by comparing the kinematical and environmental limitations max max max max max max minmin i j i j i j i j i j i j i j i j max max kinevision kinevision kine LLL WWW WW 24 j i is location of stepping position which is calculated at the previous control step original footstep position errT u After we consider both limitations as expressed in 24 the possible area of the stepping position is selected Fig 7 d f We assume that no obstacles exist between the two feet and thus we set min W equal to min vision W When we use condition 24 near concave area there is possibility that stepping position can exceed safe area Fig 9 a Therefore we added one more constraint to fix this problem Fig 8 Stepping position constraints from kinematical range Fig 7 Grid approximation of mapping data The advantage of the grid method is that there is no need to construct a set of convex shapes to approximate obstacles 487 errT uuu 25 Where u indicates blue rectangle in Fig 9 When the previously calculated stepping position i j is far from obstacle uis same as grid size Fig 9 a However when i j is closer to the obstacles u reduces not to exceed safe area Fig 9 b This idea allows us to safely restrict stepping foot position even in concave areas IV EXPERIMENTAL RESULT A Hardware Overview GAZELLE is a 13 DOF bipedal platform that can move fast and is robustly actuated It is designed for a bipedal walking experiment in various environments such as uneven terrain and external disturbances Fig 10 shows its overall specifications and the structural design and key parts of GAZELLE 26 B Push Recovery and Avoiding Obstacles In the experiments we push the robot during walking in place The robot changes its stepping position to recover from the disturbance In the first case we just push the robot on an even floor for comparison In the second case the robot is pushed in the direction of the obstacle In this case we expect a different reaction from the robot compared to the first case such as a step time change or upper body action hip strategy Fig 10 Bipedal Platform GAZELLE and its specifications Fig 11 Snap shots of push recovery without vision feedback Fig 12 Plots of push recovery without vision feedback The robot considers only its kinematical foot range as stepping position constraint F
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 初中八年级德育《好习惯成就美好人生》主题班会教学设计
- 高三生物二轮复习多项选择题精准突破教学设计
- 高中化学高二年级《醇》教学设计:基于官能团视角的结构推演与性质关联
- 初中八年级心理健康《拒绝懒惰与拖延》教学设计
- 高三地理一轮复习:太阳视运动图特色读图教学设计
- 初中八年级德育《“消防安全你我同行”主题班会教学设计》
- 初中地理八年级上册4.1农业地域分布与影响因素教学设计
- 鲁教版四年级下册美术《我画的动漫形象》教学设计
- 小学一年级信息科技《小猫钓鱼》初识序列与事件教学设计
- 初中劳动技术九年级《无线电侧向与定位》教学设计
- 2026秋小学人教版数学五年级上册第五单元学情测试练习卷含参考答案
- 大专护理专业毕业综合考试题(含详细答案)
- 工程力学 第2版 课件 第7章-扭转
- 试用期聘用合同范本6篇
- 2026年甘肃执法证考试题库及参考答案
- 成人留置导尿最佳实践指南解读
- 灵魂的拷问与觉醒:高中语文选择性必修上册第三单元教学设计
- 2025甘肃农信招聘官网笔试历年典型考题及考点剖析附带答案详解
- 合肥市完整社区建设实施方案及案例解析(2026~2026年)
- 湖南省2026年高考招生计划-历史类
- 消毒供应室降低纸塑包装物品灭菌后水迹发生率品管圈PDCA案例所有图表均可以直接点击编辑修改
评论
0/150
提交评论