首页 /研究 /Shortest distance paths for wheeled mobile robots
OTHER

Shortest distance paths for wheeled mobile robots

J. C. Alexander, John H. Maddocks, Brian Michalowski

发表年份
1998
引用次数
17

摘要

Minimal distance paths between prescribed initial and final configurations of a wheeled mobile robot are calculated, both analytically and numerically, using methods of optimal control. The construction of these trajectories can be considered as part of an analysis of obstacle avoidance.

关键词

Mobile robotObstacle avoidanceObstacleRobotComputer scienceControl theory (sociology)Artificial intelligenceControl (management)Geography

相关论文

查看 OTHER 分类全部论文