Loading [MathJax]/extensions/MathMenu.js
Pushing a Disk Using Compliance | IEEE Journals & Magazine | IEEE Xplore

Abstract:

This paper addresses the problem of maneuvering an object by pushing it through an environment with obstacles. Instead of only pushing the object through open areas, we a...Show More

Abstract:

This paper addresses the problem of maneuvering an object by pushing it through an environment with obstacles. Instead of only pushing the object through open areas, we also allow it to use compliance, e.g., allowing it to slide along obstacle boundaries. Using compliance has a number of advantages: it extends the number of situations in which a manipulation plan can be found, it allows for simpler (i.e., less complicated) paths in many cases, and it often helps solving narrow-passage problems. Here, we present an approach based on rapidly-exploring random trees. Our approach yields paths through the open space, but also exploits the power of compliance.
Published in: IEEE Transactions on Robotics ( Volume: 23, Issue: 3, June 2007)
Page(s): 431 - 442
Date of Publication: 25 June 2007

ISSN Information:

References is not available for this document.

I. Introduction

Over the years, various techniques have been developed that address the problem of navigating through or interacting with a real or virtual world. These techniques can roughly be divided in two classes, both solving a different type of problem: motion and manipulation planning. Motion planning essentially deals with robots that navigate autonomously while manipulation planning concerns passive objects that cannot move by themselves and that are manipulated by an autonomous robot.

Select All
1.
P. K. Agarwal, J.-C. Latombe, R. Motwani and P. Raghavan, "Nonholonomic path planning for pushing adisk among obstacles", Proc. IEEE Int. Conf. Robot. Autom., pp. 3124-3129, 1997.
2.
N. M. Amato, O. B. Bayazit, L. K. Dale, C. Jones and D. Vallejo, "OBPRM: An obstacle-based PRM for 3-D workspaces", Proc. Int. Workshop Algorithm. Foundations of Robot. (WAFR), pp. 155-168, 1998.
3.
H. Arai and O. Khatib, "Experiments with dynamic skills", Proc. Japan-USA Symp. Flexible Autom., pp. 81-84, 1994.
4.
B. Aronov, M. De Berg, A. F. Van der Stappen, P. vestka and J. Vleugels, "Motion planning for multiple robots", Discrete Computat. Geometry, vol. 22, pp. 505-525, 1999.
5.
J. L. Bentley, "Multidimensional binary search trees usedfor associative searching", Commun. ACM, vol. 18, pp. 509-517, 1975.
6.
V. Boor, M. H. Overmars and A. F. van der Stappen, "The Gaussian sampling strategy for probabilisticroadmap planners", Proc. IEEE Int. Conf. Robot. Autom., pp. 1018-1023, 1999.
7.
R. L. Burden and J. D. Faires, Numerical Analysis, CA, Belmont:Wadsworth, 2001.
8.
A. J. Briggs, "An efficient algorithm for one-step planarcompliant motion planning with uncertainty", Algorithmica, vol. 8, no. 3, pp. 195-208, 1992.
9.
S.-W. Cheng, O. Cheong, H. Everett and R. W. van Oostrum, "Hierarchical decompositions and circularray shooting in simple polygons", Discrete Computat. Geometry, vol. 32, pp. 401-415, 2004.
10.
B. R. Donald, "The complexity of planar compliant motionplanning under uncertainty", Proc. ACM Symp. Computat. Geometry, pp. 309-318, 1988.
11.
M. A. Erdmann, On motion planning with uncertainty, 1984.
12.
K. Goldberg, "Orienting polygonal parts without sensors", Algorithmica, vol. 10, no. 2, pp. 201-225, 1993.
13.
V. Koltun, "Segment intersection searching problemsin general settings", Proc. 17th Annu. Symp. Computat. Geometry, pp. 197-206, 2001.
14.
S. M. LaValle, Planning Algorithms, MA, Cambridge:Cambridge Univ. Press, 2006, [online] Available: http://msl.cs.uiuc.edu/planning/.
15.
J. Kuffner and S. LaValle, "RRT-Connect: An efficient approach to single-querypath planning", Proc. IEEE Int. Conf. Robot. Autom., pp. 995-1001, 2000.
16.
T. Lozano-Perz, M. T. Mason and R. H. Taylor, "Automatic synthesis of fine-motionstrategies for robots", IEEE Trans. Comput., vol. C-32, no. 2, pp. 108-120, Feb. 1983.
17.
K. M. Lynch, "The mechanics of fine manipulation by pushing", Proc. IEEE Int. Conf. Robot. Autom., pp. 2269-2276, 1992.
18.
K. M. Lynch and M. T. Mason, "Stable pushing: Mechanics controllabilityand planning", Int. J. Robot. Res., vol. 15, no. 6, pp. 533-556, 1996.
19.
M. T. Mason, Mechanics of Robotic Manipulation, MA, Cambridge:MIT Press, 2001.
20.
M. T. Mason, "Mechanics and planning of manipulator pushingoperations", Int. J. Robot. Res., vol. 5, no. 3, pp. 53-71, 1986.
21.
M. T. Mason and K. M. Lynch, "Dynamic manipulation", Proc. IEEE/RJS Int. Conf. Intell. Robots Syst., pp. 152-159, 1993.
22.
M. Strandberg, "Augmenting RRT-planners with local trees", Proc. IEEE Int. Conf. Robot. Autom., pp. 3258-3262, 2004.
23.
M. Sharir and S. Sifrony, "Coordinated motion planning for two independentrobots", Proc. 4th Annu. Symp. Computat. Geometry, pp. 319-328, 1988.
Contact IEEE to Subscribe

References

References is not available for this document.