{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T00:02:25Z","timestamp":1729641745143,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,2]]},"DOI":"10.1109\/icmech.2013.6518555","type":"proceedings-article","created":{"date-parts":[[2013,5,29]],"date-time":"2013-05-29T20:50:25Z","timestamp":1369860625000},"page":"316-320","source":"Crossref","is-referenced-by-count":0,"title":["Optimal robot path following for minimal time versus energy loss trade-off using sequential convex programming"],"prefix":"10.1109","author":[{"given":"F.","family":"Debrouwere","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Van Loock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Pipeleers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Quoc Tran Dinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Diehl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"De Schutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Swevers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1985.1104009"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1177\/027836498500400301"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2028959"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2176154"},{"key":"6","article-title":"Adjoint-based predictorcorrector sequential convex programming for parametric nonlinear optimization","author":"tran-dinh","year":"0","journal-title":"SIAM J Optimization"},{"key":"5","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","article-title":"A dc optimization algorithms for solving the trust region subproblem","volume":"8","author":"pham","year":"1998","journal-title":"SIAM J Optimization"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021765131316"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"8","first-page":"759","article-title":"On the convergence of the concave-convex procedure","author":"sriperumbudur","year":"2009","journal-title":"NIPS'09"}],"event":{"name":"2013 IEEE International Conference on Mechatronics (ICM)","start":{"date-parts":[[2013,2,27]]},"location":"Vicenza","end":{"date-parts":[[2013,3,1]]}},"container-title":["2013 IEEE International Conference on Mechatronics (ICM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6516157\/6518497\/06518555.pdf?arnumber=6518555","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T13:49:47Z","timestamp":1498052987000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6518555\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/icmech.2013.6518555","relation":{},"subject":[],"published":{"date-parts":[[2013,2]]}}}