• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of robotic systems >Mobile manipulator path planning by a genetic algorithm
【24h】

Mobile manipulator path planning by a genetic algorithm

机译：Mobile manipulator path planning by a genetic algorithm

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相关主题

摘要

AbstractThis article addresses the path‐planning problem for a mobile manipulator system that is used to perform a sequence of tasks specified by locations and minimum oriented force capabilities. The problem is to find an optimal sequence of base positions and manipulator configurations for performing a sequence of tasks given a series of task specifications. The formulation of the problem is nonlinear. The feasible regions for the problem are nonconvex and unconnected. Genetic algorithms applied to such problems appear to be very promising while traditional optimization methods cause difficulties. Computer simulations are carried out on a three‐degrees‐of‐freedom manipulator mounted on a two‐degrees‐of‐freedom mobile base to search for the near optimal path‐planning solution for performing the sequence of tasks. © 1994 John

著录项

获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号