A single planner for a composite task of approaching, opening and navigating through non-spring and spring-loaded doors

Robotics and Automation(2013)

引用 13|浏览14
暂无评分
摘要
Opening and navigating through doors remains a challenging problem, particularly in cluttered environments and for spring-loaded doors. Passing through doors, especially spring-loaded doors, requires making and breaking contacts with the door and preventing the door from closing while passing through. In this work, we present a planning framework that handles non-spring and spring-loaded doors, in cluttered or confined workspaces, planning the approach to the door, pushing or pulling it open, and passing through. Because the problem is solved in a combined search space, the planner yields an overall least-cost path. The planner is able to insert a transition between robot-door contacts at any point along the plan. We utilize a compact graph-based representation of the problem to keep planning times low. We precompute the force workspace of the end-effectors to eliminate checks against joint torque limits at plan time. We have validated our solution in both simulation and real-world experiments on the PR2 mobile manipulation platform; the robot is able to successfully open a variety of spring-loaded and non-spring-loaded doors by pushing and pulling.
更多
查看译文
关键词
doors,end effectors,graph theory,mobile robots,navigation,path planning,search problems,springs (mechanical),PR2 mobile manipulation platform,cluttered environment,cluttered workspace,compact graph-based representation,composite task,confined workspace,door opening,door pulling,door pushing,end-effectors,force workspace,joint torque limit,least-cost path,navigation,nonspring-loaded doors,planning framework,robot-door contact,search space,spring-loaded loaded doors
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要