Time-optimal motion of two omnidirectional robots carrying a ladder under a velocity constraint

We consider the problem of computing a time-optimal motion for two omnidirectional robots carrying a ladder from an initial position to a final position in a plane without obstacles. At any moment during the motion, the distance between the robots remains unchanged and the speed of each robot must be either a given constant /spl upsi/, or O. A trivial lower bound on time for the robots to complete the motion is the time needed for the robot farther away from its destination to move to the destination along a straight line at a constant speed of /spl upsi/. This lower bound may or may not be achievable, however, since the other robot may not have sufficient time to complete the necessary rotation around the first robot (that is moving along a straight line at speed v) within the given time. We first derive, by solving an ordinary differential equation, a necessary and sufficient condition under which this lower bound is achievable. If the condition is satisfied, then a time-optimal motion of the robots is computed by solving another differential equation numerically. Next, we consider the case when this condition is not satisfied, and show that a time-optimal motion can be computed by taking the length of the trajectory of one of the robots as a functional and then applying the method of variational calculus. Several optimal paths that have been computed using the above methods are presented.

[1]  Akihiro Matsumoto,et al.  Development of an omni-directional mobile robot with 3 DOF decoupling drive mechanism , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[2]  Christos H. Papadimitriou,et al.  Finding Feasible Paths for a Two-Point Body , 1989, J. Algorithms.

[3]  J. Mitchell,et al.  Optimal motion of covisible points among obstacles in the plane , 1990 .

[4]  William H. Press,et al.  The Art of Scientific Computing Second Edition , 1998 .

[5]  V. A. Dubovit︠s︡kiĭ.  The Ulam problem of optimal motion of line segments , 1985 .

[6]  William H. Press,et al.  Numerical recipes in C. The art of scientific computing , 1987 .

[7]  William H. Press,et al.  Book-Review - Numerical Recipes in Pascal - the Art of Scientific Computing , 1989 .

[8]  I. S. Gradshteyn,et al.  Table of Integrals, Series, and Products , 1976 .

[9]  Ichiro Suzuki,et al.  Distributed algorithms for formation of geometric patterns with many mobile robots , 1996, J. Field Robotics.

[10]  Lynne E. Parker.  Designing control laws for cooperative agent teams , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[11]  Ichiro Suzuki,et al.  Distributed Algorithms for Controlling Multiple Mobile Robots , 1994 .

[12]  J. Y. S. Luh,et al.  Coordination and control of a group of small mobile robots , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[13]  R. Courant,et al.  Methods of Mathematical Physics , 1962 .

[14]  S. Ulam.  A collection of mathematical problems , 1960 .

[15]  Yoshio Kawauchi,et al.  A principle of distributed decision making of Cellular Robotic System (CEBOT) , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.