Task Oriented Optimum Positioning of a Mobile Manipulator Base in a Cluttered Environment
Tóm tắt
A method for generating discrete optimal sequences of base locations for mobile manipulators is presented that considers the task capability of the workspace in a cluttered environment. In implementation, the obstacles and task trajectories are represented by 2n trees, so that a series of set operations are performed to characterize the manipulator’s configuration space into topological subspaces. By incorporating trajectory-motion-capable subspaces into the enumeration of the cost function, an optimum search technique is made applicable to the determination of a task feasible location. The method is then extended to a multiple positioning problem by concatenating the single optimization processes into a serial multistage decision making system, for which an optimal set of decisions can be found through a computationally efficient dynamic programming process.The computational paradigm of the present method is coherent with topological workspace analysis, and thus applicable to task trajectories of arbitrary dimensions and shapes. The effectiveness of the presented method is demonstrated through simulation studies performed for a 3-d.o.f. regional manipulator operating under various task conditions.
Tài liệu tham khảo
Lozano-Perez, T.: Spatial planning: A configuration space approach, IEEE Transaction on Computers C-32(1983), 108–120.
Lozano-Perez, T.: A simple motion planning algorithm for general robot manipulators, IEEE Journal of Robotics and Automation RA-3(3) (1987), 224–238.
Faverjon, B. and Tournassoud, P.: Motion planning for manipulators in complex environments, Lecture Notes in Computer Science: Workshop on Geometry and Robotics, Vol. 391 (1988), Springer-Verlag, pp. 86–115.
Borel, P. and Legeois, A.: A study of multiple manipulator inverse kinematic solution with applications to trajectory planning and workspace determination, in: Proc. IEEE Int. Conf. Robotics Automat.(1986), pp. 1180–1185.
Burdick, J. W.: A classification of 3R regional manipulator singularities and geometries, in: Proc. IEEE Int. Conf. Robotics Automat.(1991), pp. 2670–2675.
Burdick, J. W.: A recursive method for finding revolute-jointed manipulator singularities, in: Proc. IEEE Int. Conf. Robotics Automat.(1992), pp. 448–453.
Shiller, Z.: Interactive time optimal robot motion planning and work-cell layout design, in: Proc. IEEE Int. Conf. Robotics Automat.(1989), pp. 964–969.
Wenger, Ph.: A new general formalism for the kinematic analysis of all nonredundant manipulators, in: Proc. IEEE Int. Conf. Robotics Automat.(1992), pp. 442–447.
Wenger, Ph. and Chedmail, P.: On the connectivity of manipulator free workspace, Journal of Robotic Systems 8(6) (1991), 767–799.
Wenger, Ph. and Chedmail, P.: Ability of a robot to travel through Cartesian free workspace in an environment with obstacles, Int. Journal of Robotics Research 10(3) (1991), 214–227.
Pamanes, G. J. A. and Zeohloul, S.: Multicriteria optimal placement of manipulators in cluttered environments, ASME Int. Conf. on Comput. in Eng., Vol. 2 (1991), pp. 419–424.
Clourier, G. et al.: Robotization of predetermined environments: Solution to the workstation design problem, in: Int. Conf. on CAD/CAM, Robotics and Factories of the Future(1992), pp. 1411–1425.
Lueth, T. C.: Automatic planning of robot workcell layouts, in: Proc. IEEE Int. Conf. Robotics Automat.(1992), pp. 1103–1108.
Nelson, B., Perdersen, K., and Donath, M.: Locating assembly tasks in a manipulator’s workspace, in: Proc. IEEE Int. Conf. Robotics Automat.(1987), Raleigh, North Carolina, pp. 1367–1372.
Chiu: Task compatibility of manipulator postures, Int. Journal of Robotics Research 7(5) (1988), 13–21.
Deneb Robotics, IGRIP Version 2.3 User Manual (1993), Pittsburg.
Chedmail, P. and Wenger, Ph.: Design and positioning of a robot in an environment with obstacles using optimal search, in: Proc. IEEE Int. Conf. Robotics Automat.(1989), Scottsdale, pp. 1069–1076.
Reynier, F., Chedmail, P., and Wenger, Ph.: Automatic positioning of robots, continuous trajectories feasibility among obstacles, in: Proc. IEEE Int. Conf. Syst. Man and Cybern.(1992), Chicago, pp. 189–194.
Park,. S., Yoon, J. S., and Cho, H. S.: Robot positioning based on workspace connectivity, Proc. ASME Winter Annual Meeting, DSMC, Vol. 1 (1995), pp. 121–128.
Gargantini, I.: An effective way to represent quadtrees, Computer Graphics and Image Processing 25(12) (1982), 905–910.
Bauer, M. A.: Set operations on linear quadtrees, Computer Vision, Graphics, and Image Processing 29(1985), 248–258.
Unnikrishnan, A., Venkatesh, Y. V., and Shankar, P.: Connected component labelling using quadtrees–A buttom-up approach, The Computer Journal 30(2) (1987), 176–182.
Nelder, J. A. and Mead, R.: A simplex method for function minimization, Computer Journal 7(1965), 308–313.
Beightler, C. S., Phillips, D. T., and Wilde, D. J.: Foundation of Optimization, Prentice-Hall, New Jersey (1979).
Bellman, R. E.: Dynamic Programming, Princeton Univ. Press, Princeton, New Jersey (1957).