{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:07:53Z","timestamp":1766066873637,"version":"3.38.0"},"reference-count":37,"publisher":"SAGE Publications","issue":"2-3","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-12-MONU-0015"],"award-info":[{"award-number":["ANR-12-MONU-0015"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["644271 AEROARMS"],"award-info":[{"award-number":["644271 AEROARMS"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of Robotics Research"],"published-print":{"date-parts":[[2019,3]]},"abstract":"<jats:p> This paper addresses the simultaneous design and path-planning problem, in which features associated to the bodies of a mobile system must be selected to find the best design that optimizes its motion between two given configurations. Solving individual path-planning problems for all possible designs and selecting the best result would be straightforward only for very simple cases. We propose a more efficient approach that combines discrete (design) and continuous (path) optimization in a single stage. It builds on an extension of a sampling-based algorithm, which simultaneously explores the configuration-space costmap of all possible designs, aiming to find the best path-design pair. The algorithm filters out unsuitable designs during the path search, which breaks down the combinatorial explosion. Illustrative results are presented for relatively simple (academic) robotic examples, showing that even in these simple cases, the computational cost can be reduced by two orders of magnitude with respect to the na\u00efve approach. A preliminary application to challenging problems in computational biology related to protein design is also discussed. <\/jats:p>","DOI":"10.1177\/0278364918783054","type":"journal-article","created":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T10:31:35Z","timestamp":1531132295000},"page":"375-387","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":11,"title":["Simultaneous system design and path planning: A sampling-based algorithm"],"prefix":"10.1177","volume":"38","author":[{"given":"Kevin","family":"Molloy","sequence":"first","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, France"}]},{"given":"Laurent","family":"Denarie","sequence":"additional","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, France"}]},{"given":"Marc","family":"Vaisset","sequence":"additional","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, France"}]},{"given":"Thierry","family":"Sim\u00e9on","sequence":"additional","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4660-0306","authenticated-orcid":false,"given":"Juan","family":"Cort\u00e9s","sequence":"additional","affiliation":[{"name":"LAAS-CNRS, Universit\u00e9 de Toulouse, CNRS, France"}]}],"member":"179","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"bibr1-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2012.07.002"},{"key":"bibr2-0278364918783054","doi-asserted-by":"crossref","unstructured":"Baykal C, Alterovitz R (2017) Asymptotically optimal design of piecewise cylindrical robots using motion planning. In: Robotics: Science and systems XIII (ed. Amato N, Srinivasa S, Ayanian N, et al.), Cambridge, MA, USA, 12\u201316 July 2017. Available at: http:\/\/www.roboticsproceedings.org\/rss13\/index.html","DOI":"10.15607\/RSS.2017.XIII.020"},{"key":"bibr3-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7353999"},{"key":"bibr4-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1931882100"},{"key":"bibr5-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1007\/10991541_7"},{"key":"bibr6-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.20021"},{"key":"bibr7-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942975"},{"key":"bibr8-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2015.2487881"},{"volume-title":"Algorithms in Structural Molecular Biology","year":"2011","author":"Donald BR","key":"bibr9-0278364918783054"},{"journal-title":"Parallel Computing","year":"2018","author":"Esta\u00f1a A","key":"bibr10-0278364918783054"},{"key":"bibr11-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1021\/bi00168a007"},{"key":"bibr12-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-anchem-062011-143024"},{"key":"bibr13-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1115\/1.2912772"},{"key":"bibr14-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913507795"},{"key":"bibr15-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1177\/0278364909352098"},{"key":"bibr16-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2010.2049527"},{"key":"bibr17-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915577958"},{"key":"bibr18-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1002\/bip.360221211"},{"key":"bibr19-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"bibr20-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"bibr21-0278364918783054","doi-asserted-by":"crossref","DOI":"10.1016\/B978-0-12-394292-0.09989-6","volume-title":"Methods in Protein Design","volume":"523","author":"Keating AE","year":"2013"},{"key":"bibr22-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"bibr23-0278364918783054","first-page":"293","volume-title":"Algorithmic and Computational Robotics: New Directions","author":"LaValle SM","year":"2001"},{"key":"bibr24-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1021\/bi00149a012"},{"key":"bibr25-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1177\/0278364915614386"},{"key":"bibr26-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511529627.012"},{"key":"bibr27-0278364918783054","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2005.I.041"},{"key":"bibr28-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"bibr29-0278364918783054","first-page":"219","volume":"413","author":"Moll M","year":"2008","journal-title":"Methods in Molecular Biology"},{"key":"bibr30-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1021\/bi010621k"},{"key":"bibr31-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1118082108"},{"key":"bibr32-0278364918783054","doi-asserted-by":"publisher","DOI":"10.2514\/6.2015-2322"},{"volume-title":"Handbook of Computational Molecular Biology","year":"2013","author":"Shehu A","key":"bibr33-0278364918783054"},{"key":"bibr34-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1177\/0278364904045471"},{"key":"bibr35-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1038\/nature12443"},{"key":"bibr36-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gku1028"},{"key":"bibr37-0278364918783054","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500210"}],"container-title":["The International Journal of Robotics Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364918783054","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0278364918783054","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0278364918783054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T04:02:25Z","timestamp":1741060945000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0278364918783054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":37,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["10.1177\/0278364918783054"],"URL":"https:\/\/doi.org\/10.1177\/0278364918783054","relation":{},"ISSN":["0278-3649","1741-3176"],"issn-type":[{"type":"print","value":"0278-3649"},{"type":"electronic","value":"1741-3176"}],"subject":[],"published":{"date-parts":[[2018,7,9]]}}}