Task Oriented Optimum Positioning of a Mobile Manipulator Base in a Cluttered Environment

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 2(n) 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.
Publisher
Springer
Issue Date
1997
Language
ENG
Keywords

QUADTREES; SPACE; ROBOT

Citation

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, v.18, no.2, pp.147 - 168

ISSN
0921-0296
DOI
10.1023/A:1007982206837
URI
http://hdl.handle.net/10203/1936
Appears in Collection
ME-Journal Papers(저널논문)
  • Hit : 444
  • Download : 10
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 3 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0