Home /Research /Shortest distance paths for wheeled mobile robots
OTHER

Shortest distance paths for wheeled mobile robots

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

Year
1998
Citations
17

Abstract

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.

Keywords

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

Related papers

Browse all OTHER papers