New Formulation of Mixed-Integer Conic Programming for Globally Optimal Grasp Planning

R. T. Rockafellar, Convex analysis , ser. Princeton Mathematical Series. Princeton, N. J.: Princeton University Press, 1970

1970

Earlier work this paper cites.

J. Samuel and K. J. T. Pizzo, Iterative methods for nonlinear optimization problems . Prentice Hall, Englewood Cliffs, 1972

1972

Earlier work this paper cites.

Z. Li and S. S. Sastry, “Task-oriented optimal grasping by multifingered robot hands,” IEEE J. Robot. Autom. , vol. 4, no. 1, pp. 32–44, Feb 1988

1988

Earlier work this paper cites.

C. Ferrari and J. Canny, “Planning optimal grasps,” in Proc. IEEE Int. Conf. Robot. Autom. , 1992, pp. 2290–2295 vol.3

1992

Earlier work this paper cites.

T. Schouwenaars, B. De Moor, E. Feron, and J. How, “Mixed integer programming for multi-vehicle path planning,” in 2001 European Control Conference , 2001, pp. 2603–2608

2001

Earlier work this paper cites.

X. Zhu and J. Wang, “Synthesis of force-closure grasps on 3-d objects based on the q distance,” IEEE. T. Robotic. Autom. , vol. 19, no. 4, pp. 669–679, 2003

2003

Earlier work this paper cites.

A. T. Miller and P. K. Allen, “Graspit! a versatile simulator for robotic grasping,” IEEE Robot. Autom. Mag. , vol. 11, no. 4, pp. 110–122, 2004

2004

Earlier work this paper cites.

S. Buss, “Introduction to inverse kinematics with jacobian transpose, pseudoinverse and damped least squares methods,” IEEE. T. Robotic. Autom. , vol. 17, pp. 1–19, May 2004

2004

Earlier work this paper cites.

Y. J. Kim, M. C. Lin, and D. Manocha, “Incremental penetration depth estimation between convex polytopes using dual-space expansion,” IEEE Trans. Vis. Comput. Gr. , vol. 10, no. 2, pp. 152–163, 2004

2004

Earlier work this paper cites.

R. H. Byrd, J. Nocedal, and R. A. Waltz, “Knitro: An integrated package for nonlinear optimization,” in Large-Scale Nonlinear Optimization . Springer, 2006, pp. 35–59

2006

Earlier work this paper cites.

S. Popov, J. Gunther, H.-P. Seidel, and P. Slusallek, “Experiences with streaming construction of sah kd-trees,” in 2006 IEEE Symposium on Interactive Ray Tracing . IEEE, 2006, pp. 89–94

2006

Cited alongside, same era.

M. Ciocarlie, C. Goldfeder, and P. Allen, “Dexterous grasping via eigengrasps: A low-dimensional approach to a high-complexity problem,” in Robot.:Sci. Syst. Manipulation Workshop , 2007, pp. 19–25

2007

Cited alongside, same era.

L.-Y. Wei, “Parallel poisson disk sampling,” in ACM Trans.Gr. , vol. 27, no. 3, 2008, p. 20

2008

Cited alongside, same era.

D. Berenson, S. Srinivasa, and J. Kuffner, “Task space regions: A framework for pose-constrained manipulation planning,” Int. J. Robot. Res. , vol. 30, no. 12, pp. 1435–1460, 2011

2011

Cited alongside, same era.

J. P. Vielma and G. L. Nemhauser, “Modeling disjunctive constraints with a logarithmic number of binary variables and constraints,” Mathematical Programming , vol. 128, no. 1-2, pp. 49–72, 2011

H. Dai, A. Majumdar, and R. Tedrake, “Synthesis and optimization of force closure grasps via sequential semidefinite programming,” in Robot. Res. , 2018, pp. 285–305

2018

Later among the works it cites.

C. Zhu, K. Xu, S. Chaudhuri, R. Yi, and H. Zhang, “Scores: Shape composition with recursive substructure priors,” ACM Transactions on Graphics (TOG) , vol. 37, no. 6, pp. 1–14, 2018

2018

Later among the works it cites.

Y. Zhao, K. Xu, E. Zhu, X. Liu, X. Zhu, and J. Yin, “Triangle lasso for simultaneous clustering and optimization in graph datasets,” IEEE Transactions on Knowledge and Data Engineering , vol. 31, no. 8, pp. 1610–1623, 2018

2018

Later among the works it cites.

T. Gally, M. E. Pfetsch, and S. Ulbrich, “A framework for solving mixed-integer semidefinite programs,” Optim. Method. Softw. , vol. 33, no. 3, pp. 594–632, 2018

2018

Later among the works it cites.