1. Ben-Tal, A., Nemirovski, A.: More examples of CQ-representable functions/sets. Lectures on Modern Convex Optimization: Analysis. Algorithms and Engineering Applications, pp. 105–110. MPS-SIAM Series on Optimization, SIAM, Philadelphia, PA (2001)
2. Boyd, S.P., Vandenberghe, L.: Convex optimization. Cambridge University Press, Cambridge (2004)
3. Demyen, D., Buro, M.: Efficient triangulation-based pathfinding. AAAI 6, 942–947 (2006).
http://www.aaai.org/Papers/AAAI/2006/AAAI06-148.pdf
4. Eidenbenz, S.J., Widmayer, P.: An approximation algorithm for minimum convex cover with logarithmic performance guarantee. SIAM J. Comput. 32(3), 654–670 (2003).
http://epubs.siam.org/doi/abs/10.1137/S0097539702405139
5. Fallon, M., Kuindersma, S., Karumanchi, S., Antone, M., Schneider, T., Dai, H., Perez D’Arpino, C., Deits, R., DiCicco, M., Fourie, D., Koolen, T., Marion, P., Posa, M., Valenzuela, A., Yu, K.T., Shah, J., Iagnemma, K., Tedrake, R., Teller, S.: An architecture for online affordance-based perception and whole-body planning. J. Field Robot. (2014).
http://dspace.mit.edu/handle/1721.1/85690